./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3a877d22 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e174a1790a7df4dcba920aa7097618d66c8703aa13de1aa6af1a2c5f7cb0971c --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 14:00:58,903 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 14:00:58,904 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 14:00:58,940 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 14:00:58,943 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 14:00:58,947 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 14:00:58,949 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 14:00:58,954 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 14:00:58,956 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 14:00:58,961 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 14:00:58,961 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 14:00:58,962 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 14:00:58,963 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 14:00:58,965 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 14:00:58,966 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 14:00:58,969 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 14:00:58,970 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 14:00:58,971 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 14:00:58,974 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 14:00:58,975 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 14:00:58,977 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 14:00:58,980 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 14:00:58,980 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 14:00:58,981 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 14:00:58,984 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 14:00:58,985 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 14:00:58,985 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 14:00:58,987 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 14:00:58,987 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 14:00:58,988 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 14:00:58,988 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 14:00:58,988 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 14:00:58,989 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 14:00:58,990 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 14:00:58,991 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 14:00:58,991 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 14:00:58,992 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 14:00:58,992 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 14:00:58,992 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 14:00:58,993 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 14:00:58,993 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 14:00:58,994 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-15 14:00:59,022 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 14:00:59,022 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 14:00:59,023 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 14:00:59,023 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 14:00:59,023 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 14:00:59,024 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 14:00:59,024 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 14:00:59,024 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 14:00:59,024 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 14:00:59,024 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 14:00:59,025 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 14:00:59,025 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 14:00:59,026 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 14:00:59,026 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 14:00:59,026 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 14:00:59,026 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-15 14:00:59,026 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-15 14:00:59,026 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-15 14:00:59,026 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 14:00:59,027 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-15 14:00:59,027 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 14:00:59,027 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 14:00:59,027 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 14:00:59,027 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 14:00:59,027 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 14:00:59,028 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 14:00:59,028 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 14:00:59,029 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 14:00:59,029 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 14:00:59,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 14:00:59,030 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 14:00:59,030 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e174a1790a7df4dcba920aa7097618d66c8703aa13de1aa6af1a2c5f7cb0971c [2021-12-15 14:00:59,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 14:00:59,212 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 14:00:59,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 14:00:59,215 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 14:00:59,216 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 14:00:59,217 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i [2021-12-15 14:00:59,260 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/988b81b4b/ec51f996be4e4526bd932ef17f41e69b/FLAG4b3fc2630 [2021-12-15 14:00:59,679 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 14:00:59,679 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_of_cslls.i [2021-12-15 14:00:59,688 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/988b81b4b/ec51f996be4e4526bd932ef17f41e69b/FLAG4b3fc2630 [2021-12-15 14:00:59,702 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/988b81b4b/ec51f996be4e4526bd932ef17f41e69b [2021-12-15 14:00:59,704 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 14:00:59,706 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 14:00:59,707 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 14:00:59,707 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 14:00:59,710 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 14:00:59,710 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 02:00:59" (1/1) ... [2021-12-15 14:00:59,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51d2ce01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:00:59, skipping insertion in model container [2021-12-15 14:00:59,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 02:00:59" (1/1) ... [2021-12-15 14:00:59,717 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 14:00:59,751 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 14:00:59,997 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 14:01:00,006 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 14:01:00,057 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 14:01:00,077 INFO L208 MainTranslator]: Completed translation [2021-12-15 14:01:00,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:01:00 WrapperNode [2021-12-15 14:01:00,077 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 14:01:00,078 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 14:01:00,078 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 14:01:00,080 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 14:01:00,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:01:00" (1/1) ... [2021-12-15 14:01:00,111 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:01:00" (1/1) ... [2021-12-15 14:01:00,136 INFO L137 Inliner]: procedures = 123, calls = 63, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 216 [2021-12-15 14:01:00,136 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 14:01:00,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 14:01:00,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 14:01:00,137 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 14:01:00,143 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:01:00" (1/1) ... [2021-12-15 14:01:00,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:01:00" (1/1) ... [2021-12-15 14:01:00,145 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:01:00" (1/1) ... [2021-12-15 14:01:00,145 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:01:00" (1/1) ... [2021-12-15 14:01:00,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:01:00" (1/1) ... [2021-12-15 14:01:00,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:01:00" (1/1) ... [2021-12-15 14:01:00,156 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:01:00" (1/1) ... [2021-12-15 14:01:00,158 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 14:01:00,159 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 14:01:00,159 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 14:01:00,159 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 14:01:00,160 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:01:00" (1/1) ... [2021-12-15 14:01:00,177 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 14:01:00,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:01:00,195 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-15 14:01:00,202 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-15 14:01:00,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 14:01:00,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 14:01:00,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-15 14:01:00,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-15 14:01:00,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 14:01:00,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 14:01:00,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 14:01:00,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 14:01:00,303 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 14:01:00,304 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 14:01:00,714 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 14:01:00,721 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 14:01:00,721 INFO L301 CfgBuilder]: Removed 7 assume(true) statements. [2021-12-15 14:01:00,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 02:01:00 BoogieIcfgContainer [2021-12-15 14:01:00,723 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 14:01:00,725 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 14:01:00,725 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 14:01:00,728 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 14:01:00,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 02:00:59" (1/3) ... [2021-12-15 14:01:00,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62afec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 02:01:00, skipping insertion in model container [2021-12-15 14:01:00,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:01:00" (2/3) ... [2021-12-15 14:01:00,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62afec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 02:01:00, skipping insertion in model container [2021-12-15 14:01:00,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 02:01:00" (3/3) ... [2021-12-15 14:01:00,730 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_of_cslls.i [2021-12-15 14:01:00,735 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 14:01:00,735 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 104 error locations. [2021-12-15 14:01:00,773 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 14:01:00,779 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-15 14:01:00,779 INFO L340 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2021-12-15 14:01:00,795 INFO L276 IsEmpty]: Start isEmpty. Operand has 210 states, 105 states have (on average 2.219047619047619) internal successors, (233), 209 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:00,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-15 14:01:00,799 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:00,799 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-15 14:01:00,799 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-15 14:01:00,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:00,803 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-15 14:01:00,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:01:00,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302068781] [2021-12-15 14:01:00,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:00,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:01:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:00,931 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-15 14:01:00,931 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:01:00,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302068781] [2021-12-15 14:01:00,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302068781] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:01:00,932 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:01:00,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:01:00,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165037368] [2021-12-15 14:01:00,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:01:00,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:01:00,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:01:00,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:01:00,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:01:00,972 INFO L87 Difference]: Start difference. First operand has 210 states, 105 states have (on average 2.219047619047619) internal successors, (233), 209 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:01,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:01,200 INFO L93 Difference]: Finished difference Result 282 states and 304 transitions. [2021-12-15 14:01:01,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:01:01,202 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-15 14:01:01,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:01,210 INFO L225 Difference]: With dead ends: 282 [2021-12-15 14:01:01,212 INFO L226 Difference]: Without dead ends: 278 [2021-12-15 14:01:01,214 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-15 14:01:01,218 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 200 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:01,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 199 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:01:01,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-12-15 14:01:01,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 199. [2021-12-15 14:01:01,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 104 states have (on average 2.0673076923076925) internal successors, (215), 198 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:01,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 215 transitions. [2021-12-15 14:01:01,269 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 215 transitions. Word has length 3 [2021-12-15 14:01:01,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:01,269 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 215 transitions. [2021-12-15 14:01:01,270 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-15 14:01:01,270 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 215 transitions. [2021-12-15 14:01:01,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-15 14:01:01,270 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:01,270 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-15 14:01:01,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 14:01:01,271 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-15 14:01:01,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:01,273 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-15 14:01:01,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:01:01,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682328938] [2021-12-15 14:01:01,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:01,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:01:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:01,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:01:01,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:01:01,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682328938] [2021-12-15 14:01:01,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682328938] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:01:01,304 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:01:01,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:01:01,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857221170] [2021-12-15 14:01:01,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:01:01,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:01:01,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:01:01,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:01:01,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:01:01,306 INFO L87 Difference]: Start difference. First operand 199 states and 215 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:01,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:01,408 INFO L93 Difference]: Finished difference Result 197 states and 213 transitions. [2021-12-15 14:01:01,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:01:01,408 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-15 14:01:01,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:01,409 INFO L225 Difference]: With dead ends: 197 [2021-12-15 14:01:01,409 INFO L226 Difference]: Without dead ends: 197 [2021-12-15 14:01:01,409 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-15 14:01:01,410 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 2 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:01,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 319 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:01:01,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-12-15 14:01:01,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2021-12-15 14:01:01,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 104 states have (on average 2.048076923076923) internal successors, (213), 196 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:01,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 213 transitions. [2021-12-15 14:01:01,416 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 213 transitions. Word has length 3 [2021-12-15 14:01:01,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:01,416 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 213 transitions. [2021-12-15 14:01:01,416 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-15 14:01:01,416 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 213 transitions. [2021-12-15 14:01:01,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-15 14:01:01,416 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:01,417 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-15 14:01:01,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 14:01:01,417 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-15 14:01:01,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:01,417 INFO L85 PathProgramCache]: Analyzing trace with hash 889446153, now seen corresponding path program 1 times [2021-12-15 14:01:01,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:01:01,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481356511] [2021-12-15 14:01:01,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:01,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:01:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:01,486 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-15 14:01:01,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:01:01,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481356511] [2021-12-15 14:01:01,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481356511] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:01:01,491 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:01:01,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:01:01,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802895439] [2021-12-15 14:01:01,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:01:01,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 14:01:01,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:01:01,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 14:01:01,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:01:01,493 INFO L87 Difference]: Start difference. First operand 197 states and 213 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:01,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:01,755 INFO L93 Difference]: Finished difference Result 354 states and 382 transitions. [2021-12-15 14:01:01,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 14:01:01,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-15 14:01:01,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:01,757 INFO L225 Difference]: With dead ends: 354 [2021-12-15 14:01:01,757 INFO L226 Difference]: Without dead ends: 354 [2021-12-15 14:01:01,757 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:01:01,758 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 279 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:01,758 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 232 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:01:01,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-12-15 14:01:01,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 190. [2021-12-15 14:01:01,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 104 states have (on average 1.9807692307692308) internal successors, (206), 189 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:01,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 206 transitions. [2021-12-15 14:01:01,763 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 206 transitions. Word has length 6 [2021-12-15 14:01:01,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:01,763 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 206 transitions. [2021-12-15 14:01:01,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:01,763 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 206 transitions. [2021-12-15 14:01:01,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-15 14:01:01,764 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:01,764 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:01:01,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-15 14:01:01,764 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-15 14:01:01,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:01,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924364, now seen corresponding path program 1 times [2021-12-15 14:01:01,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:01:01,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185613504] [2021-12-15 14:01:01,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:01,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:01:01,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:01,850 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-15 14:01:01,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:01:01,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185613504] [2021-12-15 14:01:01,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185613504] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:01:01,851 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:01:01,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:01:01,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981156647] [2021-12-15 14:01:01,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:01:01,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:01:01,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:01:01,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:01:01,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:01:01,852 INFO L87 Difference]: Start difference. First operand 190 states and 206 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:02,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:02,004 INFO L93 Difference]: Finished difference Result 189 states and 205 transitions. [2021-12-15 14:01:02,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 14:01:02,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-15 14:01:02,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:02,005 INFO L225 Difference]: With dead ends: 189 [2021-12-15 14:01:02,005 INFO L226 Difference]: Without dead ends: 189 [2021-12-15 14:01:02,005 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-15 14:01:02,006 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 5 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:02,007 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 508 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:01:02,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-12-15 14:01:02,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2021-12-15 14:01:02,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 104 states have (on average 1.9711538461538463) internal successors, (205), 188 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:02,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 205 transitions. [2021-12-15 14:01:02,010 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 205 transitions. Word has length 10 [2021-12-15 14:01:02,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:02,011 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 205 transitions. [2021-12-15 14:01:02,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:02,011 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 205 transitions. [2021-12-15 14:01:02,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-15 14:01:02,011 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:02,011 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:01:02,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-15 14:01:02,011 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-15 14:01:02,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:02,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924365, now seen corresponding path program 1 times [2021-12-15 14:01:02,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:01:02,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889125803] [2021-12-15 14:01:02,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:02,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:01:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:02,057 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-15 14:01:02,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:01:02,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889125803] [2021-12-15 14:01:02,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889125803] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:01:02,058 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:01:02,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:01:02,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935173180] [2021-12-15 14:01:02,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:01:02,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:01:02,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:01:02,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:01:02,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:01:02,059 INFO L87 Difference]: Start difference. First operand 189 states and 205 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:02,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:02,209 INFO L93 Difference]: Finished difference Result 188 states and 204 transitions. [2021-12-15 14:01:02,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 14:01:02,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-15 14:01:02,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:02,210 INFO L225 Difference]: With dead ends: 188 [2021-12-15 14:01:02,211 INFO L226 Difference]: Without dead ends: 188 [2021-12-15 14:01:02,211 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-15 14:01:02,212 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 3 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:02,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 529 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:01:02,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-12-15 14:01:02,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2021-12-15 14:01:02,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 104 states have (on average 1.9615384615384615) internal successors, (204), 187 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:02,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 204 transitions. [2021-12-15 14:01:02,215 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 204 transitions. Word has length 10 [2021-12-15 14:01:02,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:02,215 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 204 transitions. [2021-12-15 14:01:02,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:02,216 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 204 transitions. [2021-12-15 14:01:02,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-15 14:01:02,216 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:02,216 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:01:02,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-15 14:01:02,216 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-15 14:01:02,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:02,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1114596085, now seen corresponding path program 1 times [2021-12-15 14:01:02,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:01:02,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808841109] [2021-12-15 14:01:02,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:02,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:01:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:02,325 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-15 14:01:02,326 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:01:02,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808841109] [2021-12-15 14:01:02,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808841109] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:01:02,326 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:01:02,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 14:01:02,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800008072] [2021-12-15 14:01:02,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:01:02,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 14:01:02,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:01:02,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 14:01:02,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-15 14:01:02,327 INFO L87 Difference]: Start difference. First operand 188 states and 204 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:02,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:02,692 INFO L93 Difference]: Finished difference Result 353 states and 389 transitions. [2021-12-15 14:01:02,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 14:01:02,692 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-15 14:01:02,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:02,693 INFO L225 Difference]: With dead ends: 353 [2021-12-15 14:01:02,693 INFO L226 Difference]: Without dead ends: 353 [2021-12-15 14:01:02,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2021-12-15 14:01:02,694 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 467 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:02,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [467 Valid, 853 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-15 14:01:02,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-12-15 14:01:02,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 192. [2021-12-15 14:01:02,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 108 states have (on average 1.9444444444444444) internal successors, (210), 191 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:02,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 210 transitions. [2021-12-15 14:01:02,699 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 210 transitions. Word has length 15 [2021-12-15 14:01:02,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:02,699 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 210 transitions. [2021-12-15 14:01:02,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:02,706 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 210 transitions. [2021-12-15 14:01:02,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-15 14:01:02,706 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:02,706 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:01:02,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-15 14:01:02,706 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-15 14:01:02,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:02,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1114596086, now seen corresponding path program 1 times [2021-12-15 14:01:02,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:01:02,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570562553] [2021-12-15 14:01:02,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:02,707 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:01:02,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:02,804 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-15 14:01:02,804 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:01:02,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570562553] [2021-12-15 14:01:02,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570562553] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:01:02,805 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:01:02,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 14:01:02,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025048292] [2021-12-15 14:01:02,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:01:02,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 14:01:02,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:01:02,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 14:01:02,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-15 14:01:02,806 INFO L87 Difference]: Start difference. First operand 192 states and 210 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:03,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:03,205 INFO L93 Difference]: Finished difference Result 347 states and 383 transitions. [2021-12-15 14:01:03,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 14:01:03,205 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-15 14:01:03,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:03,206 INFO L225 Difference]: With dead ends: 347 [2021-12-15 14:01:03,206 INFO L226 Difference]: Without dead ends: 347 [2021-12-15 14:01:03,207 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2021-12-15 14:01:03,207 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 452 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:03,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [452 Valid, 490 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-15 14:01:03,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2021-12-15 14:01:03,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 192. [2021-12-15 14:01:03,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 108 states have (on average 1.9351851851851851) internal successors, (209), 191 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:03,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 209 transitions. [2021-12-15 14:01:03,212 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 209 transitions. Word has length 15 [2021-12-15 14:01:03,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:03,212 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 209 transitions. [2021-12-15 14:01:03,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:03,212 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 209 transitions. [2021-12-15 14:01:03,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-15 14:01:03,213 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:03,213 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:01:03,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-15 14:01:03,213 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-15 14:01:03,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:03,214 INFO L85 PathProgramCache]: Analyzing trace with hash 192740277, now seen corresponding path program 1 times [2021-12-15 14:01:03,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:01:03,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939966479] [2021-12-15 14:01:03,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:03,214 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:01:03,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:03,238 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-15 14:01:03,238 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:01:03,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939966479] [2021-12-15 14:01:03,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939966479] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:01:03,239 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:01:03,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:01:03,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062316359] [2021-12-15 14:01:03,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:01:03,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:01:03,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:01:03,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:01:03,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:01:03,240 INFO L87 Difference]: Start difference. First operand 192 states and 209 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:03,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:03,358 INFO L93 Difference]: Finished difference Result 316 states and 348 transitions. [2021-12-15 14:01:03,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:01:03,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-15 14:01:03,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:03,360 INFO L225 Difference]: With dead ends: 316 [2021-12-15 14:01:03,360 INFO L226 Difference]: Without dead ends: 316 [2021-12-15 14:01:03,361 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-15 14:01:03,361 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 168 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:03,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 348 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:01:03,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-12-15 14:01:03,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 189. [2021-12-15 14:01:03,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 108 states have (on average 1.9074074074074074) internal successors, (206), 188 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:03,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 206 transitions. [2021-12-15 14:01:03,368 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 206 transitions. Word has length 16 [2021-12-15 14:01:03,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:03,368 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 206 transitions. [2021-12-15 14:01:03,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:03,369 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 206 transitions. [2021-12-15 14:01:03,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-15 14:01:03,369 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:03,369 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:01:03,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-15 14:01:03,369 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-15 14:01:03,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:03,370 INFO L85 PathProgramCache]: Analyzing trace with hash 192740278, now seen corresponding path program 1 times [2021-12-15 14:01:03,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:01:03,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233313192] [2021-12-15 14:01:03,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:03,370 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:01:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:03,411 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-15 14:01:03,411 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:01:03,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233313192] [2021-12-15 14:01:03,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233313192] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:01:03,411 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:01:03,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:01:03,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33346158] [2021-12-15 14:01:03,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:01:03,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:01:03,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:01:03,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:01:03,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:01:03,412 INFO L87 Difference]: Start difference. First operand 189 states and 206 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:03,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:03,526 INFO L93 Difference]: Finished difference Result 293 states and 325 transitions. [2021-12-15 14:01:03,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:01:03,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-15 14:01:03,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:03,527 INFO L225 Difference]: With dead ends: 293 [2021-12-15 14:01:03,527 INFO L226 Difference]: Without dead ends: 293 [2021-12-15 14:01:03,527 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-15 14:01:03,528 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 139 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:03,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 359 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:01:03,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-12-15 14:01:03,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 187. [2021-12-15 14:01:03,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 108 states have (on average 1.8888888888888888) internal successors, (204), 186 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:03,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 204 transitions. [2021-12-15 14:01:03,531 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 204 transitions. Word has length 16 [2021-12-15 14:01:03,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:03,531 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 204 transitions. [2021-12-15 14:01:03,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:03,531 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 204 transitions. [2021-12-15 14:01:03,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-15 14:01:03,532 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:03,532 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:01:03,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-15 14:01:03,532 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-15 14:01:03,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:03,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1678809590, now seen corresponding path program 1 times [2021-12-15 14:01:03,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:01:03,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547744895] [2021-12-15 14:01:03,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:03,533 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:01:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:03,555 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-15 14:01:03,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:01:03,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547744895] [2021-12-15 14:01:03,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547744895] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:01:03,555 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:01:03,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:01:03,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982585215] [2021-12-15 14:01:03,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:01:03,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 14:01:03,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:01:03,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 14:01:03,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:01:03,556 INFO L87 Difference]: Start difference. First operand 187 states and 204 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:03,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:03,716 INFO L93 Difference]: Finished difference Result 254 states and 278 transitions. [2021-12-15 14:01:03,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 14:01:03,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-15 14:01:03,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:03,718 INFO L225 Difference]: With dead ends: 254 [2021-12-15 14:01:03,718 INFO L226 Difference]: Without dead ends: 254 [2021-12-15 14:01:03,718 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:01:03,718 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 327 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:03,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 153 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:01:03,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-12-15 14:01:03,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 176. [2021-12-15 14:01:03,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 112 states have (on average 1.7589285714285714) internal successors, (197), 175 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:03,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 197 transitions. [2021-12-15 14:01:03,721 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 197 transitions. Word has length 17 [2021-12-15 14:01:03,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:03,722 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 197 transitions. [2021-12-15 14:01:03,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:03,722 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 197 transitions. [2021-12-15 14:01:03,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-15 14:01:03,722 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:03,722 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:01:03,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-15 14:01:03,722 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-15 14:01:03,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:03,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1678809591, now seen corresponding path program 1 times [2021-12-15 14:01:03,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:01:03,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050168987] [2021-12-15 14:01:03,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:03,723 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:01:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:03,758 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-15 14:01:03,758 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:01:03,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050168987] [2021-12-15 14:01:03,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050168987] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:01:03,758 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:01:03,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:01:03,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494989734] [2021-12-15 14:01:03,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:01:03,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:01:03,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:01:03,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:01:03,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:01:03,759 INFO L87 Difference]: Start difference. First operand 176 states and 197 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:04,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:04,008 INFO L93 Difference]: Finished difference Result 438 states and 492 transitions. [2021-12-15 14:01:04,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 14:01:04,008 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-15 14:01:04,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:04,010 INFO L225 Difference]: With dead ends: 438 [2021-12-15 14:01:04,010 INFO L226 Difference]: Without dead ends: 438 [2021-12-15 14:01:04,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:01:04,010 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 712 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:04,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [712 Valid, 293 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:01:04,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-12-15 14:01:04,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 318. [2021-12-15 14:01:04,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 254 states have (on average 1.7598425196850394) internal successors, (447), 317 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:04,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 447 transitions. [2021-12-15 14:01:04,016 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 447 transitions. Word has length 17 [2021-12-15 14:01:04,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:04,016 INFO L470 AbstractCegarLoop]: Abstraction has 318 states and 447 transitions. [2021-12-15 14:01:04,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:04,017 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 447 transitions. [2021-12-15 14:01:04,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-15 14:01:04,017 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:04,017 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:01:04,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-15 14:01:04,018 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-15 14:01:04,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:04,018 INFO L85 PathProgramCache]: Analyzing trace with hash -445669701, now seen corresponding path program 1 times [2021-12-15 14:01:04,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:01:04,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613562533] [2021-12-15 14:01:04,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:04,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:01:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:04,076 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-15 14:01:04,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:01:04,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613562533] [2021-12-15 14:01:04,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613562533] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:01:04,077 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:01:04,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 14:01:04,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483201508] [2021-12-15 14:01:04,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:01:04,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 14:01:04,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:01:04,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 14:01:04,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-15 14:01:04,078 INFO L87 Difference]: Start difference. First operand 318 states and 447 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:04,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:04,463 INFO L93 Difference]: Finished difference Result 784 states and 1126 transitions. [2021-12-15 14:01:04,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 14:01:04,463 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-15 14:01:04,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:04,465 INFO L225 Difference]: With dead ends: 784 [2021-12-15 14:01:04,465 INFO L226 Difference]: Without dead ends: 784 [2021-12-15 14:01:04,466 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-12-15 14:01:04,466 INFO L933 BasicCegarLoop]: 224 mSDtfsCounter, 368 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:04,466 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [368 Valid, 1029 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-15 14:01:04,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2021-12-15 14:01:04,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 317. [2021-12-15 14:01:04,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 254 states have (on average 1.7559055118110236) internal successors, (446), 316 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:04,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 446 transitions. [2021-12-15 14:01:04,474 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 446 transitions. Word has length 19 [2021-12-15 14:01:04,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:04,474 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 446 transitions. [2021-12-15 14:01:04,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:04,474 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 446 transitions. [2021-12-15 14:01:04,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-15 14:01:04,475 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:04,475 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:01:04,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-15 14:01:04,475 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-15 14:01:04,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:04,475 INFO L85 PathProgramCache]: Analyzing trace with hash -445669700, now seen corresponding path program 1 times [2021-12-15 14:01:04,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:01:04,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884551382] [2021-12-15 14:01:04,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:04,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:01:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:04,599 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-15 14:01:04,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:01:04,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884551382] [2021-12-15 14:01:04,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884551382] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:01:04,600 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:01:04,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-15 14:01:04,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110829145] [2021-12-15 14:01:04,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:01:04,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-15 14:01:04,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:01:04,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-15 14:01:04,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-15 14:01:04,601 INFO L87 Difference]: Start difference. First operand 317 states and 446 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:05,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:05,157 INFO L93 Difference]: Finished difference Result 603 states and 842 transitions. [2021-12-15 14:01:05,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-15 14:01:05,158 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-15 14:01:05,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:05,159 INFO L225 Difference]: With dead ends: 603 [2021-12-15 14:01:05,159 INFO L226 Difference]: Without dead ends: 603 [2021-12-15 14:01:05,160 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2021-12-15 14:01:05,160 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 389 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:05,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [389 Valid, 957 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-15 14:01:05,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2021-12-15 14:01:05,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 321. [2021-12-15 14:01:05,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 258 states have (on average 1.744186046511628) internal successors, (450), 320 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:05,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 450 transitions. [2021-12-15 14:01:05,165 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 450 transitions. Word has length 19 [2021-12-15 14:01:05,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:05,165 INFO L470 AbstractCegarLoop]: Abstraction has 321 states and 450 transitions. [2021-12-15 14:01:05,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:05,166 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 450 transitions. [2021-12-15 14:01:05,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-15 14:01:05,166 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:05,166 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:01:05,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-15 14:01:05,166 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-15 14:01:05,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:05,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1571609538, now seen corresponding path program 1 times [2021-12-15 14:01:05,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:01:05,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989917989] [2021-12-15 14:01:05,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:05,167 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:01:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:05,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:01:05,194 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:01:05,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989917989] [2021-12-15 14:01:05,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989917989] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:01:05,194 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:01:05,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:01:05,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750148515] [2021-12-15 14:01:05,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:01:05,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:01:05,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:01:05,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:01:05,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:01:05,196 INFO L87 Difference]: Start difference. First operand 321 states and 450 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:05,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:05,207 INFO L93 Difference]: Finished difference Result 395 states and 528 transitions. [2021-12-15 14:01:05,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:01:05,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-15 14:01:05,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:05,209 INFO L225 Difference]: With dead ends: 395 [2021-12-15 14:01:05,209 INFO L226 Difference]: Without dead ends: 395 [2021-12-15 14:01:05,209 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:01:05,210 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 163 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:05,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 296 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:01:05,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2021-12-15 14:01:05,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 361. [2021-12-15 14:01:05,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 298 states have (on average 1.7718120805369129) internal successors, (528), 360 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:05,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 528 transitions. [2021-12-15 14:01:05,216 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 528 transitions. Word has length 19 [2021-12-15 14:01:05,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:05,216 INFO L470 AbstractCegarLoop]: Abstraction has 361 states and 528 transitions. [2021-12-15 14:01:05,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:05,216 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 528 transitions. [2021-12-15 14:01:05,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-15 14:01:05,217 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:05,217 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-15 14:01:05,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-15 14:01:05,217 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-15 14:01:05,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:05,218 INFO L85 PathProgramCache]: Analyzing trace with hash -727311539, now seen corresponding path program 1 times [2021-12-15 14:01:05,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:01:05,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622907500] [2021-12-15 14:01:05,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:05,218 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:01:05,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:05,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:01:05,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:01:05,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622907500] [2021-12-15 14:01:05,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622907500] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:01:05,246 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:01:05,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:01:05,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532586724] [2021-12-15 14:01:05,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:01:05,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:01:05,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:01:05,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:01:05,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:01:05,247 INFO L87 Difference]: Start difference. First operand 361 states and 528 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:05,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:05,253 INFO L93 Difference]: Finished difference Result 365 states and 532 transitions. [2021-12-15 14:01:05,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:01:05,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-15 14:01:05,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:05,255 INFO L225 Difference]: With dead ends: 365 [2021-12-15 14:01:05,255 INFO L226 Difference]: Without dead ends: 365 [2021-12-15 14:01:05,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:01:05,257 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 0 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:05,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:01:05,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-12-15 14:01:05,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2021-12-15 14:01:05,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 302 states have (on average 1.7615894039735098) internal successors, (532), 364 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:05,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 532 transitions. [2021-12-15 14:01:05,262 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 532 transitions. Word has length 23 [2021-12-15 14:01:05,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:05,262 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 532 transitions. [2021-12-15 14:01:05,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:05,262 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 532 transitions. [2021-12-15 14:01:05,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-15 14:01:05,264 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:05,265 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:01:05,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-15 14:01:05,265 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-15 14:01:05,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:05,265 INFO L85 PathProgramCache]: Analyzing trace with hash 97933121, now seen corresponding path program 1 times [2021-12-15 14:01:05,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:01:05,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558391988] [2021-12-15 14:01:05,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:05,266 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:01:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:05,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:01:05,417 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:01:05,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558391988] [2021-12-15 14:01:05,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558391988] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:01:05,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359872481] [2021-12-15 14:01:05,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:05,419 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:01:05,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:01:05,421 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-15 14:01:05,422 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-15 14:01:05,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:05,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-15 14:01:05,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:01:05,599 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-15 14:01:05,626 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:01:05,626 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-15 14:01:05,656 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-15 14:01:05,701 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:01:05,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2021-12-15 14:01:05,720 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:01:05,720 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-15 14:01:05,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-12-15 14:01:05,791 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:01:05,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2021-12-15 14:01:05,837 INFO L354 Elim1Store]: treesize reduction 36, result has 37.9 percent of original size [2021-12-15 14:01:05,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 33 [2021-12-15 14:01:05,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-12-15 14:01:05,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:01:05,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:01:05,978 INFO L354 Elim1Store]: treesize reduction 10, result has 76.7 percent of original size [2021-12-15 14:01:05,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 74 [2021-12-15 14:01:06,010 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_462 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem11#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_462) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)))) is different from false [2021-12-15 14:01:06,016 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_462 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_462) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))))) is different from false [2021-12-15 14:01:06,024 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_462 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_461)) (.cse2 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_462) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))))) is different from false [2021-12-15 14:01:06,473 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_22| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_460 (Array Int Int)) (v_ArrVal_462 (Array Int Int))) (or (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_460) |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_461)) (.cse2 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_462) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2)))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22|))))) is different from false [2021-12-15 14:01:06,538 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:01:06,538 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 72 treesize of output 53 [2021-12-15 14:01:06,540 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:01:06,542 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 244 treesize of output 190 [2021-12-15 14:01:06,549 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 141 treesize of output 109 [2021-12-15 14:01:06,555 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 109 treesize of output 93 [2021-12-15 14:01:06,562 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-15 14:01:06,562 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-15 14:01:06,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-15 14:01:06,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359872481] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:01:06,633 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:01:06,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 12] total 25 [2021-12-15 14:01:06,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865419593] [2021-12-15 14:01:06,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:01:06,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-15 14:01:06,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:01:06,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-15 14:01:06,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=390, Unknown=10, NotChecked=172, Total=650 [2021-12-15 14:01:06,634 INFO L87 Difference]: Start difference. First operand 365 states and 532 transitions. Second operand has 26 states, 25 states have (on average 2.72) internal successors, (68), 26 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:07,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:07,514 INFO L93 Difference]: Finished difference Result 955 states and 1346 transitions. [2021-12-15 14:01:07,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-15 14:01:07,515 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.72) internal successors, (68), 26 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-15 14:01:07,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:07,517 INFO L225 Difference]: With dead ends: 955 [2021-12-15 14:01:07,517 INFO L226 Difference]: Without dead ends: 955 [2021-12-15 14:01:07,518 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=213, Invalid=785, Unknown=10, NotChecked=252, Total=1260 [2021-12-15 14:01:07,518 INFO L933 BasicCegarLoop]: 225 mSDtfsCounter, 941 mSDsluCounter, 2755 mSDsCounter, 0 mSdLazyCounter, 1433 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 2980 SdHoareTripleChecker+Invalid, 3329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1840 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:07,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [941 Valid, 2980 Invalid, 3329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1433 Invalid, 0 Unknown, 1840 Unchecked, 0.6s Time] [2021-12-15 14:01:07,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2021-12-15 14:01:07,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 364. [2021-12-15 14:01:07,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 302 states have (on average 1.7582781456953642) internal successors, (531), 363 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:07,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 531 transitions. [2021-12-15 14:01:07,526 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 531 transitions. Word has length 24 [2021-12-15 14:01:07,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:07,526 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 531 transitions. [2021-12-15 14:01:07,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.72) internal successors, (68), 26 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:07,527 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 531 transitions. [2021-12-15 14:01:07,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-15 14:01:07,530 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:07,530 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:01:07,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-15 14:01:07,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-15 14:01:07,743 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-15 14:01:07,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:07,744 INFO L85 PathProgramCache]: Analyzing trace with hash 97933122, now seen corresponding path program 1 times [2021-12-15 14:01:07,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:01:07,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105049926] [2021-12-15 14:01:07,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:07,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:01:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:07,989 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:01:07,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:01:07,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105049926] [2021-12-15 14:01:07,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105049926] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:01:07,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778654131] [2021-12-15 14:01:07,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:07,990 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:01:07,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:01:07,992 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-15 14:01:08,006 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-15 14:01:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:08,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 44 conjunts are in the unsatisfiable core [2021-12-15 14:01:08,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:01:08,102 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-15 14:01:08,114 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:01:08,114 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-15 14:01:08,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-15 14:01:08,136 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-15 14:01:08,191 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:01:08,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2021-12-15 14:01:08,194 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 12 treesize of output 11 [2021-12-15 14:01:08,211 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:01:08,211 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-15 14:01:08,291 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 47 treesize of output 45 [2021-12-15 14:01:08,297 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-12-15 14:01:08,379 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:01:08,379 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 76 treesize of output 71 [2021-12-15 14:01:08,384 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 52 treesize of output 39 [2021-12-15 14:01:08,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:08,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-12-15 14:01:08,471 INFO L354 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2021-12-15 14:01:08,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2021-12-15 14:01:08,513 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 28 [2021-12-15 14:01:08,516 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 39 treesize of output 17 [2021-12-15 14:01:08,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:01:08,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:01:09,733 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:01:09,733 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 211 treesize of output 215 [2021-12-15 14:01:09,740 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-15 14:01:09,741 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-15 14:01:10,288 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_561 Int) (|v_ULTIMATE.start_main_#t~mem11#1.offset_10| Int) (v_ArrVal_560 (Array Int Int))) (or (and (forall ((v_ArrVal_559 (Array Int Int))) (<= 0 (let ((.cse2 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560)) (.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_559) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem11#1.offset_10| v_ArrVal_561))) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2)))) (forall ((v_prenex_9 (Array Int Int))) (<= (let ((.cse5 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560)) (.cse4 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_9) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5))) (store .cse3 .cse4 (store (select .cse3 .cse4) |v_ULTIMATE.start_main_#t~mem11#1.offset_10| v_ArrVal_561))) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5)) |c_ULTIMATE.start_main_#t~mem9#1.offset|)) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem9#1.base| (let ((.cse7 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_9))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse7) v_ArrVal_563)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse7)))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= (let ((.cse9 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_9))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse9) v_ArrVal_563)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse9)) |c_ULTIMATE.start_main_#t~mem9#1.base|))) (< v_ArrVal_561 |c_ULTIMATE.start_main_~tmpList~0#1.offset|) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) |v_ULTIMATE.start_main_#t~mem11#1.offset_10|) (< |v_ULTIMATE.start_main_#t~mem11#1.offset_10| 0))) is different from false [2021-12-15 14:01:10,692 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_561 Int) (|v_ULTIMATE.start_main_#t~mem11#1.offset_10| Int) (v_ArrVal_560 (Array Int Int))) (or (and (forall ((v_ArrVal_559 (Array Int Int))) (<= 0 (let ((.cse2 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560)) (.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_559) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem11#1.offset_10| v_ArrVal_561))) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2)))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_9))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_ArrVal_563)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4)))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5) (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_9))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5) v_ArrVal_563)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5)))) (forall ((v_prenex_9 (Array Int Int))) (let ((.cse9 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (<= (select (select (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560)) (.cse8 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_9) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse9))) (store .cse7 .cse8 (store (select .cse7 .cse8) |v_ULTIMATE.start_main_#t~mem11#1.offset_10| v_ArrVal_561))) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse9) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse9))))) (< v_ArrVal_561 |c_ULTIMATE.start_main_~tmpList~0#1.offset|) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) |v_ULTIMATE.start_main_#t~mem11#1.offset_10|) (< |v_ULTIMATE.start_main_#t~mem11#1.offset_10| 0))) is different from false [2021-12-15 14:01:12,157 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_557 (Array Int Int)) (|v_ULTIMATE.start_main_~tmpList~0#1.base_25| Int) (v_ArrVal_561 Int) (|v_ULTIMATE.start_main_#t~mem11#1.offset_10| Int) (v_ArrVal_560 (Array Int Int))) (or (and (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_558 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_557)) (.cse2 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (<= (select (select (let ((.cse0 (store .cse3 |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560)) (.cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_9) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem11#1.offset_10| v_ArrVal_561))) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) (select (select .cse3 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2)))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_558)) (.cse5 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (= (select (select .cse4 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5) (select (select (let ((.cse6 (store .cse4 |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_9))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5) v_ArrVal_563)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5)))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_558)) (.cse8 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (= (select (select (let ((.cse7 (store .cse9 |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_9))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse8) v_ArrVal_563)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse8) (select (select .cse9 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse8))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_25|))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_557) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) |v_ULTIMATE.start_main_#t~mem11#1.offset_10|) (< |v_ULTIMATE.start_main_#t~mem11#1.offset_10| 0) (< v_ArrVal_561 0))) is different from false [2021-12-15 14:01:12,802 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_557 (Array Int Int)) (|v_ULTIMATE.start_main_~tmpList~0#1.base_25| Int) (v_ArrVal_561 Int) (|v_ULTIMATE.start_main_#t~mem11#1.offset_10| Int) (v_ArrVal_560 (Array Int Int))) (or (and (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_558))) (= (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) (select (select (let ((.cse2 (store .cse0 |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_9))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_563)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_558 (Array Int Int))) (let ((.cse6 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_557))) (<= (select (select (let ((.cse3 (store .cse7 |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560)) (.cse4 (select (select (store (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_9) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6))) (store .cse3 .cse4 (store (select .cse3 .cse4) |v_ULTIMATE.start_main_#t~mem11#1.offset_10| v_ArrVal_561))) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6) (select (select .cse7 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6)))))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (let ((.cse9 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse10 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse9) v_ArrVal_558))) (= (select (select (let ((.cse8 (store .cse10 |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_9))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse9) v_ArrVal_563)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse9) (select (select .cse10 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse9)))))) (< (let ((.cse11 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse11) v_ArrVal_557) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse11)) |v_ULTIMATE.start_main_#t~mem11#1.offset_10|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_25|))) (< |v_ULTIMATE.start_main_#t~mem11#1.offset_10| 0) (< v_ArrVal_561 0))) is different from false [2021-12-15 14:01:13,220 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:01:13,220 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 277 treesize of output 247 [2021-12-15 14:01:13,229 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:01:13,229 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 247 treesize of output 177 [2021-12-15 14:01:13,232 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:01:13,235 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 947 treesize of output 761 [2021-12-15 14:01:13,259 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:01:13,289 INFO L354 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2021-12-15 14:01:13,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3720 treesize of output 3548 [2021-12-15 14:01:13,391 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 3928 treesize of output 3800 [2021-12-15 14:01:13,415 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 4034 treesize of output 3670 [2021-12-15 14:01:13,524 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Should have been eliminated by DER [2021-12-15 14:01:13,524 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-15 14:01:13,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2021-12-15 14:01:13,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431381265] [2021-12-15 14:01:13,524 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-15 14:01:13,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-15 14:01:13,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:01:13,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-15 14:01:13,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=763, Unknown=12, NotChecked=236, Total=1122 [2021-12-15 14:01:13,526 INFO L87 Difference]: Start difference. First operand 364 states and 531 transitions. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 13 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-15 14:01:13,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 14:01:13,527 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=763, Unknown=12, NotChecked=236, Total=1122 [2021-12-15 14:01:13,527 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:13,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:01:13,549 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-15 14:01:13,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-15 14:01:13,747 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@72f28007 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:455) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-15 14:01:13,750 INFO L158 Benchmark]: Toolchain (without parser) took 14044.13ms. Allocated memory was 98.6MB in the beginning and 237.0MB in the end (delta: 138.4MB). Free memory was 67.7MB in the beginning and 164.1MB in the end (delta: -96.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2021-12-15 14:01:13,751 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 98.6MB. Free memory is still 55.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 14:01:13,751 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.45ms. Allocated memory is still 98.6MB. Free memory was 67.5MB in the beginning and 65.1MB in the end (delta: 2.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-15 14:01:13,751 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.23ms. Allocated memory is still 98.6MB. Free memory was 65.1MB in the beginning and 62.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 14:01:13,751 INFO L158 Benchmark]: Boogie Preprocessor took 21.87ms. Allocated memory is still 98.6MB. Free memory was 62.4MB in the beginning and 60.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 14:01:13,751 INFO L158 Benchmark]: RCFGBuilder took 563.82ms. Allocated memory was 98.6MB in the beginning and 130.0MB in the end (delta: 31.5MB). Free memory was 60.4MB in the beginning and 90.3MB in the end (delta: -30.0MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2021-12-15 14:01:13,751 INFO L158 Benchmark]: TraceAbstraction took 13024.85ms. Allocated memory was 130.0MB in the beginning and 237.0MB in the end (delta: 107.0MB). Free memory was 89.7MB in the beginning and 164.1MB in the end (delta: -74.4MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. [2021-12-15 14:01:13,752 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 98.6MB. Free memory is still 55.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 370.45ms. Allocated memory is still 98.6MB. Free memory was 67.5MB in the beginning and 65.1MB in the end (delta: 2.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.23ms. Allocated memory is still 98.6MB. Free memory was 65.1MB in the beginning and 62.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.87ms. Allocated memory is still 98.6MB. Free memory was 62.4MB in the beginning and 60.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 563.82ms. Allocated memory was 98.6MB in the beginning and 130.0MB in the end (delta: 31.5MB). Free memory was 60.4MB in the beginning and 90.3MB in the end (delta: -30.0MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. * TraceAbstraction took 13024.85ms. Allocated memory was 130.0MB in the beginning and 237.0MB in the end (delta: 107.0MB). Free memory was 89.7MB in the beginning and 164.1MB in the end (delta: -74.4MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@72f28007 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@72f28007: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-15 14:01:13,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e174a1790a7df4dcba920aa7097618d66c8703aa13de1aa6af1a2c5f7cb0971c --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 14:01:15,505 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 14:01:15,508 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 14:01:15,540 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 14:01:15,540 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 14:01:15,543 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 14:01:15,544 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 14:01:15,548 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 14:01:15,549 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 14:01:15,553 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 14:01:15,554 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 14:01:15,560 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 14:01:15,561 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 14:01:15,563 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 14:01:15,564 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 14:01:15,566 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 14:01:15,567 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 14:01:15,568 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 14:01:15,569 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 14:01:15,574 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 14:01:15,575 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 14:01:15,576 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 14:01:15,577 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 14:01:15,578 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 14:01:15,583 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 14:01:15,583 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 14:01:15,583 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 14:01:15,584 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 14:01:15,585 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 14:01:15,585 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 14:01:15,585 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 14:01:15,586 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 14:01:15,587 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 14:01:15,587 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 14:01:15,588 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 14:01:15,588 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 14:01:15,589 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 14:01:15,589 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 14:01:15,589 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 14:01:15,590 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 14:01:15,591 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 14:01:15,594 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-15 14:01:15,623 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 14:01:15,623 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 14:01:15,624 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 14:01:15,624 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 14:01:15,624 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 14:01:15,625 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 14:01:15,625 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 14:01:15,626 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 14:01:15,626 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 14:01:15,626 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 14:01:15,627 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 14:01:15,627 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 14:01:15,627 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 14:01:15,627 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 14:01:15,627 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 14:01:15,627 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-15 14:01:15,627 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-15 14:01:15,627 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-15 14:01:15,628 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 14:01:15,628 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-15 14:01:15,628 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-15 14:01:15,628 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-15 14:01:15,628 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 14:01:15,628 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 14:01:15,628 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 14:01:15,628 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 14:01:15,628 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 14:01:15,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 14:01:15,629 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 14:01:15,629 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 14:01:15,629 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-15 14:01:15,629 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-15 14:01:15,629 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 14:01:15,629 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-15 14:01:15,630 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e174a1790a7df4dcba920aa7097618d66c8703aa13de1aa6af1a2c5f7cb0971c [2021-12-15 14:01:15,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 14:01:15,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 14:01:15,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 14:01:15,891 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 14:01:15,892 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 14:01:15,893 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i [2021-12-15 14:01:15,959 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db099a226/7716331831364e73b25425b49789ffdb/FLAG6430eabf3 [2021-12-15 14:01:16,347 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 14:01:16,348 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_of_cslls.i [2021-12-15 14:01:16,363 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db099a226/7716331831364e73b25425b49789ffdb/FLAG6430eabf3 [2021-12-15 14:01:16,376 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db099a226/7716331831364e73b25425b49789ffdb [2021-12-15 14:01:16,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 14:01:16,379 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 14:01:16,381 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 14:01:16,382 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 14:01:16,384 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 14:01:16,385 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 02:01:16" (1/1) ... [2021-12-15 14:01:16,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e2ba225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:01:16, skipping insertion in model container [2021-12-15 14:01:16,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 02:01:16" (1/1) ... [2021-12-15 14:01:16,391 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 14:01:16,429 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 14:01:16,705 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 14:01:16,719 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 14:01:16,772 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 14:01:16,795 INFO L208 MainTranslator]: Completed translation [2021-12-15 14:01:16,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:01:16 WrapperNode [2021-12-15 14:01:16,797 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 14:01:16,798 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 14:01:16,798 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 14:01:16,798 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 14:01:16,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:01:16" (1/1) ... [2021-12-15 14:01:16,820 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:01:16" (1/1) ... [2021-12-15 14:01:16,857 INFO L137 Inliner]: procedures = 124, calls = 63, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 201 [2021-12-15 14:01:16,857 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 14:01:16,858 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 14:01:16,858 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 14:01:16,859 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 14:01:16,864 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:01:16" (1/1) ... [2021-12-15 14:01:16,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:01:16" (1/1) ... [2021-12-15 14:01:16,878 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:01:16" (1/1) ... [2021-12-15 14:01:16,878 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:01:16" (1/1) ... [2021-12-15 14:01:16,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:01:16" (1/1) ... [2021-12-15 14:01:16,903 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:01:16" (1/1) ... [2021-12-15 14:01:16,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:01:16" (1/1) ... [2021-12-15 14:01:16,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 14:01:16,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 14:01:16,913 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 14:01:16,913 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 14:01:16,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:01:16" (1/1) ... [2021-12-15 14:01:16,918 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 14:01:16,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:01:16,934 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-15 14:01:16,978 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-15 14:01:16,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 14:01:16,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 14:01:16,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-15 14:01:16,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-15 14:01:16,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 14:01:16,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-15 14:01:16,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 14:01:16,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 14:01:17,102 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 14:01:17,103 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 14:01:17,766 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 14:01:17,771 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 14:01:17,772 INFO L301 CfgBuilder]: Removed 7 assume(true) statements. [2021-12-15 14:01:17,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 02:01:17 BoogieIcfgContainer [2021-12-15 14:01:17,773 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 14:01:17,774 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 14:01:17,774 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 14:01:17,776 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 14:01:17,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 02:01:16" (1/3) ... [2021-12-15 14:01:17,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d1bcbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 02:01:17, skipping insertion in model container [2021-12-15 14:01:17,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:01:16" (2/3) ... [2021-12-15 14:01:17,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d1bcbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 02:01:17, skipping insertion in model container [2021-12-15 14:01:17,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 02:01:17" (3/3) ... [2021-12-15 14:01:17,778 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_of_cslls.i [2021-12-15 14:01:17,782 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 14:01:17,782 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 104 error locations. [2021-12-15 14:01:17,821 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 14:01:17,827 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-15 14:01:17,827 INFO L340 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2021-12-15 14:01:17,843 INFO L276 IsEmpty]: Start isEmpty. Operand has 203 states, 98 states have (on average 2.2857142857142856) internal successors, (224), 202 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:17,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-15 14:01:17,847 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:17,847 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-15 14:01:17,847 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-15 14:01:17,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:17,851 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-15 14:01:17,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:01:17,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1333566003] [2021-12-15 14:01:17,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:17,860 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:01:17,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:01:17,861 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 14:01:17,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-15 14:01:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:17,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 14:01:17,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:01:18,033 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-15 14:01:18,043 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-15 14:01:18,043 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:01:18,044 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:01:18,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1333566003] [2021-12-15 14:01:18,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1333566003] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:01:18,044 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:01:18,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:01:18,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146499222] [2021-12-15 14:01:18,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:01:18,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:01:18,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:01:18,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:01:18,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:01:18,067 INFO L87 Difference]: Start difference. First operand has 203 states, 98 states have (on average 2.2857142857142856) internal successors, (224), 202 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-15 14:01:18,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:18,436 INFO L93 Difference]: Finished difference Result 275 states and 295 transitions. [2021-12-15 14:01:18,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:01:18,441 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-15 14:01:18,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:18,448 INFO L225 Difference]: With dead ends: 275 [2021-12-15 14:01:18,449 INFO L226 Difference]: Without dead ends: 271 [2021-12-15 14:01:18,450 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-15 14:01:18,452 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 191 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:18,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 190 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-15 14:01:18,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-12-15 14:01:18,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 192. [2021-12-15 14:01:18,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 97 states have (on average 2.1237113402061856) internal successors, (206), 191 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-15 14:01:18,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 206 transitions. [2021-12-15 14:01:18,482 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 206 transitions. Word has length 3 [2021-12-15 14:01:18,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:18,483 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 206 transitions. [2021-12-15 14:01:18,483 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-15 14:01:18,483 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 206 transitions. [2021-12-15 14:01:18,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-15 14:01:18,484 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:18,484 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-15 14:01:18,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-15 14:01:18,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 14:01:18,691 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-15 14:01:18,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:18,691 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-15 14:01:18,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:01:18,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1246171291] [2021-12-15 14:01:18,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:18,692 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:01:18,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:01:18,693 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 14:01:18,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-15 14:01:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:18,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 14:01:18,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:01:18,764 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-15 14:01:18,775 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-15 14:01:18,775 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:01:18,775 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:01:18,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1246171291] [2021-12-15 14:01:18,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1246171291] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:01:18,776 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:01:18,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:01:18,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917518996] [2021-12-15 14:01:18,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:01:18,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:01:18,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:01:18,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:01:18,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:01:18,778 INFO L87 Difference]: Start difference. First operand 192 states and 206 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-15 14:01:19,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:19,083 INFO L93 Difference]: Finished difference Result 190 states and 204 transitions. [2021-12-15 14:01:19,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:01:19,083 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-15 14:01:19,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:19,084 INFO L225 Difference]: With dead ends: 190 [2021-12-15 14:01:19,084 INFO L226 Difference]: Without dead ends: 190 [2021-12-15 14:01:19,085 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-15 14:01:19,085 INFO L933 BasicCegarLoop]: 201 mSDtfsCounter, 2 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:19,086 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 301 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-15 14:01:19,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-12-15 14:01:19,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2021-12-15 14:01:19,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 97 states have (on average 2.1030927835051547) internal successors, (204), 189 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:19,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 204 transitions. [2021-12-15 14:01:19,093 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 204 transitions. Word has length 3 [2021-12-15 14:01:19,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:19,093 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 204 transitions. [2021-12-15 14:01:19,093 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-15 14:01:19,093 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 204 transitions. [2021-12-15 14:01:19,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-15 14:01:19,094 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:19,094 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-15 14:01:19,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-15 14:01:19,294 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 14:01:19,295 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-15 14:01:19,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:19,295 INFO L85 PathProgramCache]: Analyzing trace with hash 889446153, now seen corresponding path program 1 times [2021-12-15 14:01:19,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:01:19,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1320331087] [2021-12-15 14:01:19,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:19,299 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:01:19,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:01:19,300 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 14:01:19,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-15 14:01:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:19,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 14:01:19,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:01:19,373 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-15 14:01:19,377 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-15 14:01:19,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:19,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-15 14:01:19,430 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:01:19,430 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 14 treesize of output 14 [2021-12-15 14:01:19,446 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-15 14:01:19,447 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:01:19,447 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:01:19,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1320331087] [2021-12-15 14:01:19,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1320331087] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:01:19,447 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:01:19,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:01:19,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964128234] [2021-12-15 14:01:19,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:01:19,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 14:01:19,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:01:19,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 14:01:19,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:01:19,449 INFO L87 Difference]: Start difference. First operand 190 states and 204 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:19,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:19,997 INFO L93 Difference]: Finished difference Result 347 states and 373 transitions. [2021-12-15 14:01:19,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 14:01:19,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-15 14:01:19,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:19,999 INFO L225 Difference]: With dead ends: 347 [2021-12-15 14:01:19,999 INFO L226 Difference]: Without dead ends: 347 [2021-12-15 14:01:19,999 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:01:20,000 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 270 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:20,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [270 Valid, 223 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-15 14:01:20,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2021-12-15 14:01:20,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 183. [2021-12-15 14:01:20,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 97 states have (on average 2.0309278350515463) internal successors, (197), 182 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:20,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 197 transitions. [2021-12-15 14:01:20,006 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 197 transitions. Word has length 6 [2021-12-15 14:01:20,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:20,007 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 197 transitions. [2021-12-15 14:01:20,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:20,007 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 197 transitions. [2021-12-15 14:01:20,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-15 14:01:20,007 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:20,007 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:01:20,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-15 14:01:20,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 14:01:20,214 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-15 14:01:20,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:20,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924364, now seen corresponding path program 1 times [2021-12-15 14:01:20,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:01:20,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [170971456] [2021-12-15 14:01:20,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:20,215 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:01:20,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:01:20,216 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 14:01:20,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-15 14:01:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:20,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-15 14:01:20,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:01:20,285 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-15 14:01:20,301 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-15 14:01:20,332 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 24 treesize of output 12 [2021-12-15 14:01:20,343 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-15 14:01:20,343 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:01:20,343 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:01:20,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [170971456] [2021-12-15 14:01:20,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [170971456] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:01:20,344 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:01:20,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:01:20,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21148904] [2021-12-15 14:01:20,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:01:20,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:01:20,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:01:20,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:01:20,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:01:20,346 INFO L87 Difference]: Start difference. First operand 183 states and 197 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:20,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:20,740 INFO L93 Difference]: Finished difference Result 182 states and 196 transitions. [2021-12-15 14:01:20,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 14:01:20,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-15 14:01:20,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:20,741 INFO L225 Difference]: With dead ends: 182 [2021-12-15 14:01:20,741 INFO L226 Difference]: Without dead ends: 182 [2021-12-15 14:01:20,741 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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-15 14:01:20,742 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 5 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:20,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 472 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-15 14:01:20,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-12-15 14:01:20,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2021-12-15 14:01:20,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 97 states have (on average 2.020618556701031) internal successors, (196), 181 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:20,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 196 transitions. [2021-12-15 14:01:20,746 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 196 transitions. Word has length 10 [2021-12-15 14:01:20,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:20,747 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 196 transitions. [2021-12-15 14:01:20,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:20,747 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 196 transitions. [2021-12-15 14:01:20,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-15 14:01:20,747 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:20,747 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:01:20,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-15 14:01:20,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 14:01:20,953 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-15 14:01:20,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:20,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924365, now seen corresponding path program 1 times [2021-12-15 14:01:20,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:01:20,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [256798179] [2021-12-15 14:01:20,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:20,954 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:01:20,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:01:20,955 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 14:01:20,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-15 14:01:21,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:21,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-15 14:01:21,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:01:21,022 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-15 14:01:21,042 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-15 14:01:21,048 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-15 14:01:21,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-15 14:01:21,082 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 21 treesize of output 9 [2021-12-15 14:01:21,099 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-15 14:01:21,100 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:01:21,100 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:01:21,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [256798179] [2021-12-15 14:01:21,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [256798179] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:01:21,100 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:01:21,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:01:21,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70157506] [2021-12-15 14:01:21,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:01:21,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:01:21,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:01:21,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:01:21,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:01:21,102 INFO L87 Difference]: Start difference. First operand 182 states and 196 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:21,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:21,587 INFO L93 Difference]: Finished difference Result 181 states and 195 transitions. [2021-12-15 14:01:21,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 14:01:21,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-15 14:01:21,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:21,595 INFO L225 Difference]: With dead ends: 181 [2021-12-15 14:01:21,596 INFO L226 Difference]: Without dead ends: 181 [2021-12-15 14:01:21,596 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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-15 14:01:21,598 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 3 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:21,599 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 493 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-15 14:01:21,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-12-15 14:01:21,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2021-12-15 14:01:21,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 180 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:21,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 195 transitions. [2021-12-15 14:01:21,602 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 195 transitions. Word has length 10 [2021-12-15 14:01:21,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:21,603 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 195 transitions. [2021-12-15 14:01:21,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:21,603 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 195 transitions. [2021-12-15 14:01:21,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-15 14:01:21,603 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:21,603 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:01:21,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-15 14:01:21,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 14:01:21,810 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-15 14:01:21,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:21,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1975621208, now seen corresponding path program 1 times [2021-12-15 14:01:21,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:01:21,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1185101655] [2021-12-15 14:01:21,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:21,812 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:01:21,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:01:21,812 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 14:01:21,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-15 14:01:21,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:21,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-15 14:01:21,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:01:21,913 INFO L354 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-15 14:01:21,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 21 [2021-12-15 14:01:21,980 INFO L354 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2021-12-15 14:01:21,981 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 47 [2021-12-15 14:01:22,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-15 14:01:22,181 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:01:22,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2021-12-15 14:01:22,264 INFO L354 Elim1Store]: treesize reduction 41, result has 60.6 percent of original size [2021-12-15 14:01:22,264 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 99 [2021-12-15 14:01:22,412 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 35 treesize of output 17 [2021-12-15 14:01:22,434 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-15 14:01:22,434 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:01:22,434 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:01:22,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1185101655] [2021-12-15 14:01:22,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1185101655] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:01:22,434 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:01:22,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 14:01:22,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006539821] [2021-12-15 14:01:22,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:01:22,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-15 14:01:22,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:01:22,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 14:01:22,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-15 14:01:22,435 INFO L87 Difference]: Start difference. First operand 181 states and 195 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:23,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:23,278 INFO L93 Difference]: Finished difference Result 334 states and 366 transitions. [2021-12-15 14:01:23,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 14:01:23,279 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-15 14:01:23,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:23,280 INFO L225 Difference]: With dead ends: 334 [2021-12-15 14:01:23,280 INFO L226 Difference]: Without dead ends: 334 [2021-12-15 14:01:23,280 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-12-15 14:01:23,281 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 726 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:23,281 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [726 Valid, 545 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 455 Invalid, 0 Unknown, 156 Unchecked, 0.7s Time] [2021-12-15 14:01:23,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-12-15 14:01:23,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 185. [2021-12-15 14:01:23,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 101 states have (on average 1.99009900990099) internal successors, (201), 184 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:23,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 201 transitions. [2021-12-15 14:01:23,285 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 201 transitions. Word has length 14 [2021-12-15 14:01:23,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:23,285 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 201 transitions. [2021-12-15 14:01:23,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:23,285 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 201 transitions. [2021-12-15 14:01:23,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-15 14:01:23,285 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:23,285 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:01:23,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-15 14:01:23,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 14:01:23,492 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-15 14:01:23,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:23,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1975621209, now seen corresponding path program 1 times [2021-12-15 14:01:23,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:01:23,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [240181273] [2021-12-15 14:01:23,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:23,493 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:01:23,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:01:23,494 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 14:01:23,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-15 14:01:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:23,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-15 14:01:23,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:01:23,581 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-15 14:01:23,602 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:01:23,602 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 14 treesize of output 14 [2021-12-15 14:01:23,606 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 14:01:23,623 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-15 14:01:23,631 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-15 14:01:23,710 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:01:23,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-15 14:01:23,717 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-15 14:01:23,769 INFO L354 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2021-12-15 14:01:23,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 20 [2021-12-15 14:01:23,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-15 14:01:23,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-12-15 14:01:23,809 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-15 14:01:23,810 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:01:23,810 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:01:23,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [240181273] [2021-12-15 14:01:23,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [240181273] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:01:23,810 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:01:23,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-15 14:01:23,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349286679] [2021-12-15 14:01:23,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:01:23,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 14:01:23,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:01:23,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 14:01:23,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:01:23,811 INFO L87 Difference]: Start difference. First operand 185 states and 201 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:25,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:25,082 INFO L93 Difference]: Finished difference Result 328 states and 360 transitions. [2021-12-15 14:01:25,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 14:01:25,082 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-15 14:01:25,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:25,084 INFO L225 Difference]: With dead ends: 328 [2021-12-15 14:01:25,084 INFO L226 Difference]: Without dead ends: 328 [2021-12-15 14:01:25,084 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-12-15 14:01:25,084 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 329 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:25,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [329 Valid, 503 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-15 14:01:25,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2021-12-15 14:01:25,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 185. [2021-12-15 14:01:25,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 101 states have (on average 1.9801980198019802) internal successors, (200), 184 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:25,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 200 transitions. [2021-12-15 14:01:25,088 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 200 transitions. Word has length 14 [2021-12-15 14:01:25,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:25,088 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 200 transitions. [2021-12-15 14:01:25,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:25,088 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 200 transitions. [2021-12-15 14:01:25,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-15 14:01:25,088 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:25,088 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:01:25,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-15 14:01:25,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 14:01:25,289 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-15 14:01:25,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:25,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1114715313, now seen corresponding path program 1 times [2021-12-15 14:01:25,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:01:25,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780596915] [2021-12-15 14:01:25,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:25,290 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:01:25,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:01:25,290 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 14:01:25,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-15 14:01:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:25,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 14:01:25,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:01:25,373 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-15 14:01:25,380 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-15 14:01:25,380 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:01:25,380 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:01:25,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780596915] [2021-12-15 14:01:25,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1780596915] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:01:25,380 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:01:25,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:01:25,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649220634] [2021-12-15 14:01:25,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:01:25,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:01:25,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:01:25,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:01:25,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:01:25,381 INFO L87 Difference]: Start difference. First operand 185 states and 200 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:25,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:25,710 INFO L93 Difference]: Finished difference Result 300 states and 328 transitions. [2021-12-15 14:01:25,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:01:25,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-15 14:01:25,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:25,711 INFO L225 Difference]: With dead ends: 300 [2021-12-15 14:01:25,711 INFO L226 Difference]: Without dead ends: 300 [2021-12-15 14:01:25,711 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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-15 14:01:25,712 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 156 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:25,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 319 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-15 14:01:25,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-12-15 14:01:25,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 182. [2021-12-15 14:01:25,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 101 states have (on average 1.9504950495049505) internal successors, (197), 181 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:25,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 197 transitions. [2021-12-15 14:01:25,715 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 197 transitions. Word has length 15 [2021-12-15 14:01:25,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:25,715 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 197 transitions. [2021-12-15 14:01:25,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:25,715 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 197 transitions. [2021-12-15 14:01:25,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-15 14:01:25,715 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:25,715 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:01:25,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-12-15 14:01:25,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 14:01:25,916 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-15 14:01:25,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:25,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1114715314, now seen corresponding path program 1 times [2021-12-15 14:01:25,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:01:25,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1867726497] [2021-12-15 14:01:25,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:25,918 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:01:25,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:01:25,919 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 14:01:25,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-15 14:01:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:25,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 14:01:25,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:01:26,001 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-15 14:01:26,016 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-15 14:01:26,017 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:01:26,017 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:01:26,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1867726497] [2021-12-15 14:01:26,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1867726497] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:01:26,017 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:01:26,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:01:26,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124632081] [2021-12-15 14:01:26,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:01:26,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:01:26,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:01:26,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:01:26,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:01:26,018 INFO L87 Difference]: Start difference. First operand 182 states and 197 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:26,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:26,330 INFO L93 Difference]: Finished difference Result 281 states and 309 transitions. [2021-12-15 14:01:26,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:01:26,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-15 14:01:26,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:26,334 INFO L225 Difference]: With dead ends: 281 [2021-12-15 14:01:26,334 INFO L226 Difference]: Without dead ends: 281 [2021-12-15 14:01:26,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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-15 14:01:26,335 INFO L933 BasicCegarLoop]: 247 mSDtfsCounter, 130 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:26,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 332 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-15 14:01:26,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-12-15 14:01:26,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 180. [2021-12-15 14:01:26,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 101 states have (on average 1.9306930693069306) internal successors, (195), 179 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:26,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 195 transitions. [2021-12-15 14:01:26,339 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 195 transitions. Word has length 15 [2021-12-15 14:01:26,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:26,339 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 195 transitions. [2021-12-15 14:01:26,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:26,339 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 195 transitions. [2021-12-15 14:01:26,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-15 14:01:26,339 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:26,340 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:01:26,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-15 14:01:26,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 14:01:26,548 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-15 14:01:26,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:26,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1114677643, now seen corresponding path program 1 times [2021-12-15 14:01:26,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:01:26,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1134296940] [2021-12-15 14:01:26,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:26,549 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:01:26,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:01:26,550 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 14:01:26,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-15 14:01:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:26,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 14:01:26,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:01:26,642 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-15 14:01:26,642 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:01:26,642 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:01:26,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1134296940] [2021-12-15 14:01:26,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1134296940] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:01:26,642 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:01:26,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:01:26,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763717606] [2021-12-15 14:01:26,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:01:26,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 14:01:26,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:01:26,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 14:01:26,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:01:26,644 INFO L87 Difference]: Start difference. First operand 180 states and 195 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:26,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:26,999 INFO L93 Difference]: Finished difference Result 239 states and 261 transitions. [2021-12-15 14:01:26,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 14:01:26,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-15 14:01:26,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:27,000 INFO L225 Difference]: With dead ends: 239 [2021-12-15 14:01:27,000 INFO L226 Difference]: Without dead ends: 239 [2021-12-15 14:01:27,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-15 14:01:27,001 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 306 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:27,001 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [306 Valid, 143 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-15 14:01:27,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-12-15 14:01:27,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 168. [2021-12-15 14:01:27,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 104 states have (on average 1.7884615384615385) internal successors, (186), 167 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:27,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 186 transitions. [2021-12-15 14:01:27,004 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 186 transitions. Word has length 15 [2021-12-15 14:01:27,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:27,004 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 186 transitions. [2021-12-15 14:01:27,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:27,004 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 186 transitions. [2021-12-15 14:01:27,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-15 14:01:27,005 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:27,005 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:01:27,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-15 14:01:27,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 14:01:27,211 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-15 14:01:27,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:27,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1114677644, now seen corresponding path program 1 times [2021-12-15 14:01:27,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:01:27,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [638223238] [2021-12-15 14:01:27,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:27,212 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:01:27,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:01:27,213 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 14:01:27,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-15 14:01:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:27,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 14:01:27,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:01:27,372 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-15 14:01:27,373 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:01:27,373 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:01:27,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [638223238] [2021-12-15 14:01:27,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [638223238] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:01:27,373 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:01:27,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:01:27,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128102860] [2021-12-15 14:01:27,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:01:27,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:01:27,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:01:27,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:01:27,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:01:27,375 INFO L87 Difference]: Start difference. First operand 168 states and 186 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:28,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:28,157 INFO L93 Difference]: Finished difference Result 419 states and 464 transitions. [2021-12-15 14:01:28,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 14:01:28,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-15 14:01:28,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:28,168 INFO L225 Difference]: With dead ends: 419 [2021-12-15 14:01:28,168 INFO L226 Difference]: Without dead ends: 419 [2021-12-15 14:01:28,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:01:28,169 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 667 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:28,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [667 Valid, 266 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-15 14:01:28,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2021-12-15 14:01:28,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 300. [2021-12-15 14:01:28,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 236 states have (on average 1.7838983050847457) internal successors, (421), 299 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:28,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 421 transitions. [2021-12-15 14:01:28,174 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 421 transitions. Word has length 15 [2021-12-15 14:01:28,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:28,174 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 421 transitions. [2021-12-15 14:01:28,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:28,175 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 421 transitions. [2021-12-15 14:01:28,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-15 14:01:28,175 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:28,175 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:01:28,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-15 14:01:28,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 14:01:28,379 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-15 14:01:28,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:28,379 INFO L85 PathProgramCache]: Analyzing trace with hash -203231137, now seen corresponding path program 1 times [2021-12-15 14:01:28,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:01:28,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1783376394] [2021-12-15 14:01:28,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:28,380 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:01:28,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:01:28,381 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 14:01:28,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-15 14:01:28,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:28,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-15 14:01:28,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:01:28,490 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-15 14:01:28,506 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:01:28,507 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 14 treesize of output 14 [2021-12-15 14:01:28,526 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-15 14:01:28,532 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-15 14:01:28,623 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:01:28,624 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2021-12-15 14:01:28,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-15 14:01:28,666 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:01:28,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2021-12-15 14:01:28,789 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 36 treesize of output 36 [2021-12-15 14:01:28,795 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2021-12-15 14:01:28,846 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 39 treesize of output 21 [2021-12-15 14:01:28,849 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 32 treesize of output 14 [2021-12-15 14:01:28,864 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-15 14:01:28,864 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:01:28,864 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:01:28,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1783376394] [2021-12-15 14:01:28,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1783376394] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:01:28,865 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:01:28,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-15 14:01:28,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234381037] [2021-12-15 14:01:28,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:01:28,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-15 14:01:28,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:01:28,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-15 14:01:28,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-12-15 14:01:28,865 INFO L87 Difference]: Start difference. First operand 300 states and 421 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:30,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:30,017 INFO L93 Difference]: Finished difference Result 528 states and 743 transitions. [2021-12-15 14:01:30,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-15 14:01:30,017 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-15 14:01:30,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:30,019 INFO L225 Difference]: With dead ends: 528 [2021-12-15 14:01:30,019 INFO L226 Difference]: Without dead ends: 528 [2021-12-15 14:01:30,019 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2021-12-15 14:01:30,020 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 365 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:30,020 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [365 Valid, 673 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-15 14:01:30,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2021-12-15 14:01:30,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 304. [2021-12-15 14:01:30,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 240 states have (on average 1.775) internal successors, (426), 303 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:30,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 426 transitions. [2021-12-15 14:01:30,026 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 426 transitions. Word has length 18 [2021-12-15 14:01:30,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:30,026 INFO L470 AbstractCegarLoop]: Abstraction has 304 states and 426 transitions. [2021-12-15 14:01:30,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:30,026 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 426 transitions. [2021-12-15 14:01:30,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-15 14:01:30,026 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:30,027 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:01:30,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-15 14:01:30,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 14:01:30,233 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-15 14:01:30,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:30,234 INFO L85 PathProgramCache]: Analyzing trace with hash -203231138, now seen corresponding path program 1 times [2021-12-15 14:01:30,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:01:30,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [456428713] [2021-12-15 14:01:30,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:30,234 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:01:30,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:01:30,235 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 14:01:30,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-15 14:01:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:30,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-15 14:01:30,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:01:30,354 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-15 14:01:30,372 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:01:30,373 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 14 treesize of output 14 [2021-12-15 14:01:30,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-15 14:01:30,440 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:01:30,441 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2021-12-15 14:01:30,469 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:01:30,469 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2021-12-15 14:01:30,543 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 30 treesize of output 30 [2021-12-15 14:01:30,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2021-12-15 14:01:30,588 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-15 14:01:30,588 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:01:30,588 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:01:30,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [456428713] [2021-12-15 14:01:30,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [456428713] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:01:30,588 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:01:30,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-15 14:01:30,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247306146] [2021-12-15 14:01:30,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:01:30,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-15 14:01:30,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:01:30,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-15 14:01:30,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-12-15 14:01:30,589 INFO L87 Difference]: Start difference. First operand 304 states and 426 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:31,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:31,784 INFO L93 Difference]: Finished difference Result 615 states and 857 transitions. [2021-12-15 14:01:31,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-15 14:01:31,784 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-15 14:01:31,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:31,786 INFO L225 Difference]: With dead ends: 615 [2021-12-15 14:01:31,786 INFO L226 Difference]: Without dead ends: 615 [2021-12-15 14:01:31,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2021-12-15 14:01:31,787 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 637 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:31,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [637 Valid, 1096 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-15 14:01:31,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2021-12-15 14:01:31,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 303. [2021-12-15 14:01:31,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 240 states have (on average 1.7666666666666666) internal successors, (424), 302 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:31,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 424 transitions. [2021-12-15 14:01:31,793 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 424 transitions. Word has length 18 [2021-12-15 14:01:31,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:31,793 INFO L470 AbstractCegarLoop]: Abstraction has 303 states and 424 transitions. [2021-12-15 14:01:31,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:31,794 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 424 transitions. [2021-12-15 14:01:31,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-15 14:01:31,794 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:31,794 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-15 14:01:31,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-15 14:01:32,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 14:01:32,002 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-15 14:01:32,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:32,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1227749363, now seen corresponding path program 1 times [2021-12-15 14:01:32,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:01:32,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [688272502] [2021-12-15 14:01:32,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:32,003 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:01:32,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:01:32,004 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 14:01:32,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-15 14:01:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:32,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 14:01:32,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:01:32,102 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-15 14:01:32,102 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:01:32,102 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:01:32,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [688272502] [2021-12-15 14:01:32,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [688272502] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:01:32,103 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:01:32,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:01:32,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20405103] [2021-12-15 14:01:32,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:01:32,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:01:32,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:01:32,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:01:32,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:01:32,103 INFO L87 Difference]: Start difference. First operand 303 states and 424 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-15 14:01:32,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:32,110 INFO L93 Difference]: Finished difference Result 306 states and 427 transitions. [2021-12-15 14:01:32,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:01:32,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-15 14:01:32,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:32,111 INFO L225 Difference]: With dead ends: 306 [2021-12-15 14:01:32,111 INFO L226 Difference]: Without dead ends: 306 [2021-12-15 14:01:32,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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-15 14:01:32,112 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 0 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:32,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 340 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:01:32,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-12-15 14:01:32,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2021-12-15 14:01:32,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 243 states have (on average 1.757201646090535) internal successors, (427), 305 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:32,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 427 transitions. [2021-12-15 14:01:32,117 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 427 transitions. Word has length 21 [2021-12-15 14:01:32,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:32,117 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 427 transitions. [2021-12-15 14:01:32,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-15 14:01:32,117 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 427 transitions. [2021-12-15 14:01:32,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-15 14:01:32,118 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:32,118 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:01:32,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-15 14:01:32,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 14:01:32,325 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-15 14:01:32,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:32,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1847606352, now seen corresponding path program 1 times [2021-12-15 14:01:32,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:01:32,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1243024621] [2021-12-15 14:01:32,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:32,329 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:01:32,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:01:32,330 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 14:01:32,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-15 14:01:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:32,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-15 14:01:32,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:01:32,495 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-15 14:01:32,509 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:01:32,509 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 14 treesize of output 14 [2021-12-15 14:01:32,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-15 14:01:32,574 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:01:32,575 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2021-12-15 14:01:32,611 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-15 14:01:32,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 26 [2021-12-15 14:01:32,707 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 30 treesize of output 30 [2021-12-15 14:01:32,778 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:01:32,779 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2021-12-15 14:01:32,830 INFO L354 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2021-12-15 14:01:32,830 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 39 [2021-12-15 14:01:32,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2021-12-15 14:01:32,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:01:32,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:01:32,965 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_435) |c_ULTIMATE.start_main_~tree~0#1.base|) (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (_ bv1 1)))) is different from false [2021-12-15 14:01:32,974 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_435) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2021-12-15 14:01:32,987 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_435 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_434))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_435)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-15 14:01:33,088 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_433 (_ BitVec 1)) (v_ArrVal_435 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~tmpList~0#1.base_22| (_ BitVec 32))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_433)) (.cse1 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (or (not (= (_ bv0 1) (bvadd (select .cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)) (_ bv1 1)))) (= (_ bv0 1) (bvadd (select .cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_434))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_435)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)) (_ bv1 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22|)))))) is different from false [2021-12-15 14:01:33,162 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_432 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_433 (_ BitVec 1)) (v_ArrVal_435 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~tmpList~0#1.base_22| (_ BitVec 32))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_433)) (.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_432)) (.cse2 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (or (not (= (_ bv0 1) (bvadd (select .cse0 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2)) (_ bv1 1)))) (= (_ bv0 1) (bvadd (select .cse0 (select (select (let ((.cse3 (store .cse1 |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_434))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_ArrVal_435)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2)) (_ bv1 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22|)))))) is different from false [2021-12-15 14:01:33,243 INFO L354 Elim1Store]: treesize reduction 143, result has 32.2 percent of original size [2021-12-15 14:01:33,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 222 treesize of output 227 [2021-12-15 14:01:33,312 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_432 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_435 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~tmpList~0#1.base_22| (_ BitVec 32))) (or (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_432))) (= (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) (select (select (let ((.cse2 (store .cse0 |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_434))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_435)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))) (= |v_ULTIMATE.start_main_~tmpList~0#1.base_22| |c_ULTIMATE.start_main_~tree~0#1.base|))) is different from false [2021-12-15 14:01:33,373 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:01:33,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 50 [2021-12-15 14:01:33,376 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:01:33,378 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 442 treesize of output 352 [2021-12-15 14:01:33,391 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 153 treesize of output 121 [2021-12-15 14:01:33,393 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 121 treesize of output 97 [2021-12-15 14:01:33,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-15 14:01:33,417 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 14:01:33,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1243024621] [2021-12-15 14:01:33,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1243024621] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:01:33,417 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 14:01:33,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2021-12-15 14:01:33,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807466053] [2021-12-15 14:01:33,417 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 14:01:33,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-15 14:01:33,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 14:01:33,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-15 14:01:33,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=210, Unknown=6, NotChecked=210, Total=506 [2021-12-15 14:01:33,419 INFO L87 Difference]: Start difference. First operand 306 states and 427 transitions. Second operand has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:33,505 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32))) |c_ULTIMATE.start_main_~tree~0#1.base|)) (not (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|)) (= (_ bv0 1) (bvadd (select |c_#valid| |c_ULTIMATE.start_main_~tree~0#1.base|) (_ bv1 1))) (forall ((v_ArrVal_432 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_435 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~tmpList~0#1.base_22| (_ BitVec 32))) (or (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_432))) (= (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) (select (select (let ((.cse2 (store .cse0 |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_434))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_435)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))) (= |v_ULTIMATE.start_main_~tmpList~0#1.base_22| |c_ULTIMATE.start_main_~tree~0#1.base|)))) is different from false [2021-12-15 14:01:33,509 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32))) |c_ULTIMATE.start_main_~tree~0#1.base|)) (forall ((v_ArrVal_432 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_435 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~tmpList~0#1.base_22| (_ BitVec 32))) (or (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~tree~0#1.offset| (_ bv8 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_432))) (= (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) (select (select (let ((.cse2 (store .cse0 |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_434))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_435)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))) (= |v_ULTIMATE.start_main_~tmpList~0#1.base_22| |c_ULTIMATE.start_main_~tree~0#1.base|)))) is different from false [2021-12-15 14:01:34,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:34,760 INFO L93 Difference]: Finished difference Result 624 states and 866 transitions. [2021-12-15 14:01:34,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-15 14:01:34,761 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-15 14:01:34,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:34,763 INFO L225 Difference]: With dead ends: 624 [2021-12-15 14:01:34,763 INFO L226 Difference]: Without dead ends: 624 [2021-12-15 14:01:34,763 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 11 SemanticMatches, 26 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=290, Unknown=12, NotChecked=344, Total=756 [2021-12-15 14:01:34,763 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 563 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1490 SdHoareTripleChecker+Invalid, 2817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1917 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:34,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [563 Valid, 1490 Invalid, 2817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 868 Invalid, 0 Unknown, 1917 Unchecked, 1.1s Time] [2021-12-15 14:01:34,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2021-12-15 14:01:34,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 305. [2021-12-15 14:01:34,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 243 states have (on average 1.7530864197530864) internal successors, (426), 304 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:34,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 426 transitions. [2021-12-15 14:01:34,770 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 426 transitions. Word has length 22 [2021-12-15 14:01:34,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:34,771 INFO L470 AbstractCegarLoop]: Abstraction has 305 states and 426 transitions. [2021-12-15 14:01:34,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:34,771 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 426 transitions. [2021-12-15 14:01:34,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-15 14:01:34,772 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:34,772 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:01:34,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-15 14:01:34,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 14:01:34,973 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-15 14:01:34,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:34,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1847606353, now seen corresponding path program 1 times [2021-12-15 14:01:34,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 14:01:34,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [956767790] [2021-12-15 14:01:34,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:34,974 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 14:01:34,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 14:01:34,975 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 14:01:34,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-15 14:01:35,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:35,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-15 14:01:35,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:01:35,141 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-15 14:01:35,157 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:01:35,157 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 14 treesize of output 14 [2021-12-15 14:01:35,174 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-15 14:01:35,179 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-15 14:01:35,254 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:01:35,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2021-12-15 14:01:35,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-15 14:01:35,297 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-15 14:01:35,306 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:01:35,306 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2021-12-15 14:01:35,403 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 49 treesize of output 47 [2021-12-15 14:01:35,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2021-12-15 14:01:35,524 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:01:35,525 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 67 treesize of output 64 [2021-12-15 14:01:35,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2021-12-15 14:01:35,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:35,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-12-15 14:01:35,599 INFO L354 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2021-12-15 14:01:35,599 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2021-12-15 14:01:35,635 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 39 treesize of output 21 [2021-12-15 14:01:35,638 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 32 treesize of output 14 [2021-12-15 14:01:35,659 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-15 14:01:35,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:01:37,080 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-15 14:01:37,081 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 14 [2021-12-15 14:01:37,667 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:01:37,668 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 386 treesize of output 390