./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0504.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/test-0504.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 cddde357ab55a506b6049f3b60959cd723bf2cbfd36f7774fe3606d53024bbf3 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 14:00:47,746 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 14:00:47,748 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 14:00:47,796 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 14:00:47,797 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 14:00:47,807 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 14:00:47,808 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 14:00:47,810 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 14:00:47,811 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 14:00:47,815 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 14:00:47,815 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 14:00:47,816 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 14:00:47,816 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 14:00:47,818 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 14:00:47,820 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 14:00:47,824 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 14:00:47,825 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 14:00:47,826 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 14:00:47,827 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 14:00:47,831 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 14:00:47,832 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 14:00:47,833 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 14:00:47,834 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 14:00:47,835 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 14:00:47,839 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 14:00:47,840 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 14:00:47,840 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 14:00:47,841 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 14:00:47,841 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 14:00:47,842 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 14:00:47,842 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 14:00:47,843 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 14:00:47,844 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 14:00:47,845 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 14:00:47,845 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 14:00:47,846 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 14:00:47,846 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 14:00:47,846 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 14:00:47,846 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 14:00:47,847 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 14:00:47,848 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 14:00:47,849 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:47,872 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 14:00:47,873 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 14:00:47,873 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 14:00:47,873 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 14:00:47,874 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 14:00:47,874 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 14:00:47,874 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 14:00:47,874 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 14:00:47,875 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 14:00:47,875 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 14:00:47,875 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 14:00:47,876 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 14:00:47,876 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 14:00:47,876 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 14:00:47,876 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 14:00:47,876 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-15 14:00:47,876 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-15 14:00:47,876 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-15 14:00:47,877 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 14:00:47,877 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-15 14:00:47,877 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 14:00:47,877 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 14:00:47,877 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 14:00:47,877 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 14:00:47,878 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 14:00:47,878 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 14:00:47,878 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 14:00:47,878 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 14:00:47,878 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 14:00:47,878 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 14:00:47,879 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 14:00:47,879 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 -> cddde357ab55a506b6049f3b60959cd723bf2cbfd36f7774fe3606d53024bbf3 [2021-12-15 14:00:48,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 14:00:48,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 14:00:48,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 14:00:48,120 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 14:00:48,121 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 14:00:48,122 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0504.i [2021-12-15 14:00:48,172 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fa301e9c/f605199d7fea4412829651b81a7a1aee/FLAGdc3902018 [2021-12-15 14:00:48,561 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 14:00:48,562 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0504.i [2021-12-15 14:00:48,572 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fa301e9c/f605199d7fea4412829651b81a7a1aee/FLAGdc3902018 [2021-12-15 14:00:48,583 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fa301e9c/f605199d7fea4412829651b81a7a1aee [2021-12-15 14:00:48,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 14:00:48,586 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 14:00:48,589 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 14:00:48,589 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 14:00:48,591 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 14:00:48,591 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 02:00:48" (1/1) ... [2021-12-15 14:00:48,592 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@348028b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:00:48, skipping insertion in model container [2021-12-15 14:00:48,592 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 02:00:48" (1/1) ... [2021-12-15 14:00:48,596 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 14:00:48,625 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 14:00:48,873 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 14:00:48,880 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 14:00:48,915 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 14:00:48,934 INFO L208 MainTranslator]: Completed translation [2021-12-15 14:00:48,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:00:48 WrapperNode [2021-12-15 14:00:48,935 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 14:00:48,936 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 14:00:48,936 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 14:00:48,937 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 14:00:48,941 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:00:48" (1/1) ... [2021-12-15 14:00:48,963 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:00:48" (1/1) ... [2021-12-15 14:00:48,985 INFO L137 Inliner]: procedures = 123, calls = 27, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 86 [2021-12-15 14:00:48,985 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 14:00:48,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 14:00:48,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 14:00:48,987 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 14:00:48,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:00:48" (1/1) ... [2021-12-15 14:00:48,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:00:48" (1/1) ... [2021-12-15 14:00:48,999 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:00:48" (1/1) ... [2021-12-15 14:00:49,000 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:00:48" (1/1) ... [2021-12-15 14:00:49,016 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:00:48" (1/1) ... [2021-12-15 14:00:49,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:00:48" (1/1) ... [2021-12-15 14:00:49,025 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:00:48" (1/1) ... [2021-12-15 14:00:49,029 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 14:00:49,030 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 14:00:49,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 14:00:49,031 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 14:00:49,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:00:48" (1/1) ... [2021-12-15 14:00:49,049 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 14:00:49,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:00:49,067 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:00:49,086 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:00:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 14:00:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 14:00:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 14:00:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-15 14:00:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-15 14:00:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 14:00:49,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 14:00:49,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 14:00:49,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 14:00:49,214 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 14:00:49,215 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 14:00:49,411 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 14:00:49,415 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 14:00:49,416 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-15 14:00:49,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 02:00:49 BoogieIcfgContainer [2021-12-15 14:00:49,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 14:00:49,419 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 14:00:49,420 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 14:00:49,422 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 14:00:49,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 02:00:48" (1/3) ... [2021-12-15 14:00:49,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f67db1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 02:00:49, skipping insertion in model container [2021-12-15 14:00:49,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:00:48" (2/3) ... [2021-12-15 14:00:49,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f67db1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 02:00:49, skipping insertion in model container [2021-12-15 14:00:49,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 02:00:49" (3/3) ... [2021-12-15 14:00:49,425 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0504.i [2021-12-15 14:00:49,429 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 14:00:49,429 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2021-12-15 14:00:49,463 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 14:00:49,478 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:00:49,479 INFO L340 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2021-12-15 14:00:49,491 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 86 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:00:49,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-15 14:00:49,502 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:49,502 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-15 14:00:49,503 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:00:49,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:49,511 INFO L85 PathProgramCache]: Analyzing trace with hash 28780379, now seen corresponding path program 1 times [2021-12-15 14:00:49,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:49,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158525096] [2021-12-15 14:00:49,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:49,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:49,608 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:00:49,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:49,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158525096] [2021-12-15 14:00:49,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158525096] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:00:49,610 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:00:49,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:00:49,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548725139] [2021-12-15 14:00:49,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:00:49,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-15 14:00:49,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:49,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 14:00:49,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 14:00:49,638 INFO L87 Difference]: Start difference. First operand has 87 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 86 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:00:49,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:49,653 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2021-12-15 14:00:49,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 14:00:49,655 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-15 14:00:49,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:49,660 INFO L225 Difference]: With dead ends: 87 [2021-12-15 14:00:49,660 INFO L226 Difference]: Without dead ends: 85 [2021-12-15 14:00:49,663 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 14:00:49,665 INFO L933 BasicCegarLoop]: 91 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, 91 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:49,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:00:49,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-15 14:00:49,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2021-12-15 14:00:49,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 44 states have (on average 2.022727272727273) internal successors, (89), 84 states have internal predecessors, (89), 0 states have call successors, (0), 0 states 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:00:49,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2021-12-15 14:00:49,695 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 5 [2021-12-15 14:00:49,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:49,695 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2021-12-15 14:00:49,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:00:49,696 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2021-12-15 14:00:49,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-15 14:00:49,696 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:49,696 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-15 14:00:49,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 14:00:49,697 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:00:49,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:49,698 INFO L85 PathProgramCache]: Analyzing trace with hash 889572104, now seen corresponding path program 1 times [2021-12-15 14:00:49,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:49,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346619273] [2021-12-15 14:00:49,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:49,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:49,768 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:00:49,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:49,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346619273] [2021-12-15 14:00:49,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346619273] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:00:49,769 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:00:49,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:00:49,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525936376] [2021-12-15 14:00:49,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:00:49,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:00:49,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:49,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:00:49,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:00:49,771 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:00:49,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:49,803 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2021-12-15 14:00:49,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:00:49,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-15 14:00:49,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:49,805 INFO L225 Difference]: With dead ends: 133 [2021-12-15 14:00:49,806 INFO L226 Difference]: Without dead ends: 133 [2021-12-15 14:00:49,806 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:00:49,808 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 49 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:49,809 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 165 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:00:49,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-12-15 14:00:49,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 109. [2021-12-15 14:00:49,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 68 states have (on average 2.0441176470588234) internal successors, (139), 108 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:00:49,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 139 transitions. [2021-12-15 14:00:49,823 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 139 transitions. Word has length 6 [2021-12-15 14:00:49,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:49,824 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 139 transitions. [2021-12-15 14:00:49,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:00:49,824 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 139 transitions. [2021-12-15 14:00:49,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-15 14:00:49,825 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:49,826 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-15 14:00:49,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 14:00:49,827 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:00:49,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:49,828 INFO L85 PathProgramCache]: Analyzing trace with hash 889571339, now seen corresponding path program 1 times [2021-12-15 14:00:49,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:49,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557310759] [2021-12-15 14:00:49,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:49,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:49,870 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:00:49,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:49,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557310759] [2021-12-15 14:00:49,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557310759] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:00:49,872 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:00:49,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:00:49,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82049165] [2021-12-15 14:00:49,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:00:49,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:00:49,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:49,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:00:49,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:00:49,874 INFO L87 Difference]: Start difference. First operand 109 states and 139 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:00:49,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:49,969 INFO L93 Difference]: Finished difference Result 130 states and 154 transitions. [2021-12-15 14:00:49,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:00:49,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-15 14:00:49,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:49,972 INFO L225 Difference]: With dead ends: 130 [2021-12-15 14:00:49,972 INFO L226 Difference]: Without dead ends: 130 [2021-12-15 14:00:49,973 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:00:49,977 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 74 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:49,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 64 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:00:49,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-15 14:00:49,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 101. [2021-12-15 14:00:49,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 68 states have (on average 1.8235294117647058) internal successors, (124), 100 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:00:49,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 124 transitions. [2021-12-15 14:00:49,990 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 124 transitions. Word has length 6 [2021-12-15 14:00:49,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:49,990 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 124 transitions. [2021-12-15 14:00:49,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:00:49,991 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 124 transitions. [2021-12-15 14:00:49,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-15 14:00:49,991 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:49,991 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-15 14:00:49,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-15 14:00:49,992 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:00:49,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:49,992 INFO L85 PathProgramCache]: Analyzing trace with hash 889571340, now seen corresponding path program 1 times [2021-12-15 14:00:49,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:49,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918304223] [2021-12-15 14:00:49,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:49,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:50,034 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:00:50,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:50,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918304223] [2021-12-15 14:00:50,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918304223] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:00:50,034 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:00:50,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:00:50,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690597010] [2021-12-15 14:00:50,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:00:50,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:00:50,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:50,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:00:50,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:00:50,035 INFO L87 Difference]: Start difference. First operand 101 states and 124 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:00:50,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:50,117 INFO L93 Difference]: Finished difference Result 138 states and 161 transitions. [2021-12-15 14:00:50,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:00:50,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-15 14:00:50,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:50,118 INFO L225 Difference]: With dead ends: 138 [2021-12-15 14:00:50,118 INFO L226 Difference]: Without dead ends: 138 [2021-12-15 14:00:50,118 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:00:50,121 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 47 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:50,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 102 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:00:50,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-12-15 14:00:50,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 101. [2021-12-15 14:00:50,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 73 states have (on average 1.6849315068493151) internal successors, (123), 100 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:00:50,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2021-12-15 14:00:50,125 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 6 [2021-12-15 14:00:50,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:50,125 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2021-12-15 14:00:50,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:00:50,125 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2021-12-15 14:00:50,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-15 14:00:50,125 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:50,125 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:00:50,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-15 14:00:50,125 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:00:50,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:50,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1806930847, now seen corresponding path program 1 times [2021-12-15 14:00:50,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:50,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621751007] [2021-12-15 14:00:50,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:50,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:50,142 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:00:50,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:50,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621751007] [2021-12-15 14:00:50,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621751007] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:00:50,143 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:00:50,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:00:50,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270410046] [2021-12-15 14:00:50,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:00:50,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:00:50,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:50,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:00:50,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:00:50,146 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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:00:50,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:50,186 INFO L93 Difference]: Finished difference Result 103 states and 124 transitions. [2021-12-15 14:00:50,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:00:50,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2021-12-15 14:00:50,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:50,189 INFO L225 Difference]: With dead ends: 103 [2021-12-15 14:00:50,189 INFO L226 Difference]: Without dead ends: 100 [2021-12-15 14:00:50,189 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:00:50,190 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:50,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:00:50,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-15 14:00:50,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2021-12-15 14:00:50,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.6805555555555556) internal successors, (121), 99 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:00:50,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 121 transitions. [2021-12-15 14:00:50,196 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 121 transitions. Word has length 7 [2021-12-15 14:00:50,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:50,197 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 121 transitions. [2021-12-15 14:00:50,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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:00:50,197 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 121 transitions. [2021-12-15 14:00:50,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-15 14:00:50,197 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:50,197 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:00:50,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-15 14:00:50,198 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:00:50,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:50,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1857997403, now seen corresponding path program 1 times [2021-12-15 14:00:50,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:50,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932211335] [2021-12-15 14:00:50,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:50,199 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:50,291 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:00:50,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:50,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932211335] [2021-12-15 14:00:50,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932211335] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:00:50,292 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:00:50,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 14:00:50,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006516145] [2021-12-15 14:00:50,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:00:50,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 14:00:50,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:50,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 14:00:50,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-15 14:00:50,293 INFO L87 Difference]: Start difference. First operand 100 states and 121 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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:00:50,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:50,379 INFO L93 Difference]: Finished difference Result 126 states and 146 transitions. [2021-12-15 14:00:50,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 14:00:50,379 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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:00:50,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:50,380 INFO L225 Difference]: With dead ends: 126 [2021-12-15 14:00:50,380 INFO L226 Difference]: Without dead ends: 126 [2021-12-15 14:00:50,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:00:50,380 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 154 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:50,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 68 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:00:50,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-12-15 14:00:50,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 92. [2021-12-15 14:00:50,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 67 states have (on average 1.5970149253731343) internal successors, (107), 91 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:00:50,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 107 transitions. [2021-12-15 14:00:50,383 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 107 transitions. Word has length 15 [2021-12-15 14:00:50,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:50,384 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 107 transitions. [2021-12-15 14:00:50,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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:00:50,384 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2021-12-15 14:00:50,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-15 14:00:50,384 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:50,384 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:00:50,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-15 14:00:50,384 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:00:50,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:50,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1763344638, now seen corresponding path program 1 times [2021-12-15 14:00:50,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:50,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960434965] [2021-12-15 14:00:50,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:50,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:50,447 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:00:50,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:50,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960434965] [2021-12-15 14:00:50,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960434965] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:00:50,447 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:00:50,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:00:50,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148912781] [2021-12-15 14:00:50,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:00:50,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:00:50,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:50,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:00:50,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:00:50,448 INFO L87 Difference]: Start difference. First operand 92 states and 107 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:00:50,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:50,479 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2021-12-15 14:00:50,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:00:50,480 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:00:50,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:50,480 INFO L225 Difference]: With dead ends: 88 [2021-12-15 14:00:50,481 INFO L226 Difference]: Without dead ends: 88 [2021-12-15 14:00:50,481 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:00:50,481 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 14 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:50,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 84 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:00:50,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-15 14:00:50,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2021-12-15 14:00:50,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 87 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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:00:50,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2021-12-15 14:00:50,491 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 16 [2021-12-15 14:00:50,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:50,492 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2021-12-15 14:00:50,492 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:00:50,492 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2021-12-15 14:00:50,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-15 14:00:50,492 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:50,493 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:00:50,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-15 14:00:50,493 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:00:50,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:50,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1763344639, now seen corresponding path program 1 times [2021-12-15 14:00:50,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:50,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796092291] [2021-12-15 14:00:50,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:50,494 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:50,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:50,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:00:50,556 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:50,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796092291] [2021-12-15 14:00:50,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796092291] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:00:50,556 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:00:50,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:00:50,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631457264] [2021-12-15 14:00:50,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:00:50,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:00:50,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:50,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:00:50,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:00:50,558 INFO L87 Difference]: Start difference. First operand 88 states and 99 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:00:50,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:50,586 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2021-12-15 14:00:50,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:00:50,586 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:00:50,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:50,587 INFO L225 Difference]: With dead ends: 84 [2021-12-15 14:00:50,587 INFO L226 Difference]: Without dead ends: 84 [2021-12-15 14:00:50,587 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:00:50,588 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 10 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:50,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 89 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:00:50,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-15 14:00:50,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-12-15 14:00:50,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 83 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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:00:50,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2021-12-15 14:00:50,597 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 16 [2021-12-15 14:00:50,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:50,598 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2021-12-15 14:00:50,598 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:00:50,598 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2021-12-15 14:00:50,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-15 14:00:50,599 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:50,599 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:00:50,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-15 14:00:50,602 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:00:50,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:50,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1967864768, now seen corresponding path program 1 times [2021-12-15 14:00:50,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:50,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856883837] [2021-12-15 14:00:50,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:50,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:50,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:00:50,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:50,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856883837] [2021-12-15 14:00:50,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856883837] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:00:50,672 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:00:50,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:00:50,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522699407] [2021-12-15 14:00:50,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:00:50,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 14:00:50,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:50,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 14:00:50,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:00:50,673 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:00:50,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:50,759 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2021-12-15 14:00:50,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 14:00:50,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-15 14:00:50,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:50,760 INFO L225 Difference]: With dead ends: 114 [2021-12-15 14:00:50,761 INFO L226 Difference]: Without dead ends: 114 [2021-12-15 14:00:50,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:00:50,761 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 83 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:50,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 84 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:00:50,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-12-15 14:00:50,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 86. [2021-12-15 14:00:50,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 85 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:00:50,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2021-12-15 14:00:50,764 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 18 [2021-12-15 14:00:50,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:50,764 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2021-12-15 14:00:50,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:00:50,765 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2021-12-15 14:00:50,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-15 14:00:50,765 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:50,765 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:00:50,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-15 14:00:50,766 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:00:50,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:50,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1967864767, now seen corresponding path program 1 times [2021-12-15 14:00:50,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:50,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713329434] [2021-12-15 14:00:50,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:50,767 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:50,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:00:50,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:50,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713329434] [2021-12-15 14:00:50,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713329434] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:00:50,806 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:00:50,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:00:50,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418531148] [2021-12-15 14:00:50,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:00:50,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 14:00:50,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:50,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 14:00:50,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:00:50,807 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:00:50,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:50,890 INFO L93 Difference]: Finished difference Result 153 states and 172 transitions. [2021-12-15 14:00:50,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 14:00:50,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-15 14:00:50,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:50,891 INFO L225 Difference]: With dead ends: 153 [2021-12-15 14:00:50,891 INFO L226 Difference]: Without dead ends: 153 [2021-12-15 14:00:50,891 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:00:50,892 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 72 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:50,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 118 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:00:50,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-12-15 14:00:50,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 109. [2021-12-15 14:00:50,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 92 states have (on average 1.3804347826086956) internal successors, (127), 108 states have internal predecessors, (127), 0 states have call successors, (0), 0 states 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:00:50,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 127 transitions. [2021-12-15 14:00:50,894 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 127 transitions. Word has length 18 [2021-12-15 14:00:50,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:50,894 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 127 transitions. [2021-12-15 14:00:50,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:00:50,894 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 127 transitions. [2021-12-15 14:00:50,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-15 14:00:50,895 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:50,895 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:00:50,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-15 14:00:50,895 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:00:50,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:50,896 INFO L85 PathProgramCache]: Analyzing trace with hash -874266265, now seen corresponding path program 1 times [2021-12-15 14:00:50,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:50,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351515313] [2021-12-15 14:00:50,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:50,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:50,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:50,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:00:50,922 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:50,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351515313] [2021-12-15 14:00:50,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351515313] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:00:50,922 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:00:50,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:00:50,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679896912] [2021-12-15 14:00:50,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:00:50,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 14:00:50,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:50,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 14:00:50,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:00:50,923 INFO L87 Difference]: Start difference. First operand 109 states and 127 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:00:50,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:50,961 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2021-12-15 14:00:50,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 14:00:50,961 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-15 14:00:50,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:50,962 INFO L225 Difference]: With dead ends: 113 [2021-12-15 14:00:50,962 INFO L226 Difference]: Without dead ends: 113 [2021-12-15 14:00:50,962 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:00:50,963 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 89 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:50,963 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 108 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:00:50,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-15 14:00:50,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2021-12-15 14:00:50,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 105 states have internal predecessors, (118), 0 states have call successors, (0), 0 states 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:00:50,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2021-12-15 14:00:50,964 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 19 [2021-12-15 14:00:50,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:50,965 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2021-12-15 14:00:50,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:00:50,965 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2021-12-15 14:00:50,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-15 14:00:50,965 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:50,965 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:00:50,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-15 14:00:50,965 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:00:50,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:50,966 INFO L85 PathProgramCache]: Analyzing trace with hash 55140128, now seen corresponding path program 1 times [2021-12-15 14:00:50,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:50,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688852717] [2021-12-15 14:00:50,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:50,966 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:51,040 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:00:51,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:51,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688852717] [2021-12-15 14:00:51,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688852717] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:00:51,041 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:00:51,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 14:00:51,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118970063] [2021-12-15 14:00:51,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:00:51,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 14:00:51,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:51,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 14:00:51,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-15 14:00:51,042 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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:00:51,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:51,154 INFO L93 Difference]: Finished difference Result 170 states and 187 transitions. [2021-12-15 14:00:51,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 14:00:51,155 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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:00:51,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:51,155 INFO L225 Difference]: With dead ends: 170 [2021-12-15 14:00:51,155 INFO L226 Difference]: Without dead ends: 170 [2021-12-15 14:00:51,155 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-15 14:00:51,156 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 43 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:51,156 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 183 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:00:51,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-12-15 14:00:51,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 120. [2021-12-15 14:00:51,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 119 states have internal predecessors, (135), 0 states have call successors, (0), 0 states 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:00:51,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 135 transitions. [2021-12-15 14:00:51,158 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 135 transitions. Word has length 19 [2021-12-15 14:00:51,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:51,158 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 135 transitions. [2021-12-15 14:00:51,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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:00:51,158 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 135 transitions. [2021-12-15 14:00:51,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-15 14:00:51,159 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:51,159 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:00:51,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-15 14:00:51,159 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:00:51,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:51,159 INFO L85 PathProgramCache]: Analyzing trace with hash 55140129, now seen corresponding path program 1 times [2021-12-15 14:00:51,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:51,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216431786] [2021-12-15 14:00:51,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:51,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:51,334 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:00:51,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:51,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216431786] [2021-12-15 14:00:51,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216431786] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:00:51,335 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:00:51,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-15 14:00:51,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539109523] [2021-12-15 14:00:51,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:00:51,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-15 14:00:51,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:51,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-15 14:00:51,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-12-15 14:00:51,336 INFO L87 Difference]: Start difference. First operand 120 states and 135 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 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:00:51,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:51,637 INFO L93 Difference]: Finished difference Result 184 states and 199 transitions. [2021-12-15 14:00:51,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 14:00:51,638 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 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:00:51,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:51,639 INFO L225 Difference]: With dead ends: 184 [2021-12-15 14:00:51,639 INFO L226 Difference]: Without dead ends: 184 [2021-12-15 14:00:51,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2021-12-15 14:00:51,641 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 179 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:51,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 199 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:00:51,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-12-15 14:00:51,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 120. [2021-12-15 14:00:51,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 103 states have (on average 1.2912621359223302) internal successors, (133), 119 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:00:51,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 133 transitions. [2021-12-15 14:00:51,644 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 133 transitions. Word has length 19 [2021-12-15 14:00:51,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:51,644 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 133 transitions. [2021-12-15 14:00:51,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 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:00:51,644 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 133 transitions. [2021-12-15 14:00:51,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-15 14:00:51,645 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:51,645 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:00:51,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-15 14:00:51,645 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:00:51,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:51,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1332429407, now seen corresponding path program 1 times [2021-12-15 14:00:51,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:51,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650536550] [2021-12-15 14:00:51,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:51,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:51,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-15 14:00:51,671 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:51,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650536550] [2021-12-15 14:00:51,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650536550] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:00:51,672 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:00:51,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:00:51,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269039024] [2021-12-15 14:00:51,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:00:51,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 14:00:51,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:51,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 14:00:51,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:00:51,673 INFO L87 Difference]: Start difference. First operand 120 states and 133 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:00:51,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:51,732 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2021-12-15 14:00:51,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 14:00:51,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-15 14:00:51,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:51,734 INFO L225 Difference]: With dead ends: 135 [2021-12-15 14:00:51,734 INFO L226 Difference]: Without dead ends: 135 [2021-12-15 14:00:51,734 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:00:51,734 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 21 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:51,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 98 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:00:51,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-12-15 14:00:51,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 123. [2021-12-15 14:00:51,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 107 states have (on average 1.2990654205607477) internal successors, (139), 122 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:00:51,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 139 transitions. [2021-12-15 14:00:51,736 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 139 transitions. Word has length 20 [2021-12-15 14:00:51,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:51,736 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 139 transitions. [2021-12-15 14:00:51,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:00:51,736 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 139 transitions. [2021-12-15 14:00:51,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-15 14:00:51,737 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:51,737 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:00:51,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-15 14:00:51,738 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:00:51,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:51,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1332429406, now seen corresponding path program 1 times [2021-12-15 14:00:51,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:51,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147460576] [2021-12-15 14:00:51,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:51,739 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:51,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:51,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:00:51,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:51,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147460576] [2021-12-15 14:00:51,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147460576] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:00:51,791 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:00:51,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:00:51,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120761710] [2021-12-15 14:00:51,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:00:51,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:00:51,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:51,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:00:51,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:00:51,791 INFO L87 Difference]: Start difference. First operand 123 states and 139 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:00:51,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:51,908 INFO L93 Difference]: Finished difference Result 194 states and 217 transitions. [2021-12-15 14:00:51,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 14:00:51,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-15 14:00:51,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:51,912 INFO L225 Difference]: With dead ends: 194 [2021-12-15 14:00:51,912 INFO L226 Difference]: Without dead ends: 194 [2021-12-15 14:00:51,914 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-15 14:00:51,915 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 111 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:51,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 132 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:00:51,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-12-15 14:00:51,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 135. [2021-12-15 14:00:51,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 134 states have internal predecessors, (158), 0 states have call successors, (0), 0 states 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:00:51,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 158 transitions. [2021-12-15 14:00:51,924 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 158 transitions. Word has length 20 [2021-12-15 14:00:51,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:51,924 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 158 transitions. [2021-12-15 14:00:51,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:00:51,924 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 158 transitions. [2021-12-15 14:00:51,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-15 14:00:51,925 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:51,926 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:00:51,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-15 14:00:51,926 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:00:51,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:51,927 INFO L85 PathProgramCache]: Analyzing trace with hash -316635569, now seen corresponding path program 1 times [2021-12-15 14:00:51,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:51,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97196341] [2021-12-15 14:00:51,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:51,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:51,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:00:51,997 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:51,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97196341] [2021-12-15 14:00:51,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97196341] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:00:51,997 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:00:51,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 14:00:51,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443621669] [2021-12-15 14:00:51,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:00:51,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 14:00:51,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:51,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 14:00:51,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:00:51,998 INFO L87 Difference]: Start difference. First operand 135 states and 158 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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:00:52,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:52,155 INFO L93 Difference]: Finished difference Result 195 states and 225 transitions. [2021-12-15 14:00:52,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 14:00:52,155 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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:00:52,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:52,156 INFO L225 Difference]: With dead ends: 195 [2021-12-15 14:00:52,156 INFO L226 Difference]: Without dead ends: 195 [2021-12-15 14:00:52,156 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-12-15 14:00:52,156 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 93 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:52,156 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 236 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:00:52,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-12-15 14:00:52,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 143. [2021-12-15 14:00:52,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 127 states have (on average 1.31496062992126) internal successors, (167), 142 states have internal predecessors, (167), 0 states have call successors, (0), 0 states 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:00:52,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 167 transitions. [2021-12-15 14:00:52,160 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 167 transitions. Word has length 23 [2021-12-15 14:00:52,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:52,160 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 167 transitions. [2021-12-15 14:00:52,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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:00:52,160 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 167 transitions. [2021-12-15 14:00:52,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-15 14:00:52,160 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:52,161 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:00:52,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-15 14:00:52,161 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:00:52,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:52,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1225769432, now seen corresponding path program 1 times [2021-12-15 14:00:52,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:52,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542890071] [2021-12-15 14:00:52,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:52,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:52,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:00:52,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:52,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542890071] [2021-12-15 14:00:52,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542890071] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:00:52,208 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:00:52,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:00:52,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205428730] [2021-12-15 14:00:52,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:00:52,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:00:52,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:52,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:00:52,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:00:52,209 INFO L87 Difference]: Start difference. First operand 143 states and 167 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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:00:52,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:52,285 INFO L93 Difference]: Finished difference Result 167 states and 191 transitions. [2021-12-15 14:00:52,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 14:00:52,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-15 14:00:52,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:52,287 INFO L225 Difference]: With dead ends: 167 [2021-12-15 14:00:52,287 INFO L226 Difference]: Without dead ends: 167 [2021-12-15 14:00:52,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-15 14:00:52,288 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 112 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:52,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 148 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:00:52,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-12-15 14:00:52,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 157. [2021-12-15 14:00:52,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 141 states have (on average 1.3546099290780143) internal successors, (191), 156 states have internal predecessors, (191), 0 states have call successors, (0), 0 states 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:00:52,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 191 transitions. [2021-12-15 14:00:52,290 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 191 transitions. Word has length 24 [2021-12-15 14:00:52,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:52,291 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 191 transitions. [2021-12-15 14:00:52,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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:00:52,291 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 191 transitions. [2021-12-15 14:00:52,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-15 14:00:52,291 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:52,291 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:00:52,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-15 14:00:52,291 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:00:52,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:52,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1085033438, now seen corresponding path program 1 times [2021-12-15 14:00:52,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:52,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771035942] [2021-12-15 14:00:52,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:52,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:52,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:00:52,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:52,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771035942] [2021-12-15 14:00:52,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771035942] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:00:52,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822687644] [2021-12-15 14:00:52,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:52,403 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:00:52,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:00:52,405 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:00:52,406 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:00:52,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:52,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 39 conjunts are in the unsatisfiable core [2021-12-15 14:00:52,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:00:52,593 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:00:52,597 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:00:52,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:00:52,631 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-15 14:00:52,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:00:52,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-15 14:00:52,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:00:52,650 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-15 14:00:52,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:00:52,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-15 14:00:52,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:00:52,668 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-15 14:00:52,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:00:52,672 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-15 14:00:52,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:00:52,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-15 14:00:52,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:00:52,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-15 14:00:52,738 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 14:00:52,740 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 14:00:52,786 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:00:52,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:00:52,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:00:52,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822687644] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:00:52,958 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:00:52,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 9 [2021-12-15 14:00:52,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602684499] [2021-12-15 14:00:52,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:00:52,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-15 14:00:52,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:52,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 14:00:52,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-15 14:00:52,959 INFO L87 Difference]: Start difference. First operand 157 states and 191 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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:00:53,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:53,102 INFO L93 Difference]: Finished difference Result 186 states and 218 transitions. [2021-12-15 14:00:53,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 14:00:53,103 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-15 14:00:53,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:53,103 INFO L225 Difference]: With dead ends: 186 [2021-12-15 14:00:53,103 INFO L226 Difference]: Without dead ends: 186 [2021-12-15 14:00:53,104 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2021-12-15 14:00:53,104 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 183 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:53,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 266 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:00:53,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-12-15 14:00:53,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 161. [2021-12-15 14:00:53,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 145 states have (on average 1.3448275862068966) internal successors, (195), 160 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:00:53,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 195 transitions. [2021-12-15 14:00:53,107 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 195 transitions. Word has length 27 [2021-12-15 14:00:53,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:53,107 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 195 transitions. [2021-12-15 14:00:53,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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:00:53,107 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 195 transitions. [2021-12-15 14:00:53,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-15 14:00:53,107 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:53,107 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2021-12-15 14:00:53,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-15 14:00:53,319 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,SelfDestructingSolverStorable17 [2021-12-15 14:00:53,320 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:00:53,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:53,320 INFO L85 PathProgramCache]: Analyzing trace with hash 2078846143, now seen corresponding path program 1 times [2021-12-15 14:00:53,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:53,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172925439] [2021-12-15 14:00:53,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:53,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:53,368 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:00:53,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:53,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172925439] [2021-12-15 14:00:53,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172925439] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:00:53,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314135755] [2021-12-15 14:00:53,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:53,369 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:00:53,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:00:53,370 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:00:53,383 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:00:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:53,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-15 14:00:53,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:00:53,465 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:00:53,512 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-15 14:00:53,512 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-15 14:00:53,531 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:00:53,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:00:53,694 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:00:53,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314135755] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:00:53,694 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:00:53,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2021-12-15 14:00:53,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182836135] [2021-12-15 14:00:53,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:00:53,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 14:00:53,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:53,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 14:00:53,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:00:53,696 INFO L87 Difference]: Start difference. First operand 161 states and 195 transitions. Second operand has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states 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:00:53,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:53,756 INFO L93 Difference]: Finished difference Result 181 states and 214 transitions. [2021-12-15 14:00:53,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 14:00:53,757 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-15 14:00:53,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:53,757 INFO L225 Difference]: With dead ends: 181 [2021-12-15 14:00:53,758 INFO L226 Difference]: Without dead ends: 181 [2021-12-15 14:00:53,758 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-15 14:00:53,758 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 175 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:53,758 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 141 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 43 Unchecked, 0.1s Time] [2021-12-15 14:00:53,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-12-15 14:00:53,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 160. [2021-12-15 14:00:53,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 145 states have (on average 1.3310344827586207) internal successors, (193), 159 states have internal predecessors, (193), 0 states have call successors, (0), 0 states 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:00:53,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 193 transitions. [2021-12-15 14:00:53,761 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 193 transitions. Word has length 27 [2021-12-15 14:00:53,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:53,761 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 193 transitions. [2021-12-15 14:00:53,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states 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:00:53,762 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 193 transitions. [2021-12-15 14:00:53,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-15 14:00:53,762 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:53,762 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2021-12-15 14:00:53,781 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:00:53,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:00:53,975 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:00:53,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:53,976 INFO L85 PathProgramCache]: Analyzing trace with hash 2078846144, now seen corresponding path program 1 times [2021-12-15 14:00:53,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:53,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381462473] [2021-12-15 14:00:53,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:53,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:54,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:54,074 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:00:54,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:54,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381462473] [2021-12-15 14:00:54,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381462473] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:00:54,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552855461] [2021-12-15 14:00:54,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:54,075 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:00:54,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:00:54,079 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 14:00:54,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-15 14:00:54,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:54,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-15 14:00:54,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:00:54,183 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:00:54,192 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:00:54,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:00:54,274 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:00:54,279 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:00:54,280 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:00:54,326 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:00:54,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:00:54,641 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:00:54,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552855461] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:00:54,641 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:00:54,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2021-12-15 14:00:54,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787264271] [2021-12-15 14:00:54,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:00:54,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-15 14:00:54,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:54,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-15 14:00:54,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-15 14:00:54,642 INFO L87 Difference]: Start difference. First operand 160 states and 193 transitions. Second operand has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:00:54,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:54,786 INFO L93 Difference]: Finished difference Result 247 states and 298 transitions. [2021-12-15 14:00:54,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 14:00:54,786 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-15 14:00:54,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:54,787 INFO L225 Difference]: With dead ends: 247 [2021-12-15 14:00:54,787 INFO L226 Difference]: Without dead ends: 247 [2021-12-15 14:00:54,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2021-12-15 14:00:54,788 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 186 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:54,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 200 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 121 Invalid, 0 Unknown, 90 Unchecked, 0.1s Time] [2021-12-15 14:00:54,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-12-15 14:00:54,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 192. [2021-12-15 14:00:54,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 177 states have (on average 1.2937853107344632) internal successors, (229), 191 states have internal predecessors, (229), 0 states have call successors, (0), 0 states 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:00:54,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 229 transitions. [2021-12-15 14:00:54,795 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 229 transitions. Word has length 27 [2021-12-15 14:00:54,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:54,796 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 229 transitions. [2021-12-15 14:00:54,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:00:54,796 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 229 transitions. [2021-12-15 14:00:54,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-15 14:00:54,796 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:54,797 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:00:54,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-15 14:00:55,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:00:55,008 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:00:55,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:55,008 INFO L85 PathProgramCache]: Analyzing trace with hash 723701189, now seen corresponding path program 1 times [2021-12-15 14:00:55,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:55,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175271341] [2021-12-15 14:00:55,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:55,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:55,076 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:00:55,076 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:55,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175271341] [2021-12-15 14:00:55,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175271341] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:00:55,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079678425] [2021-12-15 14:00:55,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:55,077 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:00:55,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:00:55,092 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 14:00:55,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-15 14:00:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:55,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-15 14:00:55,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:00:55,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 15 treesize of output 5 [2021-12-15 14:00:55,283 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:00:55,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:00:55,394 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:00:55,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079678425] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:00:55,394 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:00:55,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 7 [2021-12-15 14:00:55,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153074115] [2021-12-15 14:00:55,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:00:55,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 14:00:55,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:55,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 14:00:55,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-15 14:00:55,396 INFO L87 Difference]: Start difference. First operand 192 states and 229 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:00:55,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:55,514 INFO L93 Difference]: Finished difference Result 194 states and 230 transitions. [2021-12-15 14:00:55,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 14:00:55,515 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-15 14:00:55,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:55,515 INFO L225 Difference]: With dead ends: 194 [2021-12-15 14:00:55,515 INFO L226 Difference]: Without dead ends: 182 [2021-12-15 14:00:55,516 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-12-15 14:00:55,516 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 19 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:55,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 230 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 159 Invalid, 0 Unknown, 88 Unchecked, 0.1s Time] [2021-12-15 14:00:55,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-12-15 14:00:55,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2021-12-15 14:00:55,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 167 states have (on average 1.3053892215568863) internal successors, (218), 181 states have internal predecessors, (218), 0 states have call successors, (0), 0 states 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:00:55,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 218 transitions. [2021-12-15 14:00:55,518 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 218 transitions. Word has length 28 [2021-12-15 14:00:55,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:55,519 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 218 transitions. [2021-12-15 14:00:55,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:00:55,519 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 218 transitions. [2021-12-15 14:00:55,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-15 14:00:55,519 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:55,519 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:00:55,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-15 14:00:55,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:00:55,720 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:00:55,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:55,720 INFO L85 PathProgramCache]: Analyzing trace with hash -28804244, now seen corresponding path program 1 times [2021-12-15 14:00:55,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:55,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848698008] [2021-12-15 14:00:55,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:55,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:55,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:00:55,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:55,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848698008] [2021-12-15 14:00:55,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848698008] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:00:55,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142014160] [2021-12-15 14:00:55,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:55,887 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:00:55,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:00:55,888 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 14:00:55,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-15 14:00:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:55,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-15 14:00:55,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:00:56,009 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:00:56,019 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:00:56,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:00:56,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:00:56,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-15 14:00:56,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:00:56,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-15 14:00:56,105 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:00:56,106 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:00:56,109 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 14 treesize of output 16 [2021-12-15 14:00:56,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2021-12-15 14:00:56,196 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 19 treesize of output 7 [2021-12-15 14:00:56,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:00:56,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:00:56,467 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:00:56,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142014160] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:00:56,467 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:00:56,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 4] total 17 [2021-12-15 14:00:56,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814134482] [2021-12-15 14:00:56,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:00:56,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-15 14:00:56,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:56,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-15 14:00:56,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2021-12-15 14:00:56,468 INFO L87 Difference]: Start difference. First operand 182 states and 218 transitions. Second operand has 18 states, 17 states have (on average 4.117647058823529) internal successors, (70), 18 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:00:56,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:56,889 INFO L93 Difference]: Finished difference Result 307 states and 363 transitions. [2021-12-15 14:00:56,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-15 14:00:56,891 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.117647058823529) internal successors, (70), 18 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-15 14:00:56,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:56,892 INFO L225 Difference]: With dead ends: 307 [2021-12-15 14:00:56,892 INFO L226 Difference]: Without dead ends: 307 [2021-12-15 14:00:56,892 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2021-12-15 14:00:56,893 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 431 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:56,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [431 Valid, 397 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 472 Invalid, 0 Unknown, 33 Unchecked, 0.3s Time] [2021-12-15 14:00:56,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-12-15 14:00:56,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 212. [2021-12-15 14:00:56,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 197 states have (on average 1.284263959390863) internal successors, (253), 211 states have internal predecessors, (253), 0 states have call successors, (0), 0 states 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:00:56,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 253 transitions. [2021-12-15 14:00:56,896 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 253 transitions. Word has length 31 [2021-12-15 14:00:56,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:56,896 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 253 transitions. [2021-12-15 14:00:56,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.117647058823529) internal successors, (70), 18 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:00:56,896 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 253 transitions. [2021-12-15 14:00:56,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-15 14:00:56,897 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:56,897 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:00:56,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-15 14:00:57,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-15 14:00:57,103 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:00:57,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:57,104 INFO L85 PathProgramCache]: Analyzing trace with hash 36474197, now seen corresponding path program 1 times [2021-12-15 14:00:57,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:57,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051301895] [2021-12-15 14:00:57,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:57,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:57,163 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:00:57,163 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:57,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051301895] [2021-12-15 14:00:57,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051301895] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:00:57,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857548186] [2021-12-15 14:00:57,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:57,164 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:00:57,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:00:57,164 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 14:00:57,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-15 14:00:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:57,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-15 14:00:57,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:00:57,364 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:00:57,394 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:00:57,430 INFO L354 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2021-12-15 14:00:57,431 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 21 treesize of output 29 [2021-12-15 14:00:57,486 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-15 14:00:57,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2021-12-15 14:00:57,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-15 14:00:57,518 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:00:57,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:00:57,646 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:00:57,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857548186] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:00:57,647 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:00:57,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2021-12-15 14:00:57,647 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897785713] [2021-12-15 14:00:57,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:00:57,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-15 14:00:57,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:57,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-15 14:00:57,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-12-15 14:00:57,648 INFO L87 Difference]: Start difference. First operand 212 states and 253 transitions. Second operand has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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:00:57,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:57,784 INFO L93 Difference]: Finished difference Result 230 states and 272 transitions. [2021-12-15 14:00:57,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 14:00:57,784 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-15 14:00:57,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:57,785 INFO L225 Difference]: With dead ends: 230 [2021-12-15 14:00:57,785 INFO L226 Difference]: Without dead ends: 230 [2021-12-15 14:00:57,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2021-12-15 14:00:57,786 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 67 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:57,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 317 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 167 Invalid, 0 Unknown, 97 Unchecked, 0.1s Time] [2021-12-15 14:00:57,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-12-15 14:00:57,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 211. [2021-12-15 14:00:57,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 197 states have (on average 1.2741116751269035) internal successors, (251), 210 states have internal predecessors, (251), 0 states have call successors, (0), 0 states 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:00:57,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 251 transitions. [2021-12-15 14:00:57,788 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 251 transitions. Word has length 32 [2021-12-15 14:00:57,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:57,789 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 251 transitions. [2021-12-15 14:00:57,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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:00:57,789 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 251 transitions. [2021-12-15 14:00:57,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-15 14:00:57,789 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:57,789 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:00:57,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-15 14:00:57,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:00:58,000 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:00:58,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:58,000 INFO L85 PathProgramCache]: Analyzing trace with hash 36474198, now seen corresponding path program 1 times [2021-12-15 14:00:58,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:58,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981775671] [2021-12-15 14:00:58,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:58,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:58,094 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:00:58,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:58,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981775671] [2021-12-15 14:00:58,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981775671] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:00:58,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532293479] [2021-12-15 14:00:58,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:58,095 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:00:58,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:00:58,096 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 14:00:58,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-15 14:00:58,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:58,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 37 conjunts are in the unsatisfiable core [2021-12-15 14:00:58,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:00:58,228 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:00:58,232 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:00:58,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:00:58,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:00:58,338 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-15 14:00:58,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-12-15 14:00:58,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 14:00:58,404 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-15 14:00:58,404 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 1 case distinctions, treesize of input 23 treesize of output 18 [2021-12-15 14:00:58,416 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-15 14:00:58,416 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2021-12-15 14:00:58,465 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-15 14:00:58,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2021-12-15 14:00:58,470 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-15 14:00:58,470 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2021-12-15 14:00:58,485 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:00:58,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:00:58,832 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:00:58,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532293479] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:00:58,832 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:00:58,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 18 [2021-12-15 14:00:58,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796095513] [2021-12-15 14:00:58,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:00:58,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-15 14:00:58,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:58,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-15 14:00:58,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-12-15 14:00:58,834 INFO L87 Difference]: Start difference. First operand 211 states and 251 transitions. Second operand has 19 states, 18 states have (on average 4.0) internal successors, (72), 19 states have internal predecessors, (72), 0 states have call successors, (0), 0 states 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:00:59,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:59,189 INFO L93 Difference]: Finished difference Result 276 states and 328 transitions. [2021-12-15 14:00:59,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 14:00:59,190 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.0) internal successors, (72), 19 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-15 14:00:59,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:59,190 INFO L225 Difference]: With dead ends: 276 [2021-12-15 14:00:59,191 INFO L226 Difference]: Without dead ends: 276 [2021-12-15 14:00:59,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2021-12-15 14:00:59,191 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 146 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:59,192 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 471 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 318 Invalid, 0 Unknown, 156 Unchecked, 0.2s Time] [2021-12-15 14:00:59,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-12-15 14:00:59,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 210. [2021-12-15 14:00:59,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 197 states have (on average 1.263959390862944) internal successors, (249), 209 states have internal predecessors, (249), 0 states have call successors, (0), 0 states 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:00:59,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 249 transitions. [2021-12-15 14:00:59,195 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 249 transitions. Word has length 32 [2021-12-15 14:00:59,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:59,195 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 249 transitions. [2021-12-15 14:00:59,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.0) internal successors, (72), 19 states have internal predecessors, (72), 0 states have call successors, (0), 0 states 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:00:59,196 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 249 transitions. [2021-12-15 14:00:59,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-15 14:00:59,196 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:59,196 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:00:59,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-15 14:00:59,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:00:59,404 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:00:59,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:59,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1911073267, now seen corresponding path program 1 times [2021-12-15 14:00:59,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:59,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415819962] [2021-12-15 14:00:59,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:59,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:59,525 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:00:59,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:59,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415819962] [2021-12-15 14:00:59,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415819962] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:00:59,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252079416] [2021-12-15 14:00:59,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:59,526 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:00:59,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:00:59,527 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 14:00:59,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-15 14:00:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:59,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-15 14:00:59,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:00:59,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-15 14:00:59,716 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:00:59,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252079416] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:00:59,716 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-15 14:00:59,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2021-12-15 14:00:59,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983496768] [2021-12-15 14:00:59,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:00:59,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 14:00:59,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:59,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 14:00:59,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-12-15 14:00:59,717 INFO L87 Difference]: Start difference. First operand 210 states and 249 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:00:59,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:59,819 INFO L93 Difference]: Finished difference Result 224 states and 255 transitions. [2021-12-15 14:00:59,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 14:00:59,819 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-15 14:00:59,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:59,820 INFO L225 Difference]: With dead ends: 224 [2021-12-15 14:00:59,820 INFO L226 Difference]: Without dead ends: 224 [2021-12-15 14:00:59,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2021-12-15 14:00:59,820 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 120 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:59,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 97 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:00:59,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-12-15 14:00:59,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 210. [2021-12-15 14:00:59,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 197 states have (on average 1.2588832487309645) internal successors, (248), 209 states have internal predecessors, (248), 0 states have call successors, (0), 0 states 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:00:59,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 248 transitions. [2021-12-15 14:00:59,823 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 248 transitions. Word has length 33 [2021-12-15 14:00:59,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:59,824 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 248 transitions. [2021-12-15 14:00:59,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:00:59,824 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 248 transitions. [2021-12-15 14:00:59,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-15 14:00:59,824 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:59,824 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:00:59,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-15 14:01:00,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-12-15 14:01:00,028 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:01:00,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:00,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1302827474, now seen corresponding path program 1 times [2021-12-15 14:01:00,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:01:00,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979297543] [2021-12-15 14:01:00,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:00,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:01:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:00,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-15 14:01:00,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:01:00,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979297543] [2021-12-15 14:01:00,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979297543] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:01:00,060 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:01:00,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:01:00,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497734076] [2021-12-15 14:01:00,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:01:00,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:01:00,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:01:00,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:01:00,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:01:00,061 INFO L87 Difference]: Start difference. First operand 210 states and 248 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:00,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:00,102 INFO L93 Difference]: Finished difference Result 216 states and 246 transitions. [2021-12-15 14:01:00,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 14:01:00,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-15 14:01:00,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:00,103 INFO L225 Difference]: With dead ends: 216 [2021-12-15 14:01:00,103 INFO L226 Difference]: Without dead ends: 216 [2021-12-15 14:01:00,104 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-15 14:01:00,104 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 106 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:00,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 99 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:01:00,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-12-15 14:01:00,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 181. [2021-12-15 14:01:00,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 168 states have (on average 1.2380952380952381) internal successors, (208), 180 states have internal predecessors, (208), 0 states have call successors, (0), 0 states 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,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 208 transitions. [2021-12-15 14:01:00,106 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 208 transitions. Word has length 36 [2021-12-15 14:01:00,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:00,107 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 208 transitions. [2021-12-15 14:01:00,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:00,107 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 208 transitions. [2021-12-15 14:01:00,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-15 14:01:00,107 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:00,107 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:01:00,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-15 14:01:00,107 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:01:00,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:00,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1302827524, now seen corresponding path program 1 times [2021-12-15 14:01:00,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:01:00,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883246247] [2021-12-15 14:01:00,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:00,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:01:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:00,150 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:01:00,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:01:00,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883246247] [2021-12-15 14:01:00,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883246247] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:01:00,151 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:01:00,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 14:01:00,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796589794] [2021-12-15 14:01:00,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:01:00,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 14:01:00,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:01:00,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 14:01:00,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-15 14:01:00,152 INFO L87 Difference]: Start difference. First operand 181 states and 208 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:00,313 INFO L93 Difference]: Finished difference Result 215 states and 243 transitions. [2021-12-15 14:01:00,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-15 14:01:00,313 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-15 14:01:00,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:00,314 INFO L225 Difference]: With dead ends: 215 [2021-12-15 14:01:00,314 INFO L226 Difference]: Without dead ends: 215 [2021-12-15 14:01:00,314 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-12-15 14:01:00,314 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 70 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:00,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 177 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:01:00,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-12-15 14:01:00,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 190. [2021-12-15 14:01:00,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 177 states have (on average 1.2429378531073447) internal successors, (220), 189 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:00,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 220 transitions. [2021-12-15 14:01:00,317 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 220 transitions. Word has length 36 [2021-12-15 14:01:00,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:00,317 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 220 transitions. [2021-12-15 14:01:00,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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,317 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 220 transitions. [2021-12-15 14:01:00,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-15 14:01:00,317 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:00,317 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:01:00,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-15 14:01:00,317 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:01:00,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:00,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1302827525, now seen corresponding path program 1 times [2021-12-15 14:01:00,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:01:00,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648752193] [2021-12-15 14:01:00,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:00,318 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:01:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:00,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:01:00,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:01:00,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648752193] [2021-12-15 14:01:00,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648752193] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:01:00,395 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:01:00,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 14:01:00,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901533023] [2021-12-15 14:01:00,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:01:00,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 14:01:00,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:01:00,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 14:01:00,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-15 14:01:00,396 INFO L87 Difference]: Start difference. First operand 190 states and 220 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:00,598 INFO L93 Difference]: Finished difference Result 259 states and 293 transitions. [2021-12-15 14:01:00,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 14:01:00,598 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-15 14:01:00,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:00,599 INFO L225 Difference]: With dead ends: 259 [2021-12-15 14:01:00,599 INFO L226 Difference]: Without dead ends: 259 [2021-12-15 14:01:00,600 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-12-15 14:01:00,600 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 126 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:00,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 249 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:01:00,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-12-15 14:01:00,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 190. [2021-12-15 14:01:00,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 177 states have (on average 1.2372881355932204) internal successors, (219), 189 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:00,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 219 transitions. [2021-12-15 14:01:00,603 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 219 transitions. Word has length 36 [2021-12-15 14:01:00,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:00,603 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 219 transitions. [2021-12-15 14:01:00,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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,604 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 219 transitions. [2021-12-15 14:01:00,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-15 14:01:00,604 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:00,604 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:01:00,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-15 14:01:00,604 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:01:00,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:00,605 INFO L85 PathProgramCache]: Analyzing trace with hash 904979977, now seen corresponding path program 1 times [2021-12-15 14:01:00,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:01:00,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997092045] [2021-12-15 14:01:00,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:00,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:01:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:00,813 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:01:00,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:01:00,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997092045] [2021-12-15 14:01:00,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997092045] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:01:00,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751741959] [2021-12-15 14:01:00,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:00,813 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:01:00,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:01:00,814 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 14:01:00,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-15 14:01:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:00,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 47 conjunts are in the unsatisfiable core [2021-12-15 14:01:00,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:01:00,957 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:00,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:01:00,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:00,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-15 14:01:01,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:01,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:01,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:01,037 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-15 14:01:01,119 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-15 14:01:01,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-15 14:01:01,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-15 14:01:01,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-15 14:01:01,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-15 14:01:01,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 23 treesize of output 23 [2021-12-15 14:01:01,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-15 14:01:01,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:01,475 INFO L354 Elim1Store]: treesize reduction 34, result has 46.0 percent of original size [2021-12-15 14:01:01,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 44 [2021-12-15 14:01:01,550 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:01:01,551 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 59 [2021-12-15 14:01:01,890 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:01:01,890 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 51 [2021-12-15 14:01:02,094 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:01:02,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:01:04,238 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1758 (Array Int Int))) (= 1 (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1758) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|)))) is different from false [2021-12-15 14:01:04,705 INFO L354 Elim1Store]: treesize reduction 74, result has 28.2 percent of original size [2021-12-15 14:01:04,705 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 3 case distinctions, treesize of input 67 treesize of output 60 [2021-12-15 14:01:04,711 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 100 treesize of output 94 [2021-12-15 14:01:04,715 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:01:04,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 55 [2021-12-15 14:01:04,727 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 47 treesize of output 45 [2021-12-15 14:01:04,730 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 78 treesize of output 74 [2021-12-15 14:01:06,790 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:01:06,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751741959] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:01:06,791 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:01:06,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 33 [2021-12-15 14:01:06,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934396385] [2021-12-15 14:01:06,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:01:06,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-15 14:01:06,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:01:06,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-15 14:01:06,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=873, Unknown=10, NotChecked=60, Total=1056 [2021-12-15 14:01:06,792 INFO L87 Difference]: Start difference. First operand 190 states and 219 transitions. Second operand has 33 states, 33 states have (on average 3.242424242424242) internal successors, (107), 33 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:07,506 INFO L93 Difference]: Finished difference Result 239 states and 274 transitions. [2021-12-15 14:01:07,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-15 14:01:07,506 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.242424242424242) internal successors, (107), 33 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-12-15 14:01:07,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:07,507 INFO L225 Difference]: With dead ends: 239 [2021-12-15 14:01:07,507 INFO L226 Difference]: Without dead ends: 239 [2021-12-15 14:01:07,507 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 66 SyntacticMatches, 11 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=294, Invalid=1769, Unknown=11, NotChecked=88, Total=2162 [2021-12-15 14:01:07,508 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 77 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 428 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:07,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 614 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 267 Invalid, 0 Unknown, 428 Unchecked, 0.2s Time] [2021-12-15 14:01:07,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-12-15 14:01:07,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 233. [2021-12-15 14:01:07,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 220 states have (on average 1.2181818181818183) internal successors, (268), 232 states have internal predecessors, (268), 0 states have call successors, (0), 0 states 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,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 268 transitions. [2021-12-15 14:01:07,510 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 268 transitions. Word has length 38 [2021-12-15 14:01:07,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:07,511 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 268 transitions. [2021-12-15 14:01:07,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.242424242424242) internal successors, (107), 33 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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,511 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 268 transitions. [2021-12-15 14:01:07,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-15 14:01:07,511 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:07,511 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:01:07,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-15 14:01:07,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-12-15 14:01:07,727 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:01:07,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:07,728 INFO L85 PathProgramCache]: Analyzing trace with hash -2113196924, now seen corresponding path program 1 times [2021-12-15 14:01:07,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:01:07,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837693858] [2021-12-15 14:01:07,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:07,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:01:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:07,791 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:01:07,792 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:01:07,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837693858] [2021-12-15 14:01:07,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837693858] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:01:07,792 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:01:07,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-15 14:01:07,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006300818] [2021-12-15 14:01:07,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:01:07,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-15 14:01:07,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:01:07,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 14:01:07,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-15 14:01:07,794 INFO L87 Difference]: Start difference. First operand 233 states and 268 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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:08,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:08,065 INFO L93 Difference]: Finished difference Result 341 states and 383 transitions. [2021-12-15 14:01:08,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-15 14:01:08,065 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-12-15 14:01:08,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:08,066 INFO L225 Difference]: With dead ends: 341 [2021-12-15 14:01:08,066 INFO L226 Difference]: Without dead ends: 341 [2021-12-15 14:01:08,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2021-12-15 14:01:08,067 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 286 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:08,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [286 Valid, 424 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:01:08,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-12-15 14:01:08,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 235. [2021-12-15 14:01:08,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 222 states have (on average 1.2162162162162162) internal successors, (270), 234 states have internal predecessors, (270), 0 states have call successors, (0), 0 states 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:08,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 270 transitions. [2021-12-15 14:01:08,071 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 270 transitions. Word has length 38 [2021-12-15 14:01:08,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:08,072 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 270 transitions. [2021-12-15 14:01:08,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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:08,072 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 270 transitions. [2021-12-15 14:01:08,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-15 14:01:08,072 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:08,072 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:01:08,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-15 14:01:08,073 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:01:08,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:08,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1084595048, now seen corresponding path program 1 times [2021-12-15 14:01:08,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:01:08,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219538442] [2021-12-15 14:01:08,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:08,074 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:01:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:08,146 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:01:08,147 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:01:08,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219538442] [2021-12-15 14:01:08,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219538442] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:01:08,147 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:01:08,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-15 14:01:08,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916094462] [2021-12-15 14:01:08,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:01:08,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-15 14:01:08,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:01:08,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 14:01:08,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-15 14:01:08,148 INFO L87 Difference]: Start difference. First operand 235 states and 270 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 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:08,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:08,409 INFO L93 Difference]: Finished difference Result 340 states and 382 transitions. [2021-12-15 14:01:08,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-15 14:01:08,410 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 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 39 [2021-12-15 14:01:08,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:08,411 INFO L225 Difference]: With dead ends: 340 [2021-12-15 14:01:08,411 INFO L226 Difference]: Without dead ends: 340 [2021-12-15 14:01:08,411 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2021-12-15 14:01:08,411 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 190 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:08,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 355 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:01:08,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-12-15 14:01:08,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 236. [2021-12-15 14:01:08,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 223 states have (on average 1.2152466367713004) internal successors, (271), 235 states have internal predecessors, (271), 0 states have call successors, (0), 0 states 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:08,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 271 transitions. [2021-12-15 14:01:08,415 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 271 transitions. Word has length 39 [2021-12-15 14:01:08,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:08,415 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 271 transitions. [2021-12-15 14:01:08,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 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:08,415 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 271 transitions. [2021-12-15 14:01:08,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-15 14:01:08,415 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:08,415 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:01:08,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-12-15 14:01:08,415 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:01:08,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:08,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1467279643, now seen corresponding path program 1 times [2021-12-15 14:01:08,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:01:08,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801680247] [2021-12-15 14:01:08,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:08,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:01:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:08,501 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:01:08,501 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:01:08,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801680247] [2021-12-15 14:01:08,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801680247] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:01:08,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652409326] [2021-12-15 14:01:08,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:08,502 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:01:08,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:01:08,503 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 14:01:08,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-15 14:01:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:08,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-15 14:01:08,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:01:08,689 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,692 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,792 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 14:01:08,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-15 14:01:08,815 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-15 14:01:08,815 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-15 14:01:08,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:01:08,897 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-15 14:01:08,897 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 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-15 14:01:08,913 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-15 14:01:08,913 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 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-15 14:01:08,955 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:01:08,955 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 11 treesize of output 11 [2021-12-15 14:01:08,958 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 12 treesize of output 14 [2021-12-15 14:01:09,025 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-15 14:01:09,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2021-12-15 14:01:09,068 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-15 14:01:09,068 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 11 [2021-12-15 14:01:09,111 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:01:09,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:01:09,652 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:01:09,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652409326] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:01:09,652 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:01:09,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 4] total 16 [2021-12-15 14:01:09,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490036288] [2021-12-15 14:01:09,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:01:09,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-15 14:01:09,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:01:09,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-15 14:01:09,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2021-12-15 14:01:09,653 INFO L87 Difference]: Start difference. First operand 236 states and 271 transitions. Second operand has 17 states, 16 states have (on average 7.125) internal successors, (114), 17 states have internal predecessors, (114), 0 states have call successors, (0), 0 states 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:09,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:09,928 INFO L93 Difference]: Finished difference Result 252 states and 284 transitions. [2021-12-15 14:01:09,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 14:01:09,929 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 7.125) internal successors, (114), 17 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-12-15 14:01:09,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:09,930 INFO L225 Difference]: With dead ends: 252 [2021-12-15 14:01:09,930 INFO L226 Difference]: Without dead ends: 252 [2021-12-15 14:01:09,930 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2021-12-15 14:01:09,930 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 212 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:09,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 304 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 182 Invalid, 0 Unknown, 168 Unchecked, 0.1s Time] [2021-12-15 14:01:09,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-12-15 14:01:09,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 194. [2021-12-15 14:01:09,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 181 states have (on average 1.2265193370165746) internal successors, (222), 193 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:09,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 222 transitions. [2021-12-15 14:01:09,933 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 222 transitions. Word has length 40 [2021-12-15 14:01:09,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:09,933 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 222 transitions. [2021-12-15 14:01:09,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 7.125) internal successors, (114), 17 states have internal predecessors, (114), 0 states have call successors, (0), 0 states 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:09,933 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 222 transitions. [2021-12-15 14:01:09,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-15 14:01:09,934 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:09,934 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:01:09,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-12-15 14:01:10,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-12-15 14:01:10,151 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:01:10,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:10,151 INFO L85 PathProgramCache]: Analyzing trace with hash 693362007, now seen corresponding path program 1 times [2021-12-15 14:01:10,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:01:10,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110321855] [2021-12-15 14:01:10,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:10,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:01:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:10,222 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:01:10,222 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:01:10,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110321855] [2021-12-15 14:01:10,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110321855] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:01:10,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169041135] [2021-12-15 14:01:10,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:10,223 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:01:10,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:01:10,224 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 14:01:10,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-15 14:01:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:10,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-15 14:01:10,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:01:10,398 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:10,460 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:01:10,460 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:10,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:01:10,554 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:01:10,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2021-12-15 14:01:10,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:01:10,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:01:10,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2021-12-15 14:01:10,707 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 20 treesize of output 18 [2021-12-15 14:01:10,864 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:01:10,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169041135] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:01:10,864 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:01:10,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 20 [2021-12-15 14:01:10,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820668245] [2021-12-15 14:01:10,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:01:10,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-15 14:01:10,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:01:10,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-15 14:01:10,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2021-12-15 14:01:10,866 INFO L87 Difference]: Start difference. First operand 194 states and 222 transitions. Second operand has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:11,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:11,463 INFO L93 Difference]: Finished difference Result 275 states and 306 transitions. [2021-12-15 14:01:11,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-15 14:01:11,463 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-12-15 14:01:11,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:11,464 INFO L225 Difference]: With dead ends: 275 [2021-12-15 14:01:11,464 INFO L226 Difference]: Without dead ends: 275 [2021-12-15 14:01:11,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=817, Unknown=0, NotChecked=0, Total=992 [2021-12-15 14:01:11,464 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 302 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:11,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 680 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 785 Invalid, 0 Unknown, 23 Unchecked, 0.4s Time] [2021-12-15 14:01:11,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-12-15 14:01:11,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 194. [2021-12-15 14:01:11,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 181 states have (on average 1.2209944751381216) internal successors, (221), 193 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:11,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 221 transitions. [2021-12-15 14:01:11,468 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 221 transitions. Word has length 40 [2021-12-15 14:01:11,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:11,468 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 221 transitions. [2021-12-15 14:01:11,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:11,468 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 221 transitions. [2021-12-15 14:01:11,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-15 14:01:11,468 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:11,468 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:01:11,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-15 14:01:11,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-12-15 14:01:11,685 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:01:11,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:11,685 INFO L85 PathProgramCache]: Analyzing trace with hash 737292038, now seen corresponding path program 1 times [2021-12-15 14:01:11,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:01:11,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319174089] [2021-12-15 14:01:11,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:11,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:01:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:11,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-15 14:01:11,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:01:11,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319174089] [2021-12-15 14:01:11,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319174089] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:01:11,716 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:01:11,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:01:11,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375596631] [2021-12-15 14:01:11,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:01:11,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 14:01:11,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:01:11,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 14:01:11,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:01:11,717 INFO L87 Difference]: Start difference. First operand 194 states and 221 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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:11,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:11,762 INFO L93 Difference]: Finished difference Result 193 states and 219 transitions. [2021-12-15 14:01:11,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 14:01:11,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-12-15 14:01:11,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:11,763 INFO L225 Difference]: With dead ends: 193 [2021-12-15 14:01:11,763 INFO L226 Difference]: Without dead ends: 193 [2021-12-15 14:01:11,763 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:11,764 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 5 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:11,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 106 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:01:11,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-12-15 14:01:11,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2021-12-15 14:01:11,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 181 states have (on average 1.2099447513812154) internal successors, (219), 192 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:01:11,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 219 transitions. [2021-12-15 14:01:11,767 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 219 transitions. Word has length 40 [2021-12-15 14:01:11,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:11,768 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 219 transitions. [2021-12-15 14:01:11,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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:11,768 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 219 transitions. [2021-12-15 14:01:11,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-15 14:01:11,768 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:11,768 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:01:11,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-12-15 14:01:11,768 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:01:11,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:11,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1696179932, now seen corresponding path program 1 times [2021-12-15 14:01:11,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:01:11,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69948367] [2021-12-15 14:01:11,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:11,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:01:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:11,977 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:01:11,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:01:11,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69948367] [2021-12-15 14:01:11,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69948367] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:01:11,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468278380] [2021-12-15 14:01:11,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:11,977 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:01:11,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:01:11,978 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 14:01:11,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-15 14:01:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:12,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 71 conjunts are in the unsatisfiable core [2021-12-15 14:01:12,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:01:12,167 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:12,180 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:12,183 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:12,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:12,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-15 14:01:12,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:12,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-15 14:01:12,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:12,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-15 14:01:12,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:12,239 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-15 14:01:12,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:12,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-15 14:01:12,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:12,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-15 14:01:12,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:12,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-15 14:01:12,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:12,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-15 14:01:12,360 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-15 14:01:12,360 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-15 14:01:12,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 14:01:12,424 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 14:01:12,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 14:01:12,444 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 14:01:12,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 14:01:12,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 14:01:12,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 14:01:12,492 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 14:01:12,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 14:01:12,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 14:01:12,595 INFO L354 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2021-12-15 14:01:12,595 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 1 case distinctions, treesize of input 23 treesize of output 26 [2021-12-15 14:01:12,606 INFO L354 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2021-12-15 14:01:12,606 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 1 case distinctions, treesize of input 23 treesize of output 26 [2021-12-15 14:01:12,676 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:01:12,676 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 56 [2021-12-15 14:01:12,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:12,979 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:01:12,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 30 [2021-12-15 14:01:12,982 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-12-15 14:01:13,196 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 0 case distinctions, treesize of input 17 treesize of output 17 [2021-12-15 14:01:13,241 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:01:13,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:01:13,461 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2482 Int) (v_ArrVal_2480 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2480) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) (or (= (select (store |c_#valid| |c_ULTIMATE.start_main_~first~0#1.base| v_ArrVal_2482) .cse0) 1) (and (= .cse0 0) (forall ((v_ArrVal_2481 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2481) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) 0)))))) is different from false [2021-12-15 14:01:13,502 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2482 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_2480 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2480) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) (or (and (forall ((v_ArrVal_2477 Int) (v_ArrVal_2481 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2477)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2481) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) 0)) (= .cse0 0)) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~first~0#1.base| v_ArrVal_2482) .cse0) 1)))) is different from false [2021-12-15 14:01:13,653 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2482 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2480 (Array Int Int))) (let ((.cse0 (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2474))) (store .cse2 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.base|))) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2480) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) (or (and (= .cse0 0) (forall ((v_ArrVal_2475 (Array Int Int)) (v_ArrVal_2477 Int) (v_ArrVal_2481 (Array Int Int))) (= (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2475))) (store .cse1 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2477))) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2481) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) 0))) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~first~0#1.base| v_ArrVal_2482) .cse0) 1)))) is different from false [2021-12-15 14:01:13,919 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2482 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (|v_ULTIMATE.start_main_~x~0#1.base_45| Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2480 (Array Int Int))) (let ((.cse0 (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2474))) (store .cse2 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |v_ULTIMATE.start_main_~x~0#1.base_45|))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2480) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) (or (= (select (store (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45| 1) |c_ULTIMATE.start_main_~first~0#1.base| v_ArrVal_2482) .cse0) 1) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45|))) (and (= .cse0 0) (forall ((v_ArrVal_2475 (Array Int Int)) (v_ArrVal_2477 Int) (v_ArrVal_2481 (Array Int Int))) (= (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2475))) (store .cse1 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2477))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2481) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) 0)))))) is different from false [2021-12-15 14:01:14,090 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2482 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (|v_ULTIMATE.start_main_~x~0#1.base_45| Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2480 (Array Int Int))) (let ((.cse0 (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2474))) (store .cse2 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |v_ULTIMATE.start_main_~x~0#1.base_45|))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2480) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)))) (or (= (select (store (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45| 1) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2482) .cse0) 1) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45|))) (and (= .cse0 0) (forall ((v_ArrVal_2475 (Array Int Int)) (v_ArrVal_2477 Int) (v_ArrVal_2481 (Array Int Int))) (= (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2475))) (store .cse1 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2477))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2481) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0)))))) is different from false [2021-12-15 14:01:14,478 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2461 Int) (v_ArrVal_2482 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (|v_ULTIMATE.start_main_~x~0#1.base_45| Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2480 (Array Int Int))) (let ((.cse0 (select (select (store (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_2461)) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2474))) (store .cse2 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |v_ULTIMATE.start_main_~x~0#1.base_45|))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2480) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)))) (or (= (select (store (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45| 1) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2482) .cse0) 1) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45|))) (and (forall ((v_ArrVal_2462 Int) (v_ArrVal_2475 (Array Int Int)) (v_ArrVal_2477 Int) (v_ArrVal_2481 (Array Int Int))) (= (select (select (store (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_2462)) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2475))) (store .cse1 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2477))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2481) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0)) (= .cse0 0))))) is different from false [2021-12-15 14:01:14,626 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2461 Int) (v_ArrVal_2460 Int) (v_ArrVal_2482 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (|v_ULTIMATE.start_main_~x~0#1.base_45| Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2480 (Array Int Int))) (let ((.cse0 (select (select (store (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4) v_ArrVal_2460) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_2461)) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2474))) (store .cse2 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |v_ULTIMATE.start_main_~x~0#1.base_45|))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2480) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45|))) (= (select (store (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45| 1) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2482) .cse0) 1) (and (= .cse0 0) (forall ((v_ArrVal_2462 Int) (v_ArrVal_2475 (Array Int Int)) (v_ArrVal_2477 Int) (v_ArrVal_2458 Int) (v_ArrVal_2481 (Array Int Int))) (= (select (select (store (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4) v_ArrVal_2458) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_2462)) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2475))) (store .cse1 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2477))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2481) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0)))))) is different from false [2021-12-15 14:01:14,779 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2461 Int) (v_ArrVal_2460 Int) (v_ArrVal_2482 Int) (v_ArrVal_2454 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (|v_ULTIMATE.start_main_~x~0#1.base_45| Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2480 (Array Int Int))) (let ((.cse0 (select (select (store (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_2454) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4) v_ArrVal_2460) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_2461)) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2474))) (store .cse2 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |v_ULTIMATE.start_main_~x~0#1.base_45|))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2480) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)))) (or (= (select (store (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45| 1) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2482) .cse0) 1) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45|))) (and (= .cse0 0) (forall ((v_ArrVal_2462 Int) (v_ArrVal_2453 Int) (v_ArrVal_2475 (Array Int Int)) (v_ArrVal_2477 Int) (v_ArrVal_2458 Int) (v_ArrVal_2481 (Array Int Int))) (= (select (select (store (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_2453) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4) v_ArrVal_2458) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_2462)) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2475))) (store .cse1 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2477))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2481) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0)))))) is different from false [2021-12-15 14:01:14,925 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2461 Int) (v_ArrVal_2460 Int) (v_ArrVal_2482 Int) (v_ArrVal_2452 Int) (v_ArrVal_2454 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (|v_ULTIMATE.start_main_~x~0#1.base_45| Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2480 (Array Int Int))) (let ((.cse0 (select (select (store (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16) v_ArrVal_2452) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_2454) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4) v_ArrVal_2460) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_2461)) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2474))) (store .cse2 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |v_ULTIMATE.start_main_~x~0#1.base_45|))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2480) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)))) (or (= (select (store (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45| 1) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2482) .cse0) 1) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45|))) (and (= .cse0 0) (forall ((v_ArrVal_2450 Int) (v_ArrVal_2462 Int) (v_ArrVal_2453 Int) (v_ArrVal_2475 (Array Int Int)) (v_ArrVal_2477 Int) (v_ArrVal_2458 Int) (v_ArrVal_2481 (Array Int Int))) (= (select (select (store (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16) v_ArrVal_2450) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_2453) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4) v_ArrVal_2458) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_2462)) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2475))) (store .cse1 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2477))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2481) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0)))))) is different from false [2021-12-15 14:01:14,979 INFO L354 Elim1Store]: treesize reduction 320, result has 13.3 percent of original size [2021-12-15 14:01:14,980 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 5 case distinctions, treesize of input 262 treesize of output 198 [2021-12-15 14:01:15,036 INFO L354 Elim1Store]: treesize reduction 320, result has 13.3 percent of original size [2021-12-15 14:01:15,036 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 5 case distinctions, treesize of input 198 treesize of output 190 [2021-12-15 14:01:15,040 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 232 treesize of output 220 [2021-12-15 14:01:15,050 INFO L354 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2021-12-15 14:01:15,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 236 treesize of output 214 [2021-12-15 14:01:15,059 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 321 treesize of output 307 [2021-12-15 14:01:15,069 INFO L354 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2021-12-15 14:01:15,070 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 347 treesize of output 321 [2021-12-15 14:01:15,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 321 treesize of output 305 [2021-12-15 14:01:15,080 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 345 treesize of output 337 [2021-12-15 14:01:15,091 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 137 [2021-12-15 14:01:15,096 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 137 treesize of output 129 [2021-12-15 14:01:15,605 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2021-12-15 14:01:15,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468278380] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:01:15,606 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:01:15,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 17] total 37 [2021-12-15 14:01:15,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770496286] [2021-12-15 14:01:15,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:01:15,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-15 14:01:15,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:01:15,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-15 14:01:15,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=704, Unknown=9, NotChecked=558, Total=1406 [2021-12-15 14:01:15,607 INFO L87 Difference]: Start difference. First operand 193 states and 219 transitions. Second operand has 38 states, 37 states have (on average 3.189189189189189) internal successors, (118), 38 states have internal predecessors, (118), 0 states have call successors, (0), 0 states 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,166 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) (.cse3 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) (.cse6 (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (= 0 |c_ULTIMATE.start_main_~first~0#1.offset|) (forall ((v_ArrVal_2482 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (|v_ULTIMATE.start_main_~x~0#1.base_45| Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2480 (Array Int Int))) (let ((.cse0 (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2474))) (store .cse2 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |v_ULTIMATE.start_main_~x~0#1.base_45|))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2480) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)))) (or (= (select (store (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45| 1) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2482) .cse0) 1) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45|))) (and (= .cse0 0) (forall ((v_ArrVal_2475 (Array Int Int)) (v_ArrVal_2477 Int) (v_ArrVal_2481 (Array Int Int))) (= (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2475))) (store .cse1 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2477))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2481) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0)))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~first~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~first~0#1.base| |c_ULTIMATE.start_main_~last~0#1.base|) (not (= |c_ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_~last~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~last~0#1.base|)) (forall ((v_ArrVal_2482 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_2480 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2480) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) (or (and (forall ((v_ArrVal_2477 Int) (v_ArrVal_2481 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2477)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2481) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) 0)) (= .cse4 0)) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~first~0#1.base| v_ArrVal_2482) .cse4) 1)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse5) 0) (= |c_ULTIMATE.start_main_~first~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse5) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~first~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~last~0#1.offset| 0) (= 1 .cse6) (not (= |c_ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_~first~0#1.base|)) (= .cse6 1) (= (select |c_#valid| |c_ULTIMATE.start_main_~first~0#1.base|) 1) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (= |c_ULTIMATE.start_main_~last~0#1.base| |c_ULTIMATE.start_main_~first~0#1.base|))) is different from false [2021-12-15 14:01:20,174 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) (.cse3 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) (.cse6 (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (= 0 |c_ULTIMATE.start_main_~first~0#1.offset|) (forall ((v_ArrVal_2482 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (|v_ULTIMATE.start_main_~x~0#1.base_45| Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2480 (Array Int Int))) (let ((.cse0 (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2474))) (store .cse2 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |v_ULTIMATE.start_main_~x~0#1.base_45|))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2480) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)))) (or (= (select (store (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45| 1) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2482) .cse0) 1) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45|))) (and (= .cse0 0) (forall ((v_ArrVal_2475 (Array Int Int)) (v_ArrVal_2477 Int) (v_ArrVal_2481 (Array Int Int))) (= (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2475))) (store .cse1 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2477))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2481) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0)))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~first~0#1.base|) .cse3) 0) (not (= |c_ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_~last~0#1.base|)) (= |c_ULTIMATE.start_main_~first~0#1.base| |c_ULTIMATE.start_main_~last~0#1.base|) (forall ((v_ArrVal_2482 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_2480 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2480) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) (or (and (forall ((v_ArrVal_2477 Int) (v_ArrVal_2481 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2477)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2481) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) 0)) (= .cse4 0)) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~first~0#1.base| v_ArrVal_2482) .cse4) 1)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse5) 0) (= |c_ULTIMATE.start_main_~first~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse5) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~first~0#1.base|) .cse3) 0) (= 1 .cse6) (= |c_ULTIMATE.start_main_~last~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_~first~0#1.base|)) (= .cse6 1) (= (select |c_#valid| |c_ULTIMATE.start_main_~first~0#1.base|) 1) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (= |c_ULTIMATE.start_main_~last~0#1.base| |c_ULTIMATE.start_main_~first~0#1.base|))) is different from false [2021-12-15 14:01:22,184 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12))) (and (= 0 |c_ULTIMATE.start_main_~first~0#1.offset|) (forall ((v_ArrVal_2482 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_2480 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2480) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) (or (and (forall ((v_ArrVal_2477 Int) (v_ArrVal_2481 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2477)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2481) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) 0)) (= .cse0 0)) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~first~0#1.base| v_ArrVal_2482) .cse0) 1)))) (= |c_ULTIMATE.start_main_~first~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~first~0#1.base|) .cse1) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~first~0#1.base|) .cse1) 0) (= |c_ULTIMATE.start_main_~last~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_~last~0#1.base|)) (= |c_ULTIMATE.start_main_~first~0#1.base| |c_ULTIMATE.start_main_~last~0#1.base|) (not (= |c_ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_~first~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_main_~first~0#1.base|) 1) (= |c_ULTIMATE.start_main_~last~0#1.base| |c_ULTIMATE.start_main_~first~0#1.base|))) is different from false [2021-12-15 14:01:23,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:23,024 INFO L93 Difference]: Finished difference Result 345 states and 388 transitions. [2021-12-15 14:01:23,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-12-15 14:01:23,024 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 3.189189189189189) internal successors, (118), 38 states have internal predecessors, (118), 0 states have call successors, (0), 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 42 [2021-12-15 14:01:23,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:23,025 INFO L225 Difference]: With dead ends: 345 [2021-12-15 14:01:23,025 INFO L226 Difference]: Without dead ends: 345 [2021-12-15 14:01:23,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 61 SyntacticMatches, 20 SemanticMatches, 61 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 790 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=433, Invalid=2153, Unknown=12, NotChecked=1308, Total=3906 [2021-12-15 14:01:23,026 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 204 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 2176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1579 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:23,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 790 Invalid, 2176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 552 Invalid, 0 Unknown, 1579 Unchecked, 0.3s Time] [2021-12-15 14:01:23,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2021-12-15 14:01:23,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 255. [2021-12-15 14:01:23,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 243 states have (on average 1.1975308641975309) internal successors, (291), 254 states have internal predecessors, (291), 0 states have call successors, (0), 0 states 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,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 291 transitions. [2021-12-15 14:01:23,033 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 291 transitions. Word has length 42 [2021-12-15 14:01:23,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:23,033 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 291 transitions. [2021-12-15 14:01:23,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 3.189189189189189) internal successors, (118), 38 states have internal predecessors, (118), 0 states have call successors, (0), 0 states 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,039 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 291 transitions. [2021-12-15 14:01:23,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-15 14:01:23,041 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:23,041 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:01:23,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-15 14:01:23,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-12-15 14:01:23,251 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:01:23,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:23,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1696179933, now seen corresponding path program 1 times [2021-12-15 14:01:23,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:01:23,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242814611] [2021-12-15 14:01:23,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:23,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:01:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:23,412 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:01:23,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:01:23,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242814611] [2021-12-15 14:01:23,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242814611] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:01:23,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563226131] [2021-12-15 14:01:23,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:23,413 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:01:23,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:01:23,413 INFO L229 MonitoredProcess]: Starting monitored process 14 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:23,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-15 14:01:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:23,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-15 14:01:23,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:01:23,590 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,672 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,680 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:01:23,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:23,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:01:23,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:01:23,849 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:01:23,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-15 14:01:23,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-15 14:01:23,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 14:01:23,915 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-15 14:01:23,964 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:01:23,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:01:24,056 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2644 (Array Int Int)) (v_ArrVal_2643 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2643) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0) 16) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2644) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0))))) (forall ((v_ArrVal_2643 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2643) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) 12)))) is different from false [2021-12-15 14:01:24,077 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:01:24,077 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 45 treesize of output 46 [2021-12-15 14:01:24,083 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:01:24,083 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 35 treesize of output 36 [2021-12-15 14:01:24,103 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:01:24,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 65 [2021-12-15 14:01:24,115 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:01:24,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 93 [2021-12-15 14:01:24,120 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 40 treesize of output 32 [2021-12-15 14:01:24,125 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 66 treesize of output 58 [2021-12-15 14:01:24,246 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:01:24,246 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 24 treesize of output 25 [2021-12-15 14:01:24,248 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:01:24,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:24,250 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-15 14:01:24,456 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:01:24,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563226131] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:01:24,456 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:01:24,456 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2021-12-15 14:01:24,456 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476092324] [2021-12-15 14:01:24,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:01:24,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-15 14:01:24,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:01:24,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-15 14:01:24,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=397, Unknown=1, NotChecked=40, Total=506 [2021-12-15 14:01:24,457 INFO L87 Difference]: Start difference. First operand 255 states and 291 transitions. Second operand has 23 states, 22 states have (on average 5.045454545454546) internal successors, (111), 23 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:25,020 INFO L93 Difference]: Finished difference Result 365 states and 414 transitions. [2021-12-15 14:01:25,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-15 14:01:25,021 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 5.045454545454546) internal successors, (111), 23 states have internal predecessors, (111), 0 states have call successors, (0), 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 42 [2021-12-15 14:01:25,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:25,022 INFO L225 Difference]: With dead ends: 365 [2021-12-15 14:01:25,022 INFO L226 Difference]: Without dead ends: 365 [2021-12-15 14:01:25,023 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=722, Unknown=1, NotChecked=56, Total=930 [2021-12-15 14:01:25,024 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 222 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 191 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:25,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 714 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 720 Invalid, 0 Unknown, 191 Unchecked, 0.3s Time] [2021-12-15 14:01:25,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-12-15 14:01:25,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 309. [2021-12-15 14:01:25,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 297 states have (on average 1.2053872053872055) internal successors, (358), 308 states have internal predecessors, (358), 0 states have call successors, (0), 0 states 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,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 358 transitions. [2021-12-15 14:01:25,037 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 358 transitions. Word has length 42 [2021-12-15 14:01:25,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:25,037 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 358 transitions. [2021-12-15 14:01:25,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.045454545454546) internal successors, (111), 23 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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,038 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 358 transitions. [2021-12-15 14:01:25,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-15 14:01:25,038 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:25,038 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:01:25,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-15 14:01:25,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-12-15 14:01:25,243 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:01:25,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:25,244 INFO L85 PathProgramCache]: Analyzing trace with hash -131950583, now seen corresponding path program 1 times [2021-12-15 14:01:25,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:01:25,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084203635] [2021-12-15 14:01:25,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:25,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:01:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:25,563 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:01:25,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:01:25,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084203635] [2021-12-15 14:01:25,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084203635] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:01:25,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683737549] [2021-12-15 14:01:25,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:25,564 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:01:25,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:01:25,565 INFO L229 MonitoredProcess]: Starting monitored process 15 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:25,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-15 14:01:25,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:25,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 79 conjunts are in the unsatisfiable core [2021-12-15 14:01:25,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:01:25,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:01:25,756 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:01:25,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:25,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 21 treesize of output 20 [2021-12-15 14:01:25,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:25,804 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-15 14:01:25,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:25,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-15 14:01:25,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:25,819 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-15 14:01:25,921 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-15 14:01:25,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2021-12-15 14:01:25,946 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-15 14:01:25,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2021-12-15 14:01:26,069 INFO L354 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2021-12-15 14:01:26,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 48 [2021-12-15 14:01:26,087 INFO L354 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2021-12-15 14:01:26,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 41 [2021-12-15 14:01:26,098 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 7 treesize of output 5 [2021-12-15 14:01:26,106 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 7 treesize of output 5 [2021-12-15 14:01:26,115 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 5 treesize of output 3 [2021-12-15 14:01:26,130 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 11 treesize of output 7 [2021-12-15 14:01:26,137 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 11 treesize of output 7 [2021-12-15 14:01:26,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:26,189 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 33 treesize of output 32 [2021-12-15 14:01:26,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:26,195 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 33 treesize of output 32 [2021-12-15 14:01:26,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2021-12-15 14:01:26,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2021-12-15 14:01:26,266 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-15 14:01:26,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 34 [2021-12-15 14:01:26,277 INFO L354 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2021-12-15 14:01:26,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 40 [2021-12-15 14:01:26,570 INFO L354 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2021-12-15 14:01:26,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 67 treesize of output 57 [2021-12-15 14:01:26,584 INFO L354 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2021-12-15 14:01:26,584 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 30 treesize of output 34 [2021-12-15 14:01:26,741 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:01:26,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:01:27,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-15 14:01:27,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-15 14:01:27,263 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-15 14:01:27,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-15 14:01:27,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-15 14:01:27,534 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-15 14:01:27,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-15 14:01:27,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-15 14:01:27,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-15 14:01:28,018 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-15 14:01:28,036 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-15 14:01:28,195 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-15 14:01:28,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-15 14:01:28,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-15 14:01:28,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-15 14:01:28,758 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:01:28,758 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 2 case distinctions, treesize of input 545 treesize of output 489 [2021-12-15 14:01:28,760 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:01:28,767 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:01:28,769 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:01:28,769 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:01:28,769 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:01:28,775 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:01:28,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 459 treesize of output 468 [2021-12-15 14:01:28,780 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:01:28,780 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 2 case distinctions, treesize of input 468 treesize of output 323 [2021-12-15 14:01:28,781 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:01:28,782 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:01:28,783 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:01:28,783 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:01:28,783 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:01:28,793 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:01:28,793 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 173 treesize of output 182 [2021-12-15 14:01:28,805 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:01:28,806 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:01:28,806 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:01:28,866 INFO L354 Elim1Store]: treesize reduction 63, result has 49.2 percent of original size [2021-12-15 14:01:28,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 182 treesize of output 210 [2021-12-15 14:01:28,885 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:01:28,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 247 treesize of output 245 [2021-12-15 14:01:28,894 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-15 14:01:28,894 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 251 treesize of output 248 [2021-12-15 14:01:28,949 INFO L354 Elim1Store]: treesize reduction 95, result has 39.1 percent of original size [2021-12-15 14:01:28,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 248 treesize of output 260 [2021-12-15 14:01:28,974 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:01:28,974 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 375 treesize of output 369 [2021-12-15 14:01:28,991 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 267 treesize of output 265 [2021-12-15 14:01:28,996 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:01:28,998 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 238 treesize of output 228 [2021-12-15 14:01:29,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 4 [2021-12-15 14:01:29,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-12-15 14:01:29,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-15 14:01:29,137 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:01:29,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683737549] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:01:29,138 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:01:29,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 22] total 54 [2021-12-15 14:01:29,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839079443] [2021-12-15 14:01:29,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:01:29,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2021-12-15 14:01:29,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:01:29,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-12-15 14:01:29,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=2182, Unknown=461, NotChecked=0, Total=2862 [2021-12-15 14:01:29,140 INFO L87 Difference]: Start difference. First operand 309 states and 358 transitions. Second operand has 54 states, 54 states have (on average 2.0555555555555554) internal successors, (111), 54 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:32,817 INFO L93 Difference]: Finished difference Result 555 states and 661 transitions. [2021-12-15 14:01:32,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-12-15 14:01:32,817 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.0555555555555554) internal successors, (111), 54 states have internal predecessors, (111), 0 states have call successors, (0), 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 42 [2021-12-15 14:01:32,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:32,818 INFO L225 Difference]: With dead ends: 555 [2021-12-15 14:01:32,818 INFO L226 Difference]: Without dead ends: 555 [2021-12-15 14:01:32,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1987 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=931, Invalid=7365, Unknown=824, NotChecked=0, Total=9120 [2021-12-15 14:01:32,820 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 671 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 2521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 744 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:32,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [671 Valid, 1423 Invalid, 2521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1600 Invalid, 0 Unknown, 744 Unchecked, 0.9s Time] [2021-12-15 14:01:32,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2021-12-15 14:01:32,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 337. [2021-12-15 14:01:32,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 325 states have (on average 1.1938461538461538) internal successors, (388), 336 states have internal predecessors, (388), 0 states have call successors, (0), 0 states 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,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 388 transitions. [2021-12-15 14:01:32,824 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 388 transitions. Word has length 42 [2021-12-15 14:01:32,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:32,824 INFO L470 AbstractCegarLoop]: Abstraction has 337 states and 388 transitions. [2021-12-15 14:01:32,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.0555555555555554) internal successors, (111), 54 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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,824 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 388 transitions. [2021-12-15 14:01:32,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-15 14:01:32,825 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:32,825 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:01:32,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-15 14:01:33,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:01:33,025 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:01:33,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:33,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1041969739, now seen corresponding path program 1 times [2021-12-15 14:01:33,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:01:33,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058636420] [2021-12-15 14:01:33,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:33,026 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:01:33,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:33,214 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:01:33,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:01:33,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058636420] [2021-12-15 14:01:33,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058636420] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:01:33,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481284553] [2021-12-15 14:01:33,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:33,214 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:01:33,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:01:33,215 INFO L229 MonitoredProcess]: Starting monitored process 16 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:33,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-15 14:01:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:33,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-15 14:01:33,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:01:33,397 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:33,468 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:01:33,468 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 11 treesize of output 11 [2021-12-15 14:01:33,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:01:33,599 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:01:33,599 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 27 treesize of output 28 [2021-12-15 14:01:33,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 24 treesize of output 12 [2021-12-15 14:01:33,649 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:01:33,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:01:33,681 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2961 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2961) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12))))) is different from false [2021-12-15 14:01:33,685 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:01:33,685 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 23 treesize of output 24 [2021-12-15 14:01:33,690 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:01:33,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 42 [2021-12-15 14:01:33,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2021-12-15 14:01:33,892 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:01:33,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481284553] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:01:33,893 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:01:33,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 18 [2021-12-15 14:01:33,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674150255] [2021-12-15 14:01:33,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:01:33,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-15 14:01:33,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:01:33,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-15 14:01:33,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=222, Unknown=1, NotChecked=30, Total=306 [2021-12-15 14:01:33,894 INFO L87 Difference]: Start difference. First operand 337 states and 388 transitions. Second operand has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:34,324 INFO L93 Difference]: Finished difference Result 372 states and 412 transitions. [2021-12-15 14:01:34,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-15 14:01:34,325 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 0 states have call successors, (0), 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 43 [2021-12-15 14:01:34,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:34,325 INFO L225 Difference]: With dead ends: 372 [2021-12-15 14:01:34,325 INFO L226 Difference]: Without dead ends: 372 [2021-12-15 14:01:34,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=544, Unknown=1, NotChecked=50, Total=756 [2021-12-15 14:01:34,326 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 188 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 241 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:34,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 528 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 535 Invalid, 0 Unknown, 241 Unchecked, 0.3s Time] [2021-12-15 14:01:34,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-12-15 14:01:34,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 337. [2021-12-15 14:01:34,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 325 states have (on average 1.1876923076923076) internal successors, (386), 336 states have internal predecessors, (386), 0 states have call successors, (0), 0 states 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,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 386 transitions. [2021-12-15 14:01:34,330 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 386 transitions. Word has length 43 [2021-12-15 14:01:34,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:34,330 INFO L470 AbstractCegarLoop]: Abstraction has 337 states and 386 transitions. [2021-12-15 14:01:34,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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,330 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 386 transitions. [2021-12-15 14:01:34,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-15 14:01:34,331 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:34,331 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:01:34,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-15 14:01:34,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-12-15 14:01:34,542 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:01:34,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:34,543 INFO L85 PathProgramCache]: Analyzing trace with hash -2058655426, now seen corresponding path program 1 times [2021-12-15 14:01:34,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:01:34,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377326913] [2021-12-15 14:01:34,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:34,543 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:01:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:34,684 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:01:34,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:01:34,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377326913] [2021-12-15 14:01:34,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377326913] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:01:34,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650262961] [2021-12-15 14:01:34,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:34,685 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:01:34,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:01:34,686 INFO L229 MonitoredProcess]: Starting monitored process 17 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:34,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-15 14:01:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:34,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-15 14:01:34,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:01:34,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 14:01:34,928 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:01:34,928 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:35,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:01:35,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 14:01:35,064 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 14:01:35,114 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:01:35,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:01:35,155 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:01:35,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2021-12-15 14:01:35,237 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3119 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3119) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) is different from false [2021-12-15 14:01:35,242 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:01:35,242 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 22 treesize of output 23 [2021-12-15 14:01:35,247 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:01:35,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 39 [2021-12-15 14:01:35,253 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 11 treesize of output 7 [2021-12-15 14:01:35,429 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:01:35,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650262961] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:01:35,429 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:01:35,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2021-12-15 14:01:35,430 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35651218] [2021-12-15 14:01:35,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:01:35,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-15 14:01:35,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:01:35,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-15 14:01:35,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=432, Unknown=1, NotChecked=42, Total=552 [2021-12-15 14:01:35,431 INFO L87 Difference]: Start difference. First operand 337 states and 386 transitions. Second operand has 24 states, 23 states have (on average 4.086956521739131) internal successors, (94), 24 states have internal predecessors, (94), 0 states have call successors, (0), 0 states 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:36,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:36,252 INFO L93 Difference]: Finished difference Result 438 states and 496 transitions. [2021-12-15 14:01:36,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-15 14:01:36,253 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.086956521739131) internal successors, (94), 24 states have internal predecessors, (94), 0 states have call successors, (0), 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 44 [2021-12-15 14:01:36,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:36,254 INFO L225 Difference]: With dead ends: 438 [2021-12-15 14:01:36,254 INFO L226 Difference]: Without dead ends: 438 [2021-12-15 14:01:36,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=400, Invalid=1583, Unknown=1, NotChecked=86, Total=2070 [2021-12-15 14:01:36,256 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 319 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 273 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:36,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 465 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 814 Invalid, 0 Unknown, 273 Unchecked, 0.4s Time] [2021-12-15 14:01:36,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-12-15 14:01:36,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 384. [2021-12-15 14:01:36,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 372 states have (on average 1.2150537634408602) internal successors, (452), 383 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:36,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 452 transitions. [2021-12-15 14:01:36,262 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 452 transitions. Word has length 44 [2021-12-15 14:01:36,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:36,263 INFO L470 AbstractCegarLoop]: Abstraction has 384 states and 452 transitions. [2021-12-15 14:01:36,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.086956521739131) internal successors, (94), 24 states have internal predecessors, (94), 0 states have call successors, (0), 0 states 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:36,263 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 452 transitions. [2021-12-15 14:01:36,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-15 14:01:36,265 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:36,266 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:01:36,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-15 14:01:36,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-12-15 14:01:36,483 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:01:36,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:36,483 INFO L85 PathProgramCache]: Analyzing trace with hash 489910956, now seen corresponding path program 1 times [2021-12-15 14:01:36,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:01:36,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974545931] [2021-12-15 14:01:36,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:36,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:01:36,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:36,574 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:01:36,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:01:36,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974545931] [2021-12-15 14:01:36,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974545931] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:01:36,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105421884] [2021-12-15 14:01:36,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:36,575 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:01:36,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:01:36,576 INFO L229 MonitoredProcess]: Starting monitored process 18 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:36,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-15 14:01:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:36,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 14:01:36,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:01:36,988 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-15 14:01:36,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:01:37,026 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:01:37,026 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 21 treesize of output 25 [2021-12-15 14:01:37,225 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-15 14:01:37,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105421884] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:01:37,225 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:01:37,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 10 [2021-12-15 14:01:37,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791278209] [2021-12-15 14:01:37,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:01:37,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-15 14:01:37,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:01:37,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-15 14:01:37,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-12-15 14:01:37,227 INFO L87 Difference]: Start difference. First operand 384 states and 452 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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:37,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:01:37,333 INFO L93 Difference]: Finished difference Result 385 states and 449 transitions. [2021-12-15 14:01:37,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 14:01:37,334 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 46 [2021-12-15 14:01:37,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:01:37,335 INFO L225 Difference]: With dead ends: 385 [2021-12-15 14:01:37,335 INFO L226 Difference]: Without dead ends: 385 [2021-12-15 14:01:37,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-12-15 14:01:37,335 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 143 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:01:37,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 145 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:01:37,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2021-12-15 14:01:37,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 359. [2021-12-15 14:01:37,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 347 states have (on average 1.2132564841498559) internal successors, (421), 358 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:37,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 421 transitions. [2021-12-15 14:01:37,339 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 421 transitions. Word has length 46 [2021-12-15 14:01:37,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:01:37,339 INFO L470 AbstractCegarLoop]: Abstraction has 359 states and 421 transitions. [2021-12-15 14:01:37,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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:37,339 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 421 transitions. [2021-12-15 14:01:37,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-15 14:01:37,340 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:01:37,340 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, 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:37,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-12-15 14:01:37,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-12-15 14:01:37,555 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-15 14:01:37,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:01:37,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1931630812, now seen corresponding path program 1 times [2021-12-15 14:01:37,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:01:37,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951603622] [2021-12-15 14:01:37,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:37,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:01:37,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:37,984 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:01:37,984 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:01:37,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951603622] [2021-12-15 14:01:37,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951603622] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:01:37,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126495889] [2021-12-15 14:01:37,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:01:37,984 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:01:37,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:01:37,987 INFO L229 MonitoredProcess]: Starting monitored process 19 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:37,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-15 14:01:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:01:38,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 90 conjunts are in the unsatisfiable core [2021-12-15 14:01:38,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:01:38,205 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:38,208 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:38,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:38,216 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-15 14:01:38,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:38,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-15 14:01:38,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:38,229 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-15 14:01:38,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:38,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-15 14:01:38,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:38,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:38,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:38,267 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:01:38,268 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2021-12-15 14:01:38,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:38,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:38,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:38,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-15 14:01:38,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:38,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:38,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:38,296 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:01:38,297 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2021-12-15 14:01:38,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:38,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:38,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:38,305 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-15 14:01:38,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:38,446 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-15 14:01:38,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 30 [2021-12-15 14:01:38,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:38,462 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-15 14:01:38,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2021-12-15 14:01:38,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:38,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:38,624 INFO L354 Elim1Store]: treesize reduction 54, result has 31.6 percent of original size [2021-12-15 14:01:38,624 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 66 treesize of output 68 [2021-12-15 14:01:38,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:38,657 INFO L354 Elim1Store]: treesize reduction 64, result has 39.6 percent of original size [2021-12-15 14:01:38,658 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 48 treesize of output 63 [2021-12-15 14:01:43,045 INFO L354 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2021-12-15 14:01:43,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 50 [2021-12-15 14:01:43,063 INFO L354 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2021-12-15 14:01:43,064 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 54 [2021-12-15 14:01:43,071 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 13 treesize of output 9 [2021-12-15 14:01:43,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:43,100 INFO L354 Elim1Store]: treesize reduction 13, result has 43.5 percent of original size [2021-12-15 14:01:43,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 23 [2021-12-15 14:01:43,159 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 5 treesize of output 3 [2021-12-15 14:01:43,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:43,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2021-12-15 14:01:43,323 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 14:01:43,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2021-12-15 14:01:43,336 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 14:01:43,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2021-12-15 14:01:43,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:43,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:43,394 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-15 14:01:43,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2021-12-15 14:01:43,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:43,529 INFO L354 Elim1Store]: treesize reduction 38, result has 40.6 percent of original size [2021-12-15 14:01:43,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 63 [2021-12-15 14:01:43,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:01:43,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2021-12-15 14:01:43,765 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:01:43,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2021-12-15 14:01:43,773 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:01:43,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 34 [2021-12-15 14:01:44,071 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:01:44,071 INFO L328 TraceCheckSpWp]: Computing backward predicates...