./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/mbpr3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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/AutomizerReach.xml -i ../sv-benchmarks/c/array-tiling/mbpr3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a50e57e46342104030586dde3ea26bc2e3984490f4fdef34fa383d24842d8980 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 10:08:18,792 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 10:08:18,795 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 10:08:18,842 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 10:08:18,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 10:08:18,844 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 10:08:18,845 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 10:08:18,848 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 10:08:18,849 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 10:08:18,854 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 10:08:18,854 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 10:08:18,856 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 10:08:18,857 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 10:08:18,858 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 10:08:18,859 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 10:08:18,862 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 10:08:18,863 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 10:08:18,864 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 10:08:18,866 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 10:08:18,871 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 10:08:18,873 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 10:08:18,874 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 10:08:18,874 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 10:08:18,875 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 10:08:18,877 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 10:08:18,880 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 10:08:18,880 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 10:08:18,880 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 10:08:18,881 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 10:08:18,882 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 10:08:18,883 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 10:08:18,883 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 10:08:18,885 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 10:08:18,885 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 10:08:18,886 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 10:08:18,886 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 10:08:18,887 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 10:08:18,887 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 10:08:18,887 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 10:08:18,888 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 10:08:18,889 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 10:08:18,891 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 10:08:18,892 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 10:08:18,920 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 10:08:18,921 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 10:08:18,921 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 10:08:18,922 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 10:08:18,922 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 10:08:18,923 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 10:08:18,923 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 10:08:18,923 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 10:08:18,923 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 10:08:18,924 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 10:08:18,924 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 10:08:18,925 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 10:08:18,925 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 10:08:18,925 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 10:08:18,925 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 10:08:18,925 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 10:08:18,925 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 10:08:18,926 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 10:08:18,926 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 10:08:18,926 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 10:08:18,926 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 10:08:18,926 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 10:08:18,926 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 10:08:18,927 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 10:08:18,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 10:08:18,927 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 10:08:18,927 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 10:08:18,927 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 10:08:18,928 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 10:08:18,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 10:08:18,928 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 10:08:18,928 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 10:08:18,929 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 10:08:18,929 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 ! call(reach_error())) ) 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 -> a50e57e46342104030586dde3ea26bc2e3984490f4fdef34fa383d24842d8980 [2022-07-13 10:08:19,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 10:08:19,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 10:08:19,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 10:08:19,238 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 10:08:19,239 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 10:08:19,240 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/mbpr3.c [2022-07-13 10:08:19,307 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ad5dfa19/d67e4083e3544f05900f5912fe5b1671/FLAG01be72244 [2022-07-13 10:08:19,720 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 10:08:19,724 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/mbpr3.c [2022-07-13 10:08:19,733 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ad5dfa19/d67e4083e3544f05900f5912fe5b1671/FLAG01be72244 [2022-07-13 10:08:19,756 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ad5dfa19/d67e4083e3544f05900f5912fe5b1671 [2022-07-13 10:08:19,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 10:08:19,760 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 10:08:19,763 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 10:08:19,764 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 10:08:19,767 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 10:08:19,767 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:08:19" (1/1) ... [2022-07-13 10:08:19,768 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58321d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:08:19, skipping insertion in model container [2022-07-13 10:08:19,769 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:08:19" (1/1) ... [2022-07-13 10:08:19,776 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 10:08:19,793 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 10:08:19,946 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/mbpr3.c[396,409] [2022-07-13 10:08:19,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 10:08:20,003 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 10:08:20,015 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/mbpr3.c[396,409] [2022-07-13 10:08:20,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 10:08:20,059 INFO L208 MainTranslator]: Completed translation [2022-07-13 10:08:20,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:08:20 WrapperNode [2022-07-13 10:08:20,060 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 10:08:20,062 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 10:08:20,062 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 10:08:20,062 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 10:08:20,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:08:20" (1/1) ... [2022-07-13 10:08:20,084 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:08:20" (1/1) ... [2022-07-13 10:08:20,116 INFO L137 Inliner]: procedures = 15, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 107 [2022-07-13 10:08:20,116 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 10:08:20,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 10:08:20,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 10:08:20,118 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 10:08:20,125 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:08:20" (1/1) ... [2022-07-13 10:08:20,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:08:20" (1/1) ... [2022-07-13 10:08:20,132 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:08:20" (1/1) ... [2022-07-13 10:08:20,133 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:08:20" (1/1) ... [2022-07-13 10:08:20,149 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:08:20" (1/1) ... [2022-07-13 10:08:20,154 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:08:20" (1/1) ... [2022-07-13 10:08:20,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:08:20" (1/1) ... [2022-07-13 10:08:20,162 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 10:08:20,166 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 10:08:20,167 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 10:08:20,167 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 10:08:20,168 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:08:20" (1/1) ... [2022-07-13 10:08:20,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 10:08:20,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:08:20,205 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) [2022-07-13 10:08:20,217 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 [2022-07-13 10:08:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 10:08:20,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 10:08:20,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 10:08:20,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 10:08:20,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 10:08:20,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 10:08:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 10:08:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 10:08:20,323 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 10:08:20,324 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 10:08:20,644 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 10:08:20,649 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 10:08:20,662 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-13 10:08:20,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:08:20 BoogieIcfgContainer [2022-07-13 10:08:20,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 10:08:20,666 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 10:08:20,666 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 10:08:20,669 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 10:08:20,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 10:08:19" (1/3) ... [2022-07-13 10:08:20,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe8f375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:08:20, skipping insertion in model container [2022-07-13 10:08:20,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:08:20" (2/3) ... [2022-07-13 10:08:20,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe8f375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:08:20, skipping insertion in model container [2022-07-13 10:08:20,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:08:20" (3/3) ... [2022-07-13 10:08:20,672 INFO L111 eAbstractionObserver]: Analyzing ICFG mbpr3.c [2022-07-13 10:08:20,689 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 10:08:20,690 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 10:08:20,743 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 10:08:20,753 INFO L357 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6e9f28ec, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@c74df49 [2022-07-13 10:08:20,753 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 10:08:20,759 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 32 states have (on average 1.53125) internal successors, (49), 33 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:08:20,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 10:08:20,765 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:08:20,766 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:08:20,767 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:08:20,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:08:20,773 INFO L85 PathProgramCache]: Analyzing trace with hash -565609025, now seen corresponding path program 1 times [2022-07-13 10:08:20,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:08:20,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235820376] [2022-07-13 10:08:20,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:08:20,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:08:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:08:20,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:08:20,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:08:20,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235820376] [2022-07-13 10:08:20,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235820376] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 10:08:20,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 10:08:20,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 10:08:20,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568176158] [2022-07-13 10:08:20,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 10:08:20,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 10:08:20,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:08:21,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 10:08:21,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 10:08:21,018 INFO L87 Difference]: Start difference. First operand has 34 states, 32 states have (on average 1.53125) internal successors, (49), 33 states have internal predecessors, (49), 0 states have call successors, (0), 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 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:08:21,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:08:21,038 INFO L93 Difference]: Finished difference Result 63 states and 90 transitions. [2022-07-13 10:08:21,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 10:08:21,041 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-13 10:08:21,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:08:21,047 INFO L225 Difference]: With dead ends: 63 [2022-07-13 10:08:21,047 INFO L226 Difference]: Without dead ends: 29 [2022-07-13 10:08:21,050 INFO L412 NwaCegarLoop]: 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 [2022-07-13 10:08:21,054 INFO L413 NwaCegarLoop]: 43 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, 43 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 [2022-07-13 10:08:21,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 10:08:21,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-13 10:08:21,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-07-13 10:08:21,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 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) [2022-07-13 10:08:21,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-07-13 10:08:21,083 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 17 [2022-07-13 10:08:21,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:08:21,083 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-07-13 10:08:21,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:08:21,095 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-07-13 10:08:21,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 10:08:21,096 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:08:21,096 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:08:21,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 10:08:21,097 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:08:21,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:08:21,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1539779609, now seen corresponding path program 1 times [2022-07-13 10:08:21,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:08:21,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352261000] [2022-07-13 10:08:21,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:08:21,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:08:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:08:21,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:08:21,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:08:21,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352261000] [2022-07-13 10:08:21,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352261000] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 10:08:21,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 10:08:21,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 10:08:21,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884599198] [2022-07-13 10:08:21,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 10:08:21,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 10:08:21,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:08:21,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 10:08:21,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 10:08:21,229 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:08:21,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:08:21,285 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-07-13 10:08:21,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 10:08:21,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-13 10:08:21,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:08:21,288 INFO L225 Difference]: With dead ends: 38 [2022-07-13 10:08:21,289 INFO L226 Difference]: Without dead ends: 36 [2022-07-13 10:08:21,290 INFO L412 NwaCegarLoop]: 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 [2022-07-13 10:08:21,291 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 10:08:21,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 98 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 10:08:21,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-13 10:08:21,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2022-07-13 10:08:21,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 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) [2022-07-13 10:08:21,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2022-07-13 10:08:21,306 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 17 [2022-07-13 10:08:21,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:08:21,307 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-07-13 10:08:21,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:08:21,308 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-07-13 10:08:21,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 10:08:21,310 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:08:21,311 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:08:21,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 10:08:21,311 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:08:21,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:08:21,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1539720027, now seen corresponding path program 1 times [2022-07-13 10:08:21,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:08:21,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595050994] [2022-07-13 10:08:21,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:08:21,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:08:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:08:21,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:08:21,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:08:21,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595050994] [2022-07-13 10:08:21,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595050994] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 10:08:21,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 10:08:21,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 10:08:21,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451658605] [2022-07-13 10:08:21,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 10:08:21,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 10:08:21,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:08:21,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 10:08:21,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-13 10:08:21,512 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:08:21,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:08:21,605 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2022-07-13 10:08:21,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 10:08:21,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-13 10:08:21,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:08:21,607 INFO L225 Difference]: With dead ends: 64 [2022-07-13 10:08:21,607 INFO L226 Difference]: Without dead ends: 43 [2022-07-13 10:08:21,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-13 10:08:21,608 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 86 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 10:08:21,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 23 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 10:08:21,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-13 10:08:21,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2022-07-13 10:08:21,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:08:21,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-07-13 10:08:21,615 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 17 [2022-07-13 10:08:21,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:08:21,615 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-07-13 10:08:21,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:08:21,616 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-07-13 10:08:21,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 10:08:21,617 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:08:21,617 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:08:21,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 10:08:21,617 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:08:21,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:08:21,618 INFO L85 PathProgramCache]: Analyzing trace with hash -2048606314, now seen corresponding path program 1 times [2022-07-13 10:08:21,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:08:21,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234455078] [2022-07-13 10:08:21,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:08:21,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:08:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:08:21,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 10:08:21,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:08:21,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234455078] [2022-07-13 10:08:21,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234455078] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 10:08:21,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 10:08:21,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 10:08:21,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875933735] [2022-07-13 10:08:21,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 10:08:21,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 10:08:21,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:08:21,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 10:08:21,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 10:08:21,702 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:08:21,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:08:21,715 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-07-13 10:08:21,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 10:08:21,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-13 10:08:21,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:08:21,717 INFO L225 Difference]: With dead ends: 49 [2022-07-13 10:08:21,717 INFO L226 Difference]: Without dead ends: 34 [2022-07-13 10:08:21,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 10:08:21,718 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 16 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 10:08:21,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 30 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 10:08:21,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-13 10:08:21,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-07-13 10:08:21,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:08:21,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-07-13 10:08:21,724 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 29 [2022-07-13 10:08:21,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:08:21,725 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-07-13 10:08:21,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:08:21,725 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-07-13 10:08:21,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 10:08:21,726 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:08:21,726 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:08:21,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 10:08:21,726 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:08:21,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:08:21,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1853333972, now seen corresponding path program 1 times [2022-07-13 10:08:21,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:08:21,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450063329] [2022-07-13 10:08:21,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:08:21,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:08:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:08:22,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:08:22,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:08:22,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450063329] [2022-07-13 10:08:22,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450063329] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:08:22,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710517857] [2022-07-13 10:08:22,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:08:22,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:08:22,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:08:22,081 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) [2022-07-13 10:08:22,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 10:08:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:08:22,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-13 10:08:22,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:08:22,253 INFO L390 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 16 treesize of output 12 [2022-07-13 10:08:22,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:22,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:22,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:22,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-13 10:08:22,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:22,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-07-13 10:08:22,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:22,368 INFO L390 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 23 [2022-07-13 10:08:22,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:22,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-07-13 10:08:22,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:22,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:22,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:22,448 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 10:08:22,449 INFO L390 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 37 treesize of output 32 [2022-07-13 10:08:22,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:08:22,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:08:22,968 INFO L390 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 13 [2022-07-13 10:08:22,973 INFO L390 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 28 treesize of output 26 [2022-07-13 10:08:22,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2022-07-13 10:08:22,997 INFO L390 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 55 treesize of output 51 [2022-07-13 10:08:23,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 10:08:23,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710517857] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:08:23,142 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 10:08:23,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 25 [2022-07-13 10:08:23,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579943194] [2022-07-13 10:08:23,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 10:08:23,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-13 10:08:23,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:08:23,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-13 10:08:23,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2022-07-13 10:08:23,145 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 25 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:08:24,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:08:24,109 INFO L93 Difference]: Finished difference Result 113 states and 134 transitions. [2022-07-13 10:08:24,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-13 10:08:24,111 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-13 10:08:24,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:08:24,114 INFO L225 Difference]: With dead ends: 113 [2022-07-13 10:08:24,114 INFO L226 Difference]: Without dead ends: 86 [2022-07-13 10:08:24,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 45 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=490, Invalid=1490, Unknown=0, NotChecked=0, Total=1980 [2022-07-13 10:08:24,117 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 322 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 10:08:24,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 78 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 330 Invalid, 0 Unknown, 1 Unchecked, 0.3s Time] [2022-07-13 10:08:24,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-13 10:08:24,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 50. [2022-07-13 10:08:24,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.183673469387755) internal successors, (58), 49 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:08:24,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2022-07-13 10:08:24,138 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 29 [2022-07-13 10:08:24,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:08:24,138 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2022-07-13 10:08:24,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:08:24,139 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2022-07-13 10:08:24,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-13 10:08:24,140 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:08:24,140 INFO L195 NwaCegarLoop]: 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] [2022-07-13 10:08:24,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 10:08:24,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:08:24,355 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:08:24,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:08:24,355 INFO L85 PathProgramCache]: Analyzing trace with hash -166695065, now seen corresponding path program 1 times [2022-07-13 10:08:24,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:08:24,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902956034] [2022-07-13 10:08:24,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:08:24,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:08:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:08:24,602 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:08:24,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:08:24,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902956034] [2022-07-13 10:08:24,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902956034] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:08:24,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589730711] [2022-07-13 10:08:24,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:08:24,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:08:24,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:08:24,607 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) [2022-07-13 10:08:24,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 10:08:24,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:08:24,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 10:08:24,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:08:24,755 INFO L390 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 16 treesize of output 12 [2022-07-13 10:08:24,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:24,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:24,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:24,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-13 10:08:24,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:24,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-07-13 10:08:24,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:24,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2022-07-13 10:08:24,983 INFO L390 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 [2022-07-13 10:08:24,997 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 10:08:24,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:08:25,158 INFO L390 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 17 treesize of output 15 [2022-07-13 10:08:25,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2022-07-13 10:08:25,223 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 10:08:25,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589730711] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:08:25,223 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 10:08:25,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2022-07-13 10:08:25,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649690964] [2022-07-13 10:08:25,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 10:08:25,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 10:08:25,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:08:25,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 10:08:25,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2022-07-13 10:08:25,226 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 19 states, 19 states have (on average 4.894736842105263) internal successors, (93), 19 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:08:25,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:08:25,555 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2022-07-13 10:08:25,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 10:08:25,555 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.894736842105263) internal successors, (93), 19 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-13 10:08:25,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:08:25,556 INFO L225 Difference]: With dead ends: 97 [2022-07-13 10:08:25,556 INFO L226 Difference]: Without dead ends: 60 [2022-07-13 10:08:25,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2022-07-13 10:08:25,557 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 169 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 10:08:25,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 86 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 10:08:25,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-13 10:08:25,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 48. [2022-07-13 10:08:25,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:08:25,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-07-13 10:08:25,571 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 35 [2022-07-13 10:08:25,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:08:25,571 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-07-13 10:08:25,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.894736842105263) internal successors, (93), 19 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:08:25,572 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-07-13 10:08:25,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-13 10:08:25,581 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:08:25,582 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:08:25,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 10:08:25,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-13 10:08:25,808 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:08:25,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:08:25,808 INFO L85 PathProgramCache]: Analyzing trace with hash -296121395, now seen corresponding path program 2 times [2022-07-13 10:08:25,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:08:25,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380476723] [2022-07-13 10:08:25,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:08:25,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:08:25,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:08:26,084 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 10:08:26,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:08:26,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380476723] [2022-07-13 10:08:26,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380476723] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:08:26,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683781235] [2022-07-13 10:08:26,085 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 10:08:26,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:08:26,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:08:26,087 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) [2022-07-13 10:08:26,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 10:08:26,151 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 10:08:26,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:08:26,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 10:08:26,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:08:26,504 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 10:08:26,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:08:26,718 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 10:08:26,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683781235] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:08:26,719 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 10:08:26,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 27 [2022-07-13 10:08:26,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31409440] [2022-07-13 10:08:26,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 10:08:26,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-13 10:08:26,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:08:26,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-13 10:08:26,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=518, Unknown=0, NotChecked=0, Total=702 [2022-07-13 10:08:26,721 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 27 states, 27 states have (on average 4.7407407407407405) internal successors, (128), 27 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:08:27,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:08:27,056 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2022-07-13 10:08:27,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 10:08:27,057 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.7407407407407405) internal successors, (128), 27 states have internal predecessors, (128), 0 states have call successors, (0), 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 47 [2022-07-13 10:08:27,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:08:27,057 INFO L225 Difference]: With dead ends: 136 [2022-07-13 10:08:27,058 INFO L226 Difference]: Without dead ends: 69 [2022-07-13 10:08:27,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=273, Invalid=719, Unknown=0, NotChecked=0, Total=992 [2022-07-13 10:08:27,059 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 300 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 10:08:27,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 132 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 10:08:27,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-13 10:08:27,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2022-07-13 10:08:27,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 59 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:08:27,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2022-07-13 10:08:27,067 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 47 [2022-07-13 10:08:27,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:08:27,067 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2022-07-13 10:08:27,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.7407407407407405) internal successors, (128), 27 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:08:27,067 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2022-07-13 10:08:27,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-13 10:08:27,068 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:08:27,068 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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] [2022-07-13 10:08:27,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 10:08:27,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:08:27,269 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:08:27,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:08:27,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1825837756, now seen corresponding path program 3 times [2022-07-13 10:08:27,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:08:27,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822516649] [2022-07-13 10:08:27,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:08:27,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:08:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:08:27,588 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 10:08:27,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:08:27,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822516649] [2022-07-13 10:08:27,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822516649] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:08:27,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057503359] [2022-07-13 10:08:27,589 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 10:08:27,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:08:27,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:08:27,591 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) [2022-07-13 10:08:27,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 10:08:27,742 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-13 10:08:27,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:08:27,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-13 10:08:27,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:08:27,804 INFO L390 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 16 treesize of output 12 [2022-07-13 10:08:27,841 INFO L356 Elim1Store]: treesize reduction 135, result has 15.6 percent of original size [2022-07-13 10:08:27,842 INFO L390 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 2 case distinctions, treesize of input 37 treesize of output 40 [2022-07-13 10:08:27,884 INFO L356 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-07-13 10:08:27,884 INFO L390 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 26 treesize of output 25 [2022-07-13 10:08:27,913 INFO L356 Elim1Store]: treesize reduction 162, result has 12.0 percent of original size [2022-07-13 10:08:27,914 INFO L390 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 37 [2022-07-13 10:08:28,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 10:08:28,080 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 10:08:28,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:08:30,219 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_73| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_73|)) (forall ((v_ArrVal_220 Int)) (< (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_73| 12) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_220) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 8)) |c_ULTIMATE.start_main_~MINVAL~0#1|)))) is different from false [2022-07-13 10:08:30,296 INFO L390 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 41 treesize of output 39 [2022-07-13 10:08:30,301 INFO L390 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 1720 treesize of output 1704 [2022-07-13 10:08:30,787 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 1 not checked. [2022-07-13 10:08:30,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057503359] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:08:30,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 10:08:30,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12] total 28 [2022-07-13 10:08:30,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905924431] [2022-07-13 10:08:30,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 10:08:30,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-13 10:08:30,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:08:30,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-13 10:08:30,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=565, Unknown=1, NotChecked=50, Total=756 [2022-07-13 10:08:30,789 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand has 28 states, 28 states have (on average 4.892857142857143) internal successors, (137), 28 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:08:32,928 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_73| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_73|)) (forall ((v_ArrVal_220 Int)) (< (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_73| 12) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_220) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 8)) |c_ULTIMATE.start_main_~MINVAL~0#1|)))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* 12 |c_ULTIMATE.start_main_~i~0#1|))) 0) (= (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|) 0)) is different from false [2022-07-13 10:08:34,967 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_73| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_73|)) (forall ((v_ArrVal_220 Int)) (< (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_73| 12) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_220) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 8)) |c_ULTIMATE.start_main_~MINVAL~0#1|)))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (<= (select .cse0 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 8)) 0) (<= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|) (= (select .cse0 8) 0) (not (= 8 (+ (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* 12 |c_ULTIMATE.start_main_~i~0#1|)))))) is different from false [2022-07-13 10:08:35,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:08:35,113 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2022-07-13 10:08:35,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 10:08:35,114 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.892857142857143) internal successors, (137), 28 states have internal predecessors, (137), 0 states have call successors, (0), 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 59 [2022-07-13 10:08:35,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:08:35,115 INFO L225 Difference]: With dead ends: 88 [2022-07-13 10:08:35,115 INFO L226 Difference]: Without dead ends: 78 [2022-07-13 10:08:35,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 109 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=193, Invalid=686, Unknown=3, NotChecked=174, Total=1056 [2022-07-13 10:08:35,116 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 166 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 10:08:35,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 174 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 388 Invalid, 0 Unknown, 119 Unchecked, 0.2s Time] [2022-07-13 10:08:35,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-13 10:08:35,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 60. [2022-07-13 10:08:35,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:08:35,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2022-07-13 10:08:35,130 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 59 [2022-07-13 10:08:35,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:08:35,130 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2022-07-13 10:08:35,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.892857142857143) internal successors, (137), 28 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:08:35,131 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-07-13 10:08:35,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-13 10:08:35,133 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:08:35,133 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 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] [2022-07-13 10:08:35,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 10:08:35,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:08:35,353 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:08:35,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:08:35,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1432810746, now seen corresponding path program 4 times [2022-07-13 10:08:35,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:08:35,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758846208] [2022-07-13 10:08:35,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:08:35,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:08:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:08:35,941 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 41 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 10:08:35,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:08:35,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758846208] [2022-07-13 10:08:35,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758846208] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:08:35,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418588450] [2022-07-13 10:08:35,942 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 10:08:35,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:08:35,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:08:35,944 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) [2022-07-13 10:08:35,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 10:08:36,033 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 10:08:36,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:08:36,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 57 conjunts are in the unsatisfiable core [2022-07-13 10:08:36,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:08:36,128 INFO L390 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 16 treesize of output 12 [2022-07-13 10:08:36,172 INFO L356 Elim1Store]: treesize reduction 84, result has 18.4 percent of original size [2022-07-13 10:08:36,173 INFO L390 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 2 case distinctions, treesize of input 28 treesize of output 31 [2022-07-13 10:08:36,226 INFO L356 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-07-13 10:08:36,227 INFO L390 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 26 treesize of output 25 [2022-07-13 10:08:36,252 INFO L356 Elim1Store]: treesize reduction 114, result has 16.2 percent of original size [2022-07-13 10:08:36,252 INFO L390 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 2 case distinctions, treesize of input 34 treesize of output 37 [2022-07-13 10:08:36,294 INFO L356 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2022-07-13 10:08:36,294 INFO L390 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 29 treesize of output 28 [2022-07-13 10:08:36,311 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-13 10:08:36,312 INFO L390 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 2 case distinctions, treesize of input 37 treesize of output 25 [2022-07-13 10:08:36,348 INFO L356 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-07-13 10:08:36,350 INFO L390 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 26 treesize of output 25 [2022-07-13 10:08:36,373 INFO L356 Elim1Store]: treesize reduction 114, result has 16.2 percent of original size [2022-07-13 10:08:36,374 INFO L390 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 2 case distinctions, treesize of input 34 treesize of output 37 [2022-07-13 10:08:36,410 INFO L356 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2022-07-13 10:08:36,410 INFO L390 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 29 treesize of output 28 [2022-07-13 10:08:36,452 INFO L356 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2022-07-13 10:08:36,453 INFO L390 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 3 case distinctions, treesize of input 43 treesize of output 34 [2022-07-13 10:08:36,719 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:08:36,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:08:37,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2022-07-13 10:08:37,491 INFO L390 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 67 treesize of output 59 [2022-07-13 10:08:37,505 INFO L390 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 17 treesize of output 15 [2022-07-13 10:08:37,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2022-07-13 10:08:37,655 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 10:08:37,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418588450] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:08:37,655 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 10:08:37,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 18] total 39 [2022-07-13 10:08:37,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797320938] [2022-07-13 10:08:37,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 10:08:37,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-13 10:08:37,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:08:37,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-13 10:08:37,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1267, Unknown=0, NotChecked=0, Total=1482 [2022-07-13 10:08:37,657 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 39 states, 39 states have (on average 4.3076923076923075) internal successors, (168), 39 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:08:39,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:08:39,261 INFO L93 Difference]: Finished difference Result 196 states and 213 transitions. [2022-07-13 10:08:39,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-07-13 10:08:39,262 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 4.3076923076923075) internal successors, (168), 39 states have internal predecessors, (168), 0 states have call successors, (0), 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 59 [2022-07-13 10:08:39,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:08:39,263 INFO L225 Difference]: With dead ends: 196 [2022-07-13 10:08:39,263 INFO L226 Difference]: Without dead ends: 186 [2022-07-13 10:08:39,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 111 SyntacticMatches, 21 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2148 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=942, Invalid=5700, Unknown=0, NotChecked=0, Total=6642 [2022-07-13 10:08:39,266 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 404 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 10:08:39,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 253 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 784 Invalid, 0 Unknown, 114 Unchecked, 0.5s Time] [2022-07-13 10:08:39,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-13 10:08:39,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 138. [2022-07-13 10:08:39,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 1.0875912408759123) internal successors, (149), 137 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:08:39,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2022-07-13 10:08:39,282 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 59 [2022-07-13 10:08:39,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:08:39,282 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2022-07-13 10:08:39,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 4.3076923076923075) internal successors, (168), 39 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:08:39,283 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2022-07-13 10:08:39,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-13 10:08:39,284 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:08:39,284 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 10:08:39,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 10:08:39,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:08:39,500 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:08:39,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:08:39,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1827793739, now seen corresponding path program 5 times [2022-07-13 10:08:39,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:08:39,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386137285] [2022-07-13 10:08:39,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:08:39,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:08:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:08:39,698 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-13 10:08:39,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:08:39,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386137285] [2022-07-13 10:08:39,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386137285] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:08:39,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850129743] [2022-07-13 10:08:39,698 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 10:08:39,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:08:39,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:08:39,700 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) [2022-07-13 10:08:39,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 10:08:40,092 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-13 10:08:40,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:08:40,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 10:08:40,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:08:40,238 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-13 10:08:40,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:08:40,510 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-13 10:08:40,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850129743] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:08:40,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 10:08:40,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 18 [2022-07-13 10:08:40,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516386265] [2022-07-13 10:08:40,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 10:08:40,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-13 10:08:40,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:08:40,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-13 10:08:40,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-07-13 10:08:40,513 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 18 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:08:40,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:08:40,901 INFO L93 Difference]: Finished difference Result 259 states and 281 transitions. [2022-07-13 10:08:40,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 10:08:40,902 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 18 states have internal predecessors, (84), 0 states have call successors, (0), 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 63 [2022-07-13 10:08:40,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:08:40,902 INFO L225 Difference]: With dead ends: 259 [2022-07-13 10:08:40,902 INFO L226 Difference]: Without dead ends: 189 [2022-07-13 10:08:40,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 118 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=527, Unknown=0, NotChecked=0, Total=702 [2022-07-13 10:08:40,904 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 157 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 10:08:40,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 141 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 10:08:40,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-07-13 10:08:40,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 160. [2022-07-13 10:08:40,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 1.0817610062893082) internal successors, (172), 159 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:08:40,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 172 transitions. [2022-07-13 10:08:40,921 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 172 transitions. Word has length 63 [2022-07-13 10:08:40,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:08:40,922 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 172 transitions. [2022-07-13 10:08:40,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 18 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:08:40,922 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 172 transitions. [2022-07-13 10:08:40,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 10:08:40,923 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:08:40,923 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 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] [2022-07-13 10:08:40,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-13 10:08:41,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:08:41,140 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:08:41,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:08:41,140 INFO L85 PathProgramCache]: Analyzing trace with hash 757222925, now seen corresponding path program 6 times [2022-07-13 10:08:41,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:08:41,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214425160] [2022-07-13 10:08:41,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:08:41,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:08:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:08:41,676 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:08:41,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:08:41,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214425160] [2022-07-13 10:08:41,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214425160] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:08:41,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833427076] [2022-07-13 10:08:41,677 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-13 10:08:41,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:08:41,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:08:41,681 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) [2022-07-13 10:08:41,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 10:08:41,791 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-07-13 10:08:41,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:08:41,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-13 10:08:41,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:08:41,897 INFO L390 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 16 treesize of output 12 [2022-07-13 10:08:41,940 INFO L356 Elim1Store]: treesize reduction 84, result has 18.4 percent of original size [2022-07-13 10:08:41,940 INFO L390 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 2 case distinctions, treesize of input 28 treesize of output 31 [2022-07-13 10:08:42,005 INFO L356 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-07-13 10:08:42,006 INFO L390 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 26 treesize of output 25 [2022-07-13 10:08:42,025 INFO L356 Elim1Store]: treesize reduction 114, result has 16.2 percent of original size [2022-07-13 10:08:42,025 INFO L390 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 2 case distinctions, treesize of input 34 treesize of output 37 [2022-07-13 10:08:42,064 INFO L356 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2022-07-13 10:08:42,065 INFO L390 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 29 treesize of output 28 [2022-07-13 10:08:42,110 INFO L356 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2022-07-13 10:08:42,111 INFO L390 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 4 case distinctions, treesize of input 43 treesize of output 34 [2022-07-13 10:08:42,467 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 10:08:42,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:08:42,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2022-07-13 10:08:42,999 INFO L390 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 67 treesize of output 59 [2022-07-13 10:08:43,256 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 10:08:43,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833427076] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:08:43,256 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 10:08:43,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 15] total 46 [2022-07-13 10:08:43,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862916358] [2022-07-13 10:08:43,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 10:08:43,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-13 10:08:43,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:08:43,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-13 10:08:43,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1864, Unknown=0, NotChecked=0, Total=2070 [2022-07-13 10:08:43,261 INFO L87 Difference]: Start difference. First operand 160 states and 172 transitions. Second operand has 46 states, 46 states have (on average 3.869565217391304) internal successors, (178), 46 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:08:47,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:08:47,645 INFO L93 Difference]: Finished difference Result 262 states and 287 transitions. [2022-07-13 10:08:47,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-07-13 10:08:47,645 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 3.869565217391304) internal successors, (178), 46 states have internal predecessors, (178), 0 states have call successors, (0), 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 65 [2022-07-13 10:08:47,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:08:47,646 INFO L225 Difference]: With dead ends: 262 [2022-07-13 10:08:47,646 INFO L226 Difference]: Without dead ends: 208 [2022-07-13 10:08:47,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 112 SyntacticMatches, 11 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4005 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1910, Invalid=12610, Unknown=0, NotChecked=0, Total=14520 [2022-07-13 10:08:47,649 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 1072 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 1415 mSolverCounterSat, 647 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 2156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 647 IncrementalHoareTripleChecker+Valid, 1415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 10:08:47,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1072 Valid, 239 Invalid, 2156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [647 Valid, 1415 Invalid, 0 Unknown, 94 Unchecked, 0.9s Time] [2022-07-13 10:08:47,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-13 10:08:47,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 133. [2022-07-13 10:08:47,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.0681818181818181) internal successors, (141), 132 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:08:47,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2022-07-13 10:08:47,664 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 65 [2022-07-13 10:08:47,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:08:47,664 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2022-07-13 10:08:47,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.869565217391304) internal successors, (178), 46 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:08:47,665 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2022-07-13 10:08:47,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-13 10:08:47,666 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:08:47,666 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:08:47,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 10:08:47,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:08:47,876 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:08:47,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:08:47,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1229247639, now seen corresponding path program 7 times [2022-07-13 10:08:47,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:08:47,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080449029] [2022-07-13 10:08:47,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:08:47,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:08:47,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:08:48,557 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 6 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:08:48,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:08:48,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080449029] [2022-07-13 10:08:48,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080449029] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:08:48,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322236608] [2022-07-13 10:08:48,557 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-13 10:08:48,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:08:48,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:08:48,559 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) [2022-07-13 10:08:48,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 10:08:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:08:48,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 75 conjunts are in the unsatisfiable core [2022-07-13 10:08:48,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:08:48,745 INFO L390 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 16 treesize of output 12 [2022-07-13 10:08:48,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:48,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:48,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:48,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 40 [2022-07-13 10:08:48,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:48,805 INFO L390 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 25 [2022-07-13 10:08:48,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:48,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:48,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:48,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2022-07-13 10:08:48,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:48,874 INFO L390 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 25 [2022-07-13 10:08:48,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:48,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:48,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:48,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2022-07-13 10:08:48,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:48,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-07-13 10:08:48,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:48,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 31 [2022-07-13 10:08:48,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:48,955 INFO L390 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 25 [2022-07-13 10:08:48,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:48,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:48,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:48,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2022-07-13 10:08:49,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:49,002 INFO L390 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 25 [2022-07-13 10:08:49,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:49,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:49,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:49,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2022-07-13 10:08:49,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:49,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-07-13 10:08:49,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:49,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:49,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:49,078 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 10:08:49,079 INFO L390 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 58 treesize of output 43 [2022-07-13 10:08:49,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:49,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:49,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:49,124 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 10:08:49,124 INFO L390 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 35 treesize of output 37 [2022-07-13 10:08:49,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:49,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:49,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:49,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:49,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:49,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:08:49,144 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 10:08:49,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 49 [2022-07-13 10:08:49,409 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 6 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:08:49,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:10:54,707 INFO L390 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 155 treesize of output 149 [2022-07-13 10:10:54,714 INFO L390 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 975 treesize of output 967 [2022-07-13 10:10:54,989 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 2 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:10:54,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322236608] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:10:54,990 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 10:10:54,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 25] total 51 [2022-07-13 10:10:54,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692388499] [2022-07-13 10:10:54,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 10:10:54,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-13 10:10:54,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:10:54,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-13 10:10:54,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=2100, Unknown=86, NotChecked=0, Total=2550 [2022-07-13 10:10:54,992 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand has 51 states, 51 states have (on average 4.019607843137255) internal successors, (205), 51 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:10:57,833 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (and (<= 7 |c_ULTIMATE.start_main_~CCCELVOL3~0#1|) (let ((.cse0 (select .cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)))) (or (= .cse0 0) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|) (= |c_ULTIMATE.start_main_~CCCELVOL3~0#1| (select .cse1 12)) (forall ((|v_ULTIMATE.start_main_~i~0#1_163| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_163|)) (forall ((v_ArrVal_599 Int) (v_ArrVal_575 Int) (v_ArrVal_573 Int) (v_ArrVal_571 Int) (|v_ULTIMATE.start_main_~i~0#1_155| Int) (v_ArrVal_580 Int) (v_ArrVal_567 Int) (v_ArrVal_578 Int) (v_ArrVal_600 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* 12 |v_ULTIMATE.start_main_~i~0#1_163|) (- 12) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_567)) (.cse4 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 12))) (let ((.cse2 (select (let ((.cse5 (* 12 |v_ULTIMATE.start_main_~i~0#1_155|))) (store (store (store (store (store (store (store .cse3 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4) v_ArrVal_571) |c_ULTIMATE.start_main_~#volArray~0#1.offset| v_ArrVal_573) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 8) v_ArrVal_575) .cse4 v_ArrVal_580) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20) v_ArrVal_578) (+ .cse5 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (- 8)) v_ArrVal_600) (+ .cse5 (- 12) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_599)) .cse4))) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse2) (= .cse2 0) (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_155|)) (not (<= (select .cse3 .cse4) v_ArrVal_580)))))))) (not (= (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* 12 |c_ULTIMATE.start_main_~i~0#1|)) 24)))) is different from false [2022-07-13 10:11:03,801 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (and (<= 7 (select .cse0 12)) (let ((.cse1 (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)))) (or (= .cse1 0) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse1))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_155| Int)) (or (forall ((v_ArrVal_599 Int) (v_ArrVal_600 Int)) (let ((.cse2 (select (let ((.cse3 (* 12 |v_ULTIMATE.start_main_~i~0#1_155|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (- 8)) v_ArrVal_600) (+ .cse3 (- 12) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_599)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 12)))) (or (= .cse2 0) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse2)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_155|)))) (= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|))) is different from false [2022-07-13 10:11:09,008 WARN L833 $PredicateComparison]: unable to prove that (and (<= 7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) 12)) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_155| Int)) (or (forall ((v_ArrVal_599 Int) (v_ArrVal_600 Int)) (let ((.cse0 (select (let ((.cse1 (* 12 |v_ULTIMATE.start_main_~i~0#1_155|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (- 8)) v_ArrVal_600) (+ .cse1 (- 12) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_599)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 12)))) (or (= .cse0 0) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_155|)))) (= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|)) is different from false [2022-07-13 10:11:11,025 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|)) (.cse1 (<= |c_ULTIMATE.start_main_~MINVAL~0#1| |c_ULTIMATE.start_main_~CCCELVOL3~0#1|))) (and (<= 7 (select .cse0 12)) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 1) .cse1) (let ((.cse2 (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)))) (or (= .cse2 0) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse2))) (or (<= 0 |c_ULTIMATE.start_main_~CCCELVOL3~0#1|) .cse1) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_155| Int)) (or (forall ((v_ArrVal_599 Int) (v_ArrVal_600 Int)) (let ((.cse3 (select (let ((.cse4 (* 12 |v_ULTIMATE.start_main_~i~0#1_155|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (- 8)) v_ArrVal_600) (+ .cse4 (- 12) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_599)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 12)))) (or (= .cse3 0) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse3)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_155|)))) (= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|))) is different from false [2022-07-13 10:11:19,105 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|)) (.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (<= 7 (select .cse0 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 12))) (<= 7 (select .cse0 12)) (let ((.cse1 (select .cse0 (+ .cse2 |c_ULTIMATE.start_main_~#volArray~0#1.offset|)))) (or (= .cse1 0) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse1))) (= 0 (select .cse0 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_155| Int)) (or (forall ((v_ArrVal_599 Int) (v_ArrVal_600 Int)) (let ((.cse3 (select (let ((.cse4 (* 12 |v_ULTIMATE.start_main_~i~0#1_155|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (- 8)) v_ArrVal_600) (+ .cse4 (- 12) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_599)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 12)))) (or (= .cse3 0) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse3)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_155|)))) (= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2) (let ((.cse5 (select .cse0 (+ .cse2 |c_ULTIMATE.start_main_~#volArray~0#1.offset| 8)))) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse5) (= 0 .cse5))) (not (= (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* 12 |c_ULTIMATE.start_main_~i~0#1|)) 24)))) is different from false [2022-07-13 10:11:19,686 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (and (<= 7 (select .cse0 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 12))) (<= 7 (select .cse0 12)) (= 0 (select .cse0 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2) (forall ((v_ArrVal_599 Int) (v_ArrVal_600 Int)) (let ((.cse1 (select (let ((.cse2 (* 12 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse2 (- 8)) v_ArrVal_600) (+ (- 12) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse2) v_ArrVal_599)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 12)))) (or (= .cse1 0) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse1)))) (forall ((v_ArrVal_599 Int) (|v_ULTIMATE.start_main_~i~0#1_155| Int) (v_ArrVal_600 Int)) (let ((.cse3 (select (let ((.cse4 (* 12 |v_ULTIMATE.start_main_~i~0#1_155|))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* 12 |c_ULTIMATE.start_main_~i~0#1|)) 0) (+ .cse4 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (- 8)) v_ArrVal_600) (+ .cse4 (- 12) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_599)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 12)))) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse3) (= .cse3 0) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_155|))))))) is different from false [2022-07-13 10:11:21,742 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_599 Int) (v_ArrVal_600 Int)) (let ((.cse0 (select (let ((.cse1 (* 12 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1 (- 8)) v_ArrVal_600) (+ (- 12) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1) v_ArrVal_599)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 12)))) (or (= .cse0 0) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0)))) (forall ((v_ArrVal_599 Int) (|v_ULTIMATE.start_main_~i~0#1_155| Int) (v_ArrVal_600 Int)) (let ((.cse2 (select (let ((.cse3 (* 12 |v_ULTIMATE.start_main_~i~0#1_155|))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* 12 |c_ULTIMATE.start_main_~i~0#1|)) 0) (+ .cse3 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (- 8)) v_ArrVal_600) (+ .cse3 (- 12) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_599)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 12)))) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse2) (= .cse2 0) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_155|)))))) is different from false [2022-07-13 10:12:44,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:12:44,619 INFO L93 Difference]: Finished difference Result 376 states and 407 transitions. [2022-07-13 10:12:44,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-07-13 10:12:44,620 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 4.019607843137255) internal successors, (205), 51 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2022-07-13 10:12:44,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:12:44,621 INFO L225 Difference]: With dead ends: 376 [2022-07-13 10:12:44,621 INFO L226 Difference]: Without dead ends: 354 [2022-07-13 10:12:44,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 143 SyntacticMatches, 25 SemanticMatches, 137 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 6347 ImplicationChecksByTransitivity, 234.0s TimeCoverageRelationStatistics Valid=2132, Invalid=15006, Unknown=182, NotChecked=1862, Total=19182 [2022-07-13 10:12:44,625 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 738 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 1209 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 2876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 1209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1317 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 10:12:44,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 310 Invalid, 2876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 1209 Invalid, 0 Unknown, 1317 Unchecked, 0.8s Time] [2022-07-13 10:12:44,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-07-13 10:12:44,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 194. [2022-07-13 10:12:44,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.077720207253886) internal successors, (208), 193 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) [2022-07-13 10:12:44,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 208 transitions. [2022-07-13 10:12:44,646 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 208 transitions. Word has length 71 [2022-07-13 10:12:44,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:12:44,646 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 208 transitions. [2022-07-13 10:12:44,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 4.019607843137255) internal successors, (205), 51 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:12:44,646 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 208 transitions. [2022-07-13 10:12:44,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-13 10:12:44,647 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:12:44,647 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 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] [2022-07-13 10:12:44,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 10:12:44,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-13 10:12:44,856 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:12:44,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:12:44,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1552195955, now seen corresponding path program 8 times [2022-07-13 10:12:44,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:12:44,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914264821] [2022-07-13 10:12:44,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:12:44,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:12:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:12:45,130 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 83 proven. 37 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 10:12:45,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:12:45,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914264821] [2022-07-13 10:12:45,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914264821] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:12:45,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275777857] [2022-07-13 10:12:45,130 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 10:12:45,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:12:45,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:12:45,132 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) [2022-07-13 10:12:45,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 10:12:45,211 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 10:12:45,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:12:45,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 10:12:45,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:12:45,693 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 114 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 10:12:45,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:12:45,990 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 114 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 10:12:45,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275777857] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:12:45,990 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 10:12:45,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 14] total 39 [2022-07-13 10:12:45,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112893079] [2022-07-13 10:12:45,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 10:12:45,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-13 10:12:45,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:12:45,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-13 10:12:45,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1115, Unknown=0, NotChecked=0, Total=1482 [2022-07-13 10:12:45,992 INFO L87 Difference]: Start difference. First operand 194 states and 208 transitions. Second operand has 39 states, 39 states have (on average 4.9743589743589745) internal successors, (194), 39 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:12:46,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:12:46,452 INFO L93 Difference]: Finished difference Result 251 states and 267 transitions. [2022-07-13 10:12:46,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 10:12:46,453 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 4.9743589743589745) internal successors, (194), 39 states have internal predecessors, (194), 0 states have call successors, (0), 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 77 [2022-07-13 10:12:46,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:12:46,455 INFO L225 Difference]: With dead ends: 251 [2022-07-13 10:12:46,455 INFO L226 Difference]: Without dead ends: 183 [2022-07-13 10:12:46,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 704 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=524, Invalid=1546, Unknown=0, NotChecked=0, Total=2070 [2022-07-13 10:12:46,457 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 474 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 10:12:46,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 213 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 10:12:46,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-07-13 10:12:46,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 174. [2022-07-13 10:12:46,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 173 states have (on average 1.0809248554913296) internal successors, (187), 173 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:12:46,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 187 transitions. [2022-07-13 10:12:46,472 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 187 transitions. Word has length 77 [2022-07-13 10:12:46,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:12:46,472 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 187 transitions. [2022-07-13 10:12:46,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 4.9743589743589745) internal successors, (194), 39 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:12:46,473 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 187 transitions. [2022-07-13 10:12:46,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-13 10:12:46,473 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:12:46,474 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:12:46,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-13 10:12:46,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-13 10:12:46,680 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:12:46,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:12:46,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1459606623, now seen corresponding path program 9 times [2022-07-13 10:12:46,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:12:46,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703103856] [2022-07-13 10:12:46,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:12:46,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:12:46,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:12:46,942 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-13 10:12:46,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:12:46,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703103856] [2022-07-13 10:12:46,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703103856] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:12:46,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324349506] [2022-07-13 10:12:46,943 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 10:12:46,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:12:46,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:12:46,944 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) [2022-07-13 10:12:46,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 10:12:47,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-13 10:12:47,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:12:47,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 85 conjunts are in the unsatisfiable core [2022-07-13 10:12:47,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:12:47,325 INFO L390 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 16 treesize of output 12 [2022-07-13 10:12:47,364 INFO L356 Elim1Store]: treesize reduction 135, result has 15.6 percent of original size [2022-07-13 10:12:47,364 INFO L390 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 2 case distinctions, treesize of input 37 treesize of output 40 [2022-07-13 10:12:47,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:12:47,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-07-13 10:12:47,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:12:47,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:12:47,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:12:47,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 40 [2022-07-13 10:12:47,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:12:47,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-07-13 10:12:47,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:12:47,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:12:47,632 INFO L356 Elim1Store]: treesize reduction 26, result has 40.9 percent of original size [2022-07-13 10:12:47,633 INFO L390 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 29 treesize of output 38 [2022-07-13 10:12:47,751 INFO L356 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2022-07-13 10:12:47,751 INFO L390 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 35 treesize of output 34 [2022-07-13 10:12:47,812 INFO L356 Elim1Store]: treesize reduction 129, result has 27.5 percent of original size [2022-07-13 10:12:47,813 INFO L390 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 4 case distinctions, treesize of input 55 treesize of output 73 [2022-07-13 10:12:47,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:12:47,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2022-07-13 10:12:48,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:12:48,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:12:48,017 INFO L356 Elim1Store]: treesize reduction 32, result has 40.7 percent of original size [2022-07-13 10:12:48,017 INFO L390 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 43 treesize of output 56 [2022-07-13 10:12:48,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:12:48,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2022-07-13 10:12:48,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:12:48,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:12:48,361 INFO L356 Elim1Store]: treesize reduction 32, result has 40.7 percent of original size [2022-07-13 10:12:48,362 INFO L390 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 43 treesize of output 56 [2022-07-13 10:12:48,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:12:48,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2022-07-13 10:12:48,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:12:48,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:12:48,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:12:48,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:12:48,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:12:48,577 INFO L356 Elim1Store]: treesize reduction 60, result has 16.7 percent of original size [2022-07-13 10:12:48,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 61 [2022-07-13 10:12:48,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:12:48,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:12:48,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:12:48,741 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 10:12:48,742 INFO L390 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 38 treesize of output 40 [2022-07-13 10:12:48,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:12:48,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:12:48,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:12:48,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:12:48,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:12:48,779 INFO L356 Elim1Store]: treesize reduction 60, result has 16.7 percent of original size [2022-07-13 10:12:48,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 64 treesize of output 52 [2022-07-13 10:12:49,363 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 8 proven. 77 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-13 10:12:49,363 INFO L328 TraceCheckSpWp]: Computing backward predicates...