./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/mbpr2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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/mbpr2.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 a98ea70d5d9f752732070144a56514c68e9571f139726211e2f0ade721d6c5f3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 09:45:37,806 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 09:45:37,807 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 09:45:37,829 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 09:45:37,830 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 09:45:37,831 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 09:45:37,835 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 09:45:37,837 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 09:45:37,838 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 09:45:37,842 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 09:45:37,843 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 09:45:37,844 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 09:45:37,845 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 09:45:37,846 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 09:45:37,847 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 09:45:37,848 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 09:45:37,849 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 09:45:37,850 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 09:45:37,853 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 09:45:37,856 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 09:45:37,858 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 09:45:37,858 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 09:45:37,859 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 09:45:37,859 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 09:45:37,861 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 09:45:37,863 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 09:45:37,863 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 09:45:37,863 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 09:45:37,864 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 09:45:37,865 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 09:45:37,865 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 09:45:37,865 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 09:45:37,866 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 09:45:37,867 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 09:45:37,867 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 09:45:37,869 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 09:45:37,869 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 09:45:37,869 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 09:45:37,869 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 09:45:37,869 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 09:45:37,870 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 09:45:37,871 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 09:45:37,872 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 09:45:37,900 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 09:45:37,901 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 09:45:37,902 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 09:45:37,902 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 09:45:37,902 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 09:45:37,903 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 09:45:37,903 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 09:45:37,903 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 09:45:37,903 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 09:45:37,904 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 09:45:37,904 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 09:45:37,904 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 09:45:37,905 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 09:45:37,905 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 09:45:37,905 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 09:45:37,905 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 09:45:37,905 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 09:45:37,905 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 09:45:37,906 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 09:45:37,906 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 09:45:37,906 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 09:45:37,907 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 09:45:37,907 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 09:45:37,907 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 09:45:37,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 09:45:37,908 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 09:45:37,908 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 09:45:37,908 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 09:45:37,908 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 09:45:37,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 09:45:37,908 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 09:45:37,909 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 09:45:37,909 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 09:45:37,909 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 -> a98ea70d5d9f752732070144a56514c68e9571f139726211e2f0ade721d6c5f3 [2022-07-22 09:45:38,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 09:45:38,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 09:45:38,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 09:45:38,138 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 09:45:38,139 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 09:45:38,140 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/mbpr2.c [2022-07-22 09:45:38,189 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e74c875a/9c74da87a27d427bae5d709e872cf475/FLAG525d082ce [2022-07-22 09:45:38,536 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 09:45:38,536 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/mbpr2.c [2022-07-22 09:45:38,542 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e74c875a/9c74da87a27d427bae5d709e872cf475/FLAG525d082ce [2022-07-22 09:45:38,555 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e74c875a/9c74da87a27d427bae5d709e872cf475 [2022-07-22 09:45:38,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 09:45:38,558 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 09:45:38,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 09:45:38,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 09:45:38,561 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 09:45:38,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:45:38" (1/1) ... [2022-07-22 09:45:38,563 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34aa284e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:45:38, skipping insertion in model container [2022-07-22 09:45:38,563 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:45:38" (1/1) ... [2022-07-22 09:45:38,568 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 09:45:38,587 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 09:45:38,733 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/mbpr2.c[396,409] [2022-07-22 09:45:38,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 09:45:38,770 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 09:45:38,780 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/mbpr2.c[396,409] [2022-07-22 09:45:38,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 09:45:38,809 INFO L208 MainTranslator]: Completed translation [2022-07-22 09:45:38,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:45:38 WrapperNode [2022-07-22 09:45:38,810 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 09:45:38,811 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 09:45:38,811 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 09:45:38,811 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 09:45:38,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:45:38" (1/1) ... [2022-07-22 09:45:38,829 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:45:38" (1/1) ... [2022-07-22 09:45:38,853 INFO L137 Inliner]: procedures = 15, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 83 [2022-07-22 09:45:38,853 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 09:45:38,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 09:45:38,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 09:45:38,854 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 09:45:38,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:45:38" (1/1) ... [2022-07-22 09:45:38,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:45:38" (1/1) ... [2022-07-22 09:45:38,864 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:45:38" (1/1) ... [2022-07-22 09:45:38,865 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:45:38" (1/1) ... [2022-07-22 09:45:38,868 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:45:38" (1/1) ... [2022-07-22 09:45:38,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:45:38" (1/1) ... [2022-07-22 09:45:38,871 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:45:38" (1/1) ... [2022-07-22 09:45:38,872 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 09:45:38,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 09:45:38,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 09:45:38,877 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 09:45:38,878 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:45:38" (1/1) ... [2022-07-22 09:45:38,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 09:45:38,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:45:38,903 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-22 09:45:38,917 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-22 09:45:38,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 09:45:38,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 09:45:38,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 09:45:38,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 09:45:38,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 09:45:38,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 09:45:38,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 09:45:38,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 09:45:38,983 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 09:45:38,984 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 09:45:39,122 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 09:45:39,126 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 09:45:39,126 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 09:45:39,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:45:39 BoogieIcfgContainer [2022-07-22 09:45:39,127 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 09:45:39,129 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 09:45:39,129 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 09:45:39,151 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 09:45:39,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 09:45:38" (1/3) ... [2022-07-22 09:45:39,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73500cf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:45:39, skipping insertion in model container [2022-07-22 09:45:39,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:45:38" (2/3) ... [2022-07-22 09:45:39,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73500cf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:45:39, skipping insertion in model container [2022-07-22 09:45:39,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:45:39" (3/3) ... [2022-07-22 09:45:39,155 INFO L111 eAbstractionObserver]: Analyzing ICFG mbpr2.c [2022-07-22 09:45:39,164 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 09:45:39,164 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 09:45:39,191 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 09:45:39,196 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@fa9c08c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@16ed7898 [2022-07-22 09:45:39,196 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 09:45:39,200 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 28 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-22 09:45:39,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-22 09:45:39,203 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:45:39,204 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 09:45:39,204 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:45:39,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:45:39,208 INFO L85 PathProgramCache]: Analyzing trace with hash -669443655, now seen corresponding path program 1 times [2022-07-22 09:45:39,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:45:39,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384024429] [2022-07-22 09:45:39,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:45:39,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:45:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:45:39,313 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-22 09:45:39,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:45:39,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384024429] [2022-07-22 09:45:39,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384024429] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 09:45:39,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 09:45:39,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 09:45:39,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107473460] [2022-07-22 09:45:39,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 09:45:39,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 09:45:39,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:45:39,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 09:45:39,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 09:45:39,343 INFO L87 Difference]: Start difference. First operand has 29 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 28 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) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:45:39,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:45:39,357 INFO L93 Difference]: Finished difference Result 53 states and 74 transitions. [2022-07-22 09:45:39,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 09:45:39,359 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-22 09:45:39,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:45:39,363 INFO L225 Difference]: With dead ends: 53 [2022-07-22 09:45:39,364 INFO L226 Difference]: Without dead ends: 24 [2022-07-22 09:45:39,365 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-22 09:45:39,369 INFO L413 NwaCegarLoop]: 36 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, 36 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-22 09:45:39,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 09:45:39,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-22 09:45:39,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-07-22 09:45:39,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 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-22 09:45:39,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2022-07-22 09:45:39,393 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 15 [2022-07-22 09:45:39,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:45:39,393 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2022-07-22 09:45:39,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:45:39,394 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-07-22 09:45:39,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-22 09:45:39,395 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:45:39,395 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 09:45:39,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 09:45:39,396 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:45:39,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:45:39,396 INFO L85 PathProgramCache]: Analyzing trace with hash -893920799, now seen corresponding path program 1 times [2022-07-22 09:45:39,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:45:39,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526990168] [2022-07-22 09:45:39,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:45:39,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:45:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:45:39,503 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-22 09:45:39,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:45:39,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526990168] [2022-07-22 09:45:39,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526990168] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 09:45:39,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 09:45:39,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 09:45:39,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51545607] [2022-07-22 09:45:39,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 09:45:39,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 09:45:39,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:45:39,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 09:45:39,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 09:45:39,506 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:45:39,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:45:39,543 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-07-22 09:45:39,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 09:45:39,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-22 09:45:39,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:45:39,545 INFO L225 Difference]: With dead ends: 33 [2022-07-22 09:45:39,545 INFO L226 Difference]: Without dead ends: 31 [2022-07-22 09:45:39,548 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-22 09:45:39,550 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 9 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 77 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-22 09:45:39,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 77 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 09:45:39,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-22 09:45:39,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2022-07-22 09:45:39,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:45:39,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-07-22 09:45:39,558 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 15 [2022-07-22 09:45:39,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:45:39,559 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-07-22 09:45:39,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:45:39,562 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-07-22 09:45:39,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-22 09:45:39,562 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:45:39,563 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 09:45:39,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 09:45:39,563 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:45:39,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:45:39,564 INFO L85 PathProgramCache]: Analyzing trace with hash -893861217, now seen corresponding path program 1 times [2022-07-22 09:45:39,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:45:39,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679466789] [2022-07-22 09:45:39,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:45:39,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:45:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:45:39,703 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-22 09:45:39,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:45:39,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679466789] [2022-07-22 09:45:39,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679466789] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 09:45:39,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 09:45:39,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 09:45:39,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795892060] [2022-07-22 09:45:39,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 09:45:39,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 09:45:39,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:45:39,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 09:45:39,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-22 09:45:39,705 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:45:39,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:45:39,782 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-07-22 09:45:39,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 09:45:39,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-22 09:45:39,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:45:39,783 INFO L225 Difference]: With dead ends: 50 [2022-07-22 09:45:39,783 INFO L226 Difference]: Without dead ends: 34 [2022-07-22 09:45:39,784 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-22 09:45:39,784 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 56 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 09:45:39,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 22 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 09:45:39,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-22 09:45:39,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2022-07-22 09:45:39,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 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-22 09:45:39,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-07-22 09:45:39,790 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 15 [2022-07-22 09:45:39,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:45:39,791 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-07-22 09:45:39,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:45:39,791 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-07-22 09:45:39,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-22 09:45:39,792 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:45:39,792 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] [2022-07-22 09:45:39,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 09:45:39,792 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:45:39,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:45:39,795 INFO L85 PathProgramCache]: Analyzing trace with hash -815951211, now seen corresponding path program 1 times [2022-07-22 09:45:39,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:45:39,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116751563] [2022-07-22 09:45:39,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:45:39,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:45:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:45:39,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 09:45:39,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:45:39,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116751563] [2022-07-22 09:45:39,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116751563] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 09:45:39,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 09:45:39,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 09:45:39,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094489458] [2022-07-22 09:45:39,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 09:45:39,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 09:45:39,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:45:39,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 09:45:39,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 09:45:39,850 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:45:39,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:45:39,865 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-07-22 09:45:39,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 09:45:39,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-22 09:45:39,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:45:39,869 INFO L225 Difference]: With dead ends: 43 [2022-07-22 09:45:39,869 INFO L226 Difference]: Without dead ends: 28 [2022-07-22 09:45:39,869 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-22 09:45:39,871 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 15 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 09:45:39,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 25 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 09:45:39,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-22 09:45:39,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-22 09:45:39,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:45:39,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-22 09:45:39,881 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 23 [2022-07-22 09:45:39,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:45:39,881 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-22 09:45:39,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:45:39,881 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-22 09:45:39,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-22 09:45:39,882 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:45:39,882 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] [2022-07-22 09:45:39,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 09:45:39,882 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:45:39,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:45:39,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1208978221, now seen corresponding path program 1 times [2022-07-22 09:45:39,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:45:39,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756232614] [2022-07-22 09:45:39,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:45:39,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:45:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:45:40,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 09:45:40,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:45:40,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756232614] [2022-07-22 09:45:40,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756232614] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:45:40,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856573405] [2022-07-22 09:45:40,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:45:40,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:45:40,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:45:40,112 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-22 09:45:40,113 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-22 09:45:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:45:40,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-22 09:45:40,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:45:40,259 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-22 09:45:40,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:45:40,307 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 21 treesize of output 20 [2022-07-22 09:45:40,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:45:40,355 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-22 09:45:40,372 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 0 case distinctions, treesize of input 26 treesize of output 14 [2022-07-22 09:45:40,435 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-22 09:45:40,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 09:45:40,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 09:45:40,570 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-22 09:45:40,574 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-22 09:45:40,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 09:45:40,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856573405] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 09:45:40,615 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 09:45:40,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2022-07-22 09:45:40,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849158916] [2022-07-22 09:45:40,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 09:45:40,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-22 09:45:40,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:45:40,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-22 09:45:40,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-07-22 09:45:40,617 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 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-22 09:45:40,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:45:40,838 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2022-07-22 09:45:40,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 09:45:40,838 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 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) Word has length 23 [2022-07-22 09:45:40,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:45:40,841 INFO L225 Difference]: With dead ends: 73 [2022-07-22 09:45:40,841 INFO L226 Difference]: Without dead ends: 52 [2022-07-22 09:45:40,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2022-07-22 09:45:40,843 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 153 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 09:45:40,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 76 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 09:45:40,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-22 09:45:40,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 30. [2022-07-22 09:45:40,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 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-22 09:45:40,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-07-22 09:45:40,853 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 23 [2022-07-22 09:45:40,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:45:40,853 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-07-22 09:45:40,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 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-22 09:45:40,854 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-07-22 09:45:40,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-22 09:45:40,854 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:45:40,854 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] [2022-07-22 09:45:40,873 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-22 09:45:41,067 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-22 09:45:41,068 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:45:41,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:45:41,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1368311994, now seen corresponding path program 1 times [2022-07-22 09:45:41,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:45:41,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479677645] [2022-07-22 09:45:41,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:45:41,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:45:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:45:41,157 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 09:45:41,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:45:41,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479677645] [2022-07-22 09:45:41,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479677645] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:45:41,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766993486] [2022-07-22 09:45:41,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:45:41,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:45:41,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:45:41,160 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-22 09:45:41,161 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-22 09:45:41,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:45:41,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-22 09:45:41,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:45:41,210 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-22 09:45:41,223 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-22 09:45:41,223 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 21 treesize of output 20 [2022-07-22 09:45:41,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 09:45:41,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 09:45:41,297 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-22 09:45:41,299 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 30 treesize of output 26 [2022-07-22 09:45:41,304 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 09:45:41,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766993486] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 09:45:41,304 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 09:45:41,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 11 [2022-07-22 09:45:41,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942253442] [2022-07-22 09:45:41,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 09:45:41,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 09:45:41,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:45:41,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 09:45:41,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-22 09:45:41,306 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 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-22 09:45:41,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:45:41,465 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-07-22 09:45:41,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 09:45:41,466 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 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-22 09:45:41,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:45:41,466 INFO L225 Difference]: With dead ends: 56 [2022-07-22 09:45:41,466 INFO L226 Difference]: Without dead ends: 54 [2022-07-22 09:45:41,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 52 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-07-22 09:45:41,467 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 56 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 09:45:41,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 91 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 09:45:41,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-22 09:45:41,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 36. [2022-07-22 09:45:41,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 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-22 09:45:41,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-07-22 09:45:41,471 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 29 [2022-07-22 09:45:41,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:45:41,471 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-07-22 09:45:41,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 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-22 09:45:41,472 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-07-22 09:45:41,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-22 09:45:41,472 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:45:41,472 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 09:45:41,489 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-22 09:45:41,687 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-22 09:45:41,688 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:45:41,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:45:41,688 INFO L85 PathProgramCache]: Analyzing trace with hash 21305209, now seen corresponding path program 2 times [2022-07-22 09:45:41,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:45:41,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558907580] [2022-07-22 09:45:41,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:45:41,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:45:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:45:41,862 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 09:45:41,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:45:41,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558907580] [2022-07-22 09:45:41,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558907580] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:45:41,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011262951] [2022-07-22 09:45:41,863 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 09:45:41,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:45:41,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:45:41,876 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-22 09:45:41,877 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-22 09:45:41,920 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 09:45:41,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 09:45:41,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 09:45:41,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:45:42,179 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 09:45:42,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 09:45:42,292 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 09:45:42,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011262951] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 09:45:42,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 09:45:42,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 25 [2022-07-22 09:45:42,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659598272] [2022-07-22 09:45:42,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 09:45:42,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-22 09:45:42,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:45:42,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-22 09:45:42,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2022-07-22 09:45:42,294 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 25 states, 25 states have (on average 3.72) internal successors, (93), 25 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-22 09:45:42,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:45:42,497 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2022-07-22 09:45:42,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 09:45:42,498 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.72) internal successors, (93), 25 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-22 09:45:42,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:45:42,499 INFO L225 Difference]: With dead ends: 97 [2022-07-22 09:45:42,499 INFO L226 Difference]: Without dead ends: 54 [2022-07-22 09:45:42,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=251, Invalid=619, Unknown=0, NotChecked=0, Total=870 [2022-07-22 09:45:42,500 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 335 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 09:45:42,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 81 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 09:45:42,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-22 09:45:42,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 44. [2022-07-22 09:45:42,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 0 states have call successors, (0), 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-22 09:45:42,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-07-22 09:45:42,505 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 35 [2022-07-22 09:45:42,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:45:42,505 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-07-22 09:45:42,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.72) internal successors, (93), 25 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-22 09:45:42,506 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-07-22 09:45:42,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-22 09:45:42,506 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:45:42,507 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-22 09:45:42,525 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-22 09:45:42,723 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-22 09:45:42,724 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:45:42,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:45:42,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1279882925, now seen corresponding path program 3 times [2022-07-22 09:45:42,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:45:42,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586250473] [2022-07-22 09:45:42,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:45:42,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:45:42,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:45:42,852 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 09:45:42,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:45:42,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586250473] [2022-07-22 09:45:42,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586250473] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:45:42,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350990017] [2022-07-22 09:45:42,853 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 09:45:42,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:45:42,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:45:42,854 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-22 09:45:42,855 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-22 09:45:42,926 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-22 09:45:42,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 09:45:42,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-22 09:45:42,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:45:43,003 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-22 09:45:43,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:45:43,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, 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-22 09:45:43,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:45:43,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, 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-22 09:45:43,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:45:43,075 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-22 09:45:43,162 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-22 09:45:43,177 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-22 09:45:43,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 09:45:45,287 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_52| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_52|)) (forall ((v_ArrVal_129 Int)) (< (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 8) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_129) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)) |c_ULTIMATE.start_main_~MINVAL~0#1|)))) is different from false [2022-07-22 09:45:45,748 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 33 treesize of output 31 [2022-07-22 09:45:45,751 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 856 treesize of output 840 [2022-07-22 09:45:45,885 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 1 not checked. [2022-07-22 09:45:45,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350990017] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 09:45:45,885 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 09:45:45,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 25 [2022-07-22 09:45:45,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49025395] [2022-07-22 09:45:45,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 09:45:45,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-22 09:45:45,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:45:45,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-22 09:45:45,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=443, Unknown=2, NotChecked=44, Total=600 [2022-07-22 09:45:45,887 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 25 states, 25 states have (on average 3.88) internal successors, (97), 25 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:45:47,978 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) .cse1))) (and (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (= .cse0 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_52| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_52|)) (forall ((v_ArrVal_129 Int)) (< (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 8) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_129) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)) |c_ULTIMATE.start_main_~MINVAL~0#1|)))) (<= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|) (= (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4) .cse1) (<= .cse0 0) (= |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-07-22 09:45:50,008 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) .cse0))) (and (= |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|) (not (= .cse0 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) (forall ((|v_ULTIMATE.start_main_~i~0#1_52| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_52|)) (forall ((v_ArrVal_129 Int)) (< (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 8) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_129) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)) |c_ULTIMATE.start_main_~MINVAL~0#1|)))) (<= .cse1 0) (<= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|) (= .cse1 0)))) is different from false [2022-07-22 09:45:50,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:45:50,150 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-07-22 09:45:50,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 09:45:50,150 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.88) internal successors, (97), 25 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-07-22 09:45:50,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:45:50,151 INFO L225 Difference]: With dead ends: 65 [2022-07-22 09:45:50,151 INFO L226 Difference]: Without dead ends: 55 [2022-07-22 09:45:50,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=238, Invalid=826, Unknown=4, NotChecked=192, Total=1260 [2022-07-22 09:45:50,152 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 77 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 09:45:50,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 122 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 206 Invalid, 0 Unknown, 63 Unchecked, 0.1s Time] [2022-07-22 09:45:50,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-22 09:45:50,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 44. [2022-07-22 09:45:50,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 states have internal predecessors, (47), 0 states have call successors, (0), 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-22 09:45:50,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2022-07-22 09:45:50,158 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 43 [2022-07-22 09:45:50,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:45:50,158 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2022-07-22 09:45:50,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.88) internal successors, (97), 25 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:45:50,158 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-07-22 09:45:50,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-22 09:45:50,160 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:45:50,160 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-22 09:45:50,166 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-22 09:45:50,363 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-22 09:45:50,363 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:45:50,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:45:50,364 INFO L85 PathProgramCache]: Analyzing trace with hash 886855915, now seen corresponding path program 4 times [2022-07-22 09:45:50,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:45:50,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325905357] [2022-07-22 09:45:50,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:45:50,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:45:50,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:45:50,677 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 09:45:50,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:45:50,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325905357] [2022-07-22 09:45:50,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325905357] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:45:50,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773616954] [2022-07-22 09:45:50,678 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 09:45:50,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:45:50,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:45:50,679 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-22 09:45:50,680 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-22 09:45:50,725 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 09:45:50,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 09:45:50,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-22 09:45:50,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:45:50,797 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-22 09:45:50,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:45:50,817 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 23 treesize of output 22 [2022-07-22 09:45:50,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:45:50,866 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-22 09:45:50,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:45:50,879 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-22 09:45:50,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:45:50,904 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-22 09:45:50,912 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 0 case distinctions, treesize of input 32 treesize of output 16 [2022-07-22 09:45:51,015 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-22 09:45:51,026 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 09:45:51,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 09:45:51,240 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-22 09:45:51,243 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-22 09:45:51,318 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 09:45:51,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773616954] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 09:45:51,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 09:45:51,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 27 [2022-07-22 09:45:51,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696821994] [2022-07-22 09:45:51,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 09:45:51,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-22 09:45:51,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:45:51,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-22 09:45:51,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2022-07-22 09:45:51,321 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 27 states, 27 states have (on average 4.296296296296297) internal successors, (116), 27 states have internal predecessors, (116), 0 states have call successors, (0), 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-22 09:45:51,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:45:51,607 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2022-07-22 09:45:51,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 09:45:51,608 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.296296296296297) internal successors, (116), 27 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-07-22 09:45:51,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:45:51,608 INFO L225 Difference]: With dead ends: 71 [2022-07-22 09:45:51,608 INFO L226 Difference]: Without dead ends: 61 [2022-07-22 09:45:51,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 70 SyntacticMatches, 11 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2022-07-22 09:45:51,609 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 169 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 09:45:51,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 142 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 331 Invalid, 0 Unknown, 33 Unchecked, 0.2s Time] [2022-07-22 09:45:51,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-22 09:45:51,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 50. [2022-07-22 09:45:51,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 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-22 09:45:51,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2022-07-22 09:45:51,614 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 43 [2022-07-22 09:45:51,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:45:51,614 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2022-07-22 09:45:51,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.296296296296297) internal successors, (116), 27 states have internal predecessors, (116), 0 states have call successors, (0), 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-22 09:45:51,614 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-07-22 09:45:51,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-22 09:45:51,614 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:45:51,614 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2022-07-22 09:45:51,633 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-22 09:45:51,815 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-22 09:45:51,815 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:45:51,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:45:51,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1854428834, now seen corresponding path program 5 times [2022-07-22 09:45:51,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:45:51,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622276343] [2022-07-22 09:45:51,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:45:51,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:45:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:45:52,081 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 09:45:52,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:45:52,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622276343] [2022-07-22 09:45:52,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622276343] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:45:52,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545968454] [2022-07-22 09:45:52,082 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 09:45:52,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:45:52,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:45:52,083 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-22 09:45:52,091 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-22 09:45:52,165 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-22 09:45:52,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 09:45:52,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-22 09:45:52,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:45:52,189 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-22 09:45:52,210 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-22 09:45:52,211 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 23 treesize of output 22 [2022-07-22 09:45:52,330 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 09:45:52,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 09:45:52,436 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-22 09:45:52,437 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 30 treesize of output 26 [2022-07-22 09:45:52,454 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 09:45:52,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545968454] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 09:45:52,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 09:45:52,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 29 [2022-07-22 09:45:52,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695000462] [2022-07-22 09:45:52,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 09:45:52,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-22 09:45:52,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:45:52,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-22 09:45:52,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2022-07-22 09:45:52,456 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:45:53,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:45:53,489 INFO L93 Difference]: Finished difference Result 174 states and 191 transitions. [2022-07-22 09:45:53,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-07-22 09:45:53,490 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-07-22 09:45:53,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:45:53,491 INFO L225 Difference]: With dead ends: 174 [2022-07-22 09:45:53,491 INFO L226 Difference]: Without dead ends: 145 [2022-07-22 09:45:53,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 82 SyntacticMatches, 6 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1605 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=800, Invalid=4312, Unknown=0, NotChecked=0, Total=5112 [2022-07-22 09:45:53,493 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 356 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 09:45:53,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 208 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 09:45:53,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-22 09:45:53,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 70. [2022-07-22 09:45:53,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 69 states have internal predecessors, (75), 0 states have call successors, (0), 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-22 09:45:53,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2022-07-22 09:45:53,499 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 49 [2022-07-22 09:45:53,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:45:53,500 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2022-07-22 09:45:53,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:45:53,500 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-07-22 09:45:53,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-22 09:45:53,501 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:45:53,501 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 09:45:53,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-22 09:45:53,715 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-22 09:45:53,715 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:45:53,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:45:53,716 INFO L85 PathProgramCache]: Analyzing trace with hash -2084333679, now seen corresponding path program 6 times [2022-07-22 09:45:53,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:45:53,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288532193] [2022-07-22 09:45:53,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:45:53,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:45:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:45:53,915 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 33 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 09:45:53,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:45:53,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288532193] [2022-07-22 09:45:53,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288532193] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:45:53,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141212254] [2022-07-22 09:45:53,916 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-22 09:45:53,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:45:53,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:45:53,917 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-22 09:45:53,918 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-22 09:45:53,979 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-07-22 09:45:53,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 09:45:53,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-22 09:45:53,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:45:54,331 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 52 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 09:45:54,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 09:45:54,491 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 52 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 09:45:54,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141212254] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 09:45:54,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 09:45:54,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 33 [2022-07-22 09:45:54,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792137145] [2022-07-22 09:45:54,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 09:45:54,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-22 09:45:54,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:45:54,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-22 09:45:54,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=793, Unknown=0, NotChecked=0, Total=1056 [2022-07-22 09:45:54,494 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 33 states, 33 states have (on average 4.242424242424242) internal successors, (140), 33 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:45:54,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:45:54,746 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2022-07-22 09:45:54,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-22 09:45:54,746 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 4.242424242424242) internal successors, (140), 33 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-07-22 09:45:54,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:45:54,747 INFO L225 Difference]: With dead ends: 117 [2022-07-22 09:45:54,747 INFO L226 Difference]: Without dead ends: 70 [2022-07-22 09:45:54,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=418, Invalid=1142, Unknown=0, NotChecked=0, Total=1560 [2022-07-22 09:45:54,748 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 376 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 09:45:54,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 167 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 09:45:54,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-22 09:45:54,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2022-07-22 09:45:54,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:45:54,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2022-07-22 09:45:54,753 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 55 [2022-07-22 09:45:54,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:45:54,753 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2022-07-22 09:45:54,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.242424242424242) internal successors, (140), 33 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:45:54,754 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2022-07-22 09:45:54,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-22 09:45:54,754 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:45:54,754 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 09:45:54,771 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-22 09:45:54,967 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-22 09:45:54,967 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:45:54,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:45:54,968 INFO L85 PathProgramCache]: Analyzing trace with hash 419308485, now seen corresponding path program 7 times [2022-07-22 09:45:54,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:45:54,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598720466] [2022-07-22 09:45:54,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:45:54,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:45:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:45:55,538 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 54 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 09:45:55,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:45:55,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598720466] [2022-07-22 09:45:55,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598720466] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:45:55,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201911179] [2022-07-22 09:45:55,538 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-22 09:45:55,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:45:55,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:45:55,540 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-22 09:45:55,540 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-22 09:45:55,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:45:55,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-22 09:45:55,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:45:55,643 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-22 09:45:55,672 INFO L356 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2022-07-22 09:45:55,672 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-22 09:45:55,715 INFO L356 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-07-22 09:45:55,715 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-22 09:45:55,727 INFO L356 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-07-22 09:45:55,727 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-22 09:45:55,876 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-22 09:45:55,891 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 39 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-22 09:45:55,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 09:45:58,038 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_111| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_111|)) (forall ((v_ArrVal_314 Int)) (< (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_111|) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_314) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 12)) |c_ULTIMATE.start_main_~MINVAL~0#1|)))) is different from false [2022-07-22 09:46:00,867 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 33 treesize of output 31 [2022-07-22 09:46:00,870 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 196 treesize of output 192 [2022-07-22 09:46:00,967 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 37 refuted. 0 times theorem prover too weak. 17 trivial. 2 not checked. [2022-07-22 09:46:00,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201911179] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 09:46:00,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 09:46:00,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 14] total 40 [2022-07-22 09:46:00,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622781833] [2022-07-22 09:46:00,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 09:46:00,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-22 09:46:00,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:46:00,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-22 09:46:00,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1255, Unknown=8, NotChecked=74, Total=1560 [2022-07-22 09:46:00,969 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 40 states, 40 states have (on average 3.725) internal successors, (149), 40 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-22 09:46:03,350 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|)) (.cse1 (* 8 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (div c_~CELLCOUNT~0 2))) (and (<= (+ (div (+ (* (- 1) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 16) 8) 1) .cse0) (<= (+ .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 16) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_111| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_111|)) (forall ((v_ArrVal_314 Int)) (< (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_111|) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_314) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 12)) |c_ULTIMATE.start_main_~MINVAL~0#1|)))) .cse2 (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (= (select .cse3 12) 0) (let ((.cse4 (+ .cse1 (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) (or (and .cse2 (= (select .cse3 .cse4) 0)) (not (= .cse4 12)))) (<= |c_ULTIMATE.start_main_~i~0#1| 2) (<= 3 .cse0))) is different from false [2022-07-22 09:46:05,427 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (and (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_111| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_111|)) (forall ((v_ArrVal_314 Int)) (< (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_111|) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_314) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 12)) |c_ULTIMATE.start_main_~MINVAL~0#1|)))) (<= (select .cse0 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 12)) 0) (<= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|) (let ((.cse3 (div c_~CELLCOUNT~0 2))) (let ((.cse2 (* .cse3 8)) (.cse1 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (or (and (<= (+ .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) (+ .cse2 7)) (not (= (+ c_~CELLCOUNT~0 (* .cse3 (- 2))) 0)) (not (<= 0 c_~CELLCOUNT~0))) (<= (+ .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset| 1) .cse2) (and (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (= (select .cse0 12) 0) (not (= (+ .cse1 (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 12)))))))) is different from false [2022-07-22 09:46:05,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:46:05,760 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2022-07-22 09:46:05,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-22 09:46:05,761 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.725) internal successors, (149), 40 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) Word has length 63 [2022-07-22 09:46:05,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:46:05,762 INFO L225 Difference]: With dead ends: 153 [2022-07-22 09:46:05,762 INFO L226 Difference]: Without dead ends: 143 [2022-07-22 09:46:05,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1103 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=437, Invalid=2645, Unknown=10, NotChecked=330, Total=3422 [2022-07-22 09:46:05,764 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 235 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 186 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 09:46:05,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 467 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 763 Invalid, 0 Unknown, 186 Unchecked, 0.3s Time] [2022-07-22 09:46:05,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-22 09:46:05,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 93. [2022-07-22 09:46:05,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.076086956521739) internal successors, (99), 92 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:46:05,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2022-07-22 09:46:05,775 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 63 [2022-07-22 09:46:05,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:46:05,775 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2022-07-22 09:46:05,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.725) internal successors, (149), 40 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-22 09:46:05,775 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2022-07-22 09:46:05,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-22 09:46:05,776 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:46:05,776 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 09:46:05,797 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-22 09:46:05,983 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-22 09:46:05,984 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:46:05,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:46:05,984 INFO L85 PathProgramCache]: Analyzing trace with hash 26281475, now seen corresponding path program 8 times [2022-07-22 09:46:05,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:46:05,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424321129] [2022-07-22 09:46:05,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:46:05,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:46:06,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:46:06,756 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 8 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 09:46:06,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:46:06,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424321129] [2022-07-22 09:46:06,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424321129] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:46:06,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577520066] [2022-07-22 09:46:06,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 09:46:06,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:46:06,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:46:06,757 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-22 09:46:06,758 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-22 09:46:06,818 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 09:46:06,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 09:46:06,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-22 09:46:06,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:46:06,951 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-22 09:46:06,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:46:06,982 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 23 treesize of output 22 [2022-07-22 09:46:07,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:46:07,038 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-22 09:46:07,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:46:07,052 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-22 09:46:07,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:46:07,089 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-22 09:46:07,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:46:07,102 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-22 09:46:07,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:46:07,143 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-22 09:46:07,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:46:07,182 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 09:46:07,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2022-07-22 09:46:07,556 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 8 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 09:46:07,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 09:46:10,200 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-22 09:46:10,202 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-22 09:46:10,414 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 09:46:10,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577520066] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 09:46:10,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 09:46:10,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 18] total 50 [2022-07-22 09:46:10,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418864446] [2022-07-22 09:46:10,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 09:46:10,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-22 09:46:10,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:46:10,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-22 09:46:10,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2233, Unknown=0, NotChecked=0, Total=2450 [2022-07-22 09:46:10,426 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand has 50 states, 50 states have (on average 3.6) internal successors, (180), 50 states have internal predecessors, (180), 0 states have call successors, (0), 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-22 09:46:13,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:46:13,200 INFO L93 Difference]: Finished difference Result 192 states and 209 transitions. [2022-07-22 09:46:13,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-07-22 09:46:13,201 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.6) internal successors, (180), 50 states have internal predecessors, (180), 0 states have call successors, (0), 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-22 09:46:13,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:46:13,202 INFO L225 Difference]: With dead ends: 192 [2022-07-22 09:46:13,202 INFO L226 Difference]: Without dead ends: 182 [2022-07-22 09:46:13,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 102 SyntacticMatches, 8 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3957 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1225, Invalid=11657, Unknown=0, NotChecked=0, Total=12882 [2022-07-22 09:46:13,206 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 361 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 2090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 282 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-22 09:46:13,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 603 Invalid, 2090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 1577 Invalid, 0 Unknown, 282 Unchecked, 0.7s Time] [2022-07-22 09:46:13,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-07-22 09:46:13,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 126. [2022-07-22 09:46:13,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.064) internal successors, (133), 125 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:46:13,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 133 transitions. [2022-07-22 09:46:13,216 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 133 transitions. Word has length 63 [2022-07-22 09:46:13,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:46:13,216 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 133 transitions. [2022-07-22 09:46:13,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.6) internal successors, (180), 50 states have internal predecessors, (180), 0 states have call successors, (0), 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-22 09:46:13,217 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 133 transitions. [2022-07-22 09:46:13,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-22 09:46:13,217 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:46:13,217 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 09:46:13,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-22 09:46:13,420 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-22 09:46:13,421 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:46:13,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:46:13,421 INFO L85 PathProgramCache]: Analyzing trace with hash 234543151, now seen corresponding path program 9 times [2022-07-22 09:46:13,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:46:13,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566068028] [2022-07-22 09:46:13,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:46:13,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:46:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:46:13,555 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 19 proven. 24 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-22 09:46:13,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:46:13,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566068028] [2022-07-22 09:46:13,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566068028] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:46:13,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713645476] [2022-07-22 09:46:13,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 09:46:13,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:46:13,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:46:13,557 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-22 09:46:13,558 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-22 09:46:13,704 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-22 09:46:13,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 09:46:13,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 09:46:13,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:46:13,833 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 28 proven. 15 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-22 09:46:13,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 09:46:14,022 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 28 proven. 15 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-22 09:46:14,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713645476] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 09:46:14,022 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 09:46:14,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-22 09:46:14,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70204314] [2022-07-22 09:46:14,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 09:46:14,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-22 09:46:14,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:46:14,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-22 09:46:14,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-22 09:46:14,024 INFO L87 Difference]: Start difference. First operand 126 states and 133 transitions. Second operand has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 0 states have call successors, (0), 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-22 09:46:14,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:46:14,235 INFO L93 Difference]: Finished difference Result 230 states and 246 transitions. [2022-07-22 09:46:14,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-22 09:46:14,236 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 0 states have call successors, (0), 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 73 [2022-07-22 09:46:14,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:46:14,236 INFO L225 Difference]: With dead ends: 230 [2022-07-22 09:46:14,236 INFO L226 Difference]: Without dead ends: 164 [2022-07-22 09:46:14,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 136 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=444, Unknown=0, NotChecked=0, Total=600 [2022-07-22 09:46:14,237 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 154 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 09:46:14,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 87 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 09:46:14,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-07-22 09:46:14,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 144. [2022-07-22 09:46:14,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.062937062937063) internal successors, (152), 143 states have internal predecessors, (152), 0 states have call successors, (0), 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-22 09:46:14,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2022-07-22 09:46:14,247 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 73 [2022-07-22 09:46:14,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:46:14,248 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2022-07-22 09:46:14,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 0 states have call successors, (0), 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-22 09:46:14,248 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2022-07-22 09:46:14,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-22 09:46:14,248 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:46:14,249 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 09:46:14,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-22 09:46:14,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-22 09:46:14,464 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:46:14,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:46:14,464 INFO L85 PathProgramCache]: Analyzing trace with hash -903520087, now seen corresponding path program 10 times [2022-07-22 09:46:14,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:46:14,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993116167] [2022-07-22 09:46:14,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:46:14,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:46:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:46:14,766 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 83 proven. 46 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-22 09:46:14,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:46:14,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993116167] [2022-07-22 09:46:14,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993116167] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:46:14,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305299990] [2022-07-22 09:46:14,766 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 09:46:14,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:46:14,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:46:14,767 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 09:46:14,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-22 09:46:14,829 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 09:46:14,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 09:46:14,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-22 09:46:14,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:46:15,323 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 114 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-22 09:46:15,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 09:46:15,546 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 114 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-22 09:46:15,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305299990] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 09:46:15,546 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 09:46:15,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15] total 42 [2022-07-22 09:46:15,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608214872] [2022-07-22 09:46:15,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 09:46:15,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-22 09:46:15,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:46:15,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-22 09:46:15,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=1310, Unknown=0, NotChecked=0, Total=1722 [2022-07-22 09:46:15,548 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand has 42 states, 42 states have (on average 4.476190476190476) internal successors, (188), 42 states have internal predecessors, (188), 0 states have call successors, (0), 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-22 09:46:15,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:46:15,878 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2022-07-22 09:46:15,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-22 09:46:15,879 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 4.476190476190476) internal successors, (188), 42 states have internal predecessors, (188), 0 states have call successors, (0), 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 75 [2022-07-22 09:46:15,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:46:15,879 INFO L225 Difference]: With dead ends: 169 [2022-07-22 09:46:15,879 INFO L226 Difference]: Without dead ends: 106 [2022-07-22 09:46:15,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 866 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=618, Invalid=1832, Unknown=0, NotChecked=0, Total=2450 [2022-07-22 09:46:15,881 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 448 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 09:46:15,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 173 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 09:46:15,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-22 09:46:15,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2022-07-22 09:46:15,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 1.0686274509803921) internal successors, (109), 102 states have internal predecessors, (109), 0 states have call successors, (0), 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-22 09:46:15,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2022-07-22 09:46:15,890 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 75 [2022-07-22 09:46:15,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:46:15,890 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2022-07-22 09:46:15,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.476190476190476) internal successors, (188), 42 states have internal predecessors, (188), 0 states have call successors, (0), 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-22 09:46:15,890 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2022-07-22 09:46:15,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-22 09:46:15,891 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:46:15,891 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 09:46:15,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-22 09:46:16,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-22 09:46:16,099 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:46:16,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:46:16,100 INFO L85 PathProgramCache]: Analyzing trace with hash 277238954, now seen corresponding path program 11 times [2022-07-22 09:46:16,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:46:16,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19823289] [2022-07-22 09:46:16,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:46:16,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:46:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:46:16,682 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 09:46:16,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:46:16,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19823289] [2022-07-22 09:46:16,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19823289] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:46:16,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550622383] [2022-07-22 09:46:16,682 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 09:46:16,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:46:16,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:46:16,684 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 09:46:16,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-22 09:46:16,927 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-22 09:46:16,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 09:46:16,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-22 09:46:16,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:46:16,951 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-22 09:46:16,980 INFO L356 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2022-07-22 09:46:16,980 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-22 09:46:17,031 INFO L356 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2022-07-22 09:46:17,031 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-22 09:46:17,046 INFO L356 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2022-07-22 09:46:17,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, 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-22 09:46:17,246 INFO L356 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-07-22 09:46:17,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 20 [2022-07-22 09:46:17,268 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-22 09:46:17,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 09:46:19,413 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_201| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_201|)) (forall ((v_ArrVal_569 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_201|) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_569) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20)) 0)))) is different from false [2022-07-22 09:46:23,083 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 33 treesize of output 31 [2022-07-22 09:46:23,086 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 1704 treesize of output 1672 [2022-07-22 09:46:24,087 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 28 trivial. 3 not checked. [2022-07-22 09:46:24,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550622383] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 09:46:24,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 09:46:24,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 15, 17] total 35 [2022-07-22 09:46:24,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164062013] [2022-07-22 09:46:24,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 09:46:24,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-22 09:46:24,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:46:24,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-22 09:46:24,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=964, Unknown=10, NotChecked=64, Total=1190 [2022-07-22 09:46:24,090 INFO L87 Difference]: Start difference. First operand 103 states and 109 transitions. Second operand has 35 states, 35 states have (on average 4.085714285714285) internal successors, (143), 35 states have internal predecessors, (143), 0 states have call successors, (0), 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-22 09:46:26,510 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|)) (.cse3 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) (let ((.cse1 (= (select .cse2 .cse3) 0)) (.cse0 (div c_~CELLCOUNT~0 2))) (and (<= 4 .cse0) (<= 3 |c_ULTIMATE.start_main_~i~0#1|) .cse1 (forall ((|v_ULTIMATE.start_main_~i~0#1_201| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_201|)) (forall ((v_ArrVal_569 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_201|) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_569) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20)) 0)))) (= (select .cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) 0) (let ((.cse4 (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) .cse0))) (or (and .cse1 (= .cse3 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20)) .cse4) (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) .cse0) (and (not (= (+ c_~CELLCOUNT~0 (* .cse0 (- 2))) 0)) (not (<= 0 c_~CELLCOUNT~0)) .cse4))) (<= |c_ULTIMATE.start_main_~i~0#1| 3)))) is different from false [2022-07-22 09:46:28,514 WARN L833 $PredicateComparison]: unable to prove that (and (= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20))) (forall ((|v_ULTIMATE.start_main_~i~0#1_201| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_201|)) (forall ((v_ArrVal_569 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_201|) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_569) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20)) 0))))) is different from false [2022-07-22 09:46:29,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:46:29,086 INFO L93 Difference]: Finished difference Result 186 states and 201 transitions. [2022-07-22 09:46:29,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-07-22 09:46:29,087 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 4.085714285714285) internal successors, (143), 35 states have internal predecessors, (143), 0 states have call successors, (0), 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-22 09:46:29,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:46:29,088 INFO L225 Difference]: With dead ends: 186 [2022-07-22 09:46:29,088 INFO L226 Difference]: Without dead ends: 184 [2022-07-22 09:46:29,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 147 SyntacticMatches, 9 SemanticMatches, 69 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1216 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=582, Invalid=3974, Unknown=12, NotChecked=402, Total=4970 [2022-07-22 09:46:29,089 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 157 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 183 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 09:46:29,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 370 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1056 Invalid, 0 Unknown, 183 Unchecked, 0.4s Time] [2022-07-22 09:46:29,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-07-22 09:46:29,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 128. [2022-07-22 09:46:29,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.0708661417322836) internal successors, (136), 127 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:46:29,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2022-07-22 09:46:29,099 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 77 [2022-07-22 09:46:29,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:46:29,099 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2022-07-22 09:46:29,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.085714285714285) internal successors, (143), 35 states have internal predecessors, (143), 0 states have call successors, (0), 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-22 09:46:29,099 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2022-07-22 09:46:29,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-22 09:46:29,100 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:46:29,100 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 09:46:29,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-22 09:46:29,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-22 09:46:29,305 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:46:29,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:46:29,305 INFO L85 PathProgramCache]: Analyzing trace with hash 2118097373, now seen corresponding path program 12 times [2022-07-22 09:46:29,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:46:29,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746302187] [2022-07-22 09:46:29,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:46:29,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:46:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:46:30,497 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 12 proven. 158 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 09:46:30,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:46:30,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746302187] [2022-07-22 09:46:30,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746302187] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:46:30,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867194901] [2022-07-22 09:46:30,498 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-22 09:46:30,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:46:30,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:46:30,499 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 09:46:30,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-22 09:46:30,676 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-07-22 09:46:30,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 09:46:30,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-22 09:46:30,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:46:30,967 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-22 09:46:31,037 INFO L356 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2022-07-22 09:46:31,037 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-22 09:46:31,127 INFO L356 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2022-07-22 09:46:31,128 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-22 09:46:31,200 INFO L356 Elim1Store]: treesize reduction 100, result has 20.0 percent of original size [2022-07-22 09:46:31,200 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 41 treesize of output 43 [2022-07-22 09:46:32,545 INFO L356 Elim1Store]: treesize reduction 101, result has 12.2 percent of original size [2022-07-22 09:46:32,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 36 [2022-07-22 09:46:32,605 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 84 proven. 78 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-22 09:46:32,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 09:46:48,343 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 85 treesize of output 81 [2022-07-22 09:46:48,357 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-22 09:46:48,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5739 treesize of output 5667 [2022-07-22 09:46:53,326 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 80 proven. 82 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-22 09:46:53,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867194901] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 09:46:53,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 09:46:53,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 28, 30] total 76 [2022-07-22 09:46:53,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324593996] [2022-07-22 09:46:53,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 09:46:53,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-07-22 09:46:53,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:46:53,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-07-22 09:46:53,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=680, Invalid=4995, Unknown=25, NotChecked=0, Total=5700 [2022-07-22 09:46:53,329 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand has 76 states, 76 states have (on average 3.039473684210526) internal successors, (231), 76 states have internal predecessors, (231), 0 states have call successors, (0), 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-22 09:46:56,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:46:56,116 INFO L93 Difference]: Finished difference Result 293 states and 317 transitions. [2022-07-22 09:46:56,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-07-22 09:46:56,116 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 3.039473684210526) internal successors, (231), 76 states have internal predecessors, (231), 0 states have call successors, (0), 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 83 [2022-07-22 09:46:56,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:46:56,118 INFO L225 Difference]: With dead ends: 293 [2022-07-22 09:46:56,118 INFO L226 Difference]: Without dead ends: 278 [2022-07-22 09:46:56,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 144 SyntacticMatches, 5 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3933 ImplicationChecksByTransitivity, 21.9s TimeCoverageRelationStatistics Valid=1904, Invalid=11877, Unknown=25, NotChecked=0, Total=13806 [2022-07-22 09:46:56,121 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 182 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 494 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 09:46:56,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 869 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 615 Invalid, 0 Unknown, 494 Unchecked, 0.3s Time] [2022-07-22 09:46:56,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-07-22 09:46:56,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 265. [2022-07-22 09:46:56,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.0833333333333333) internal successors, (286), 264 states have internal predecessors, (286), 0 states have call successors, (0), 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-22 09:46:56,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 286 transitions. [2022-07-22 09:46:56,144 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 286 transitions. Word has length 83 [2022-07-22 09:46:56,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:46:56,145 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 286 transitions. [2022-07-22 09:46:56,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 3.039473684210526) internal successors, (231), 76 states have internal predecessors, (231), 0 states have call successors, (0), 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-22 09:46:56,145 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 286 transitions. [2022-07-22 09:46:56,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-22 09:46:56,146 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:46:56,146 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 09:46:56,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-22 09:46:56,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-22 09:46:56,360 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:46:56,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:46:56,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1725070363, now seen corresponding path program 13 times [2022-07-22 09:46:56,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:46:56,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175294168] [2022-07-22 09:46:56,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:46:56,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:46:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:46:57,586 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 12 proven. 158 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 09:46:57,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:46:57,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175294168] [2022-07-22 09:46:57,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175294168] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:46:57,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979386922] [2022-07-22 09:46:57,587 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-22 09:46:57,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:46:57,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:46:57,588 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 09:46:57,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-22 09:46:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:46:57,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-22 09:46:57,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:46:57,840 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-22 09:46:57,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:46:57,873 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 23 treesize of output 22 [2022-07-22 09:46:57,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:46:57,938 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-22 09:46:57,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:46:57,947 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-22 09:46:57,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:46:57,994 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-22 09:46:58,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:46:58,004 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-22 09:46:58,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:46:58,046 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-22 09:46:58,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:46:58,057 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-22 09:46:58,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:46:58,097 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-22 09:46:58,103 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 0 case distinctions, treesize of input 32 treesize of output 16 [2022-07-22 09:46:58,380 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-22 09:46:58,401 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 12 proven. 158 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 09:46:58,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 09:47:39,628 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-22 09:47:39,630 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-22 09:47:39,790 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 12 proven. 156 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 09:47:39,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979386922] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 09:47:39,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 09:47:39,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 16, 21] total 56 [2022-07-22 09:47:39,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017661804] [2022-07-22 09:47:39,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 09:47:39,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-07-22 09:47:39,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:47:39,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-07-22 09:47:39,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=2821, Unknown=3, NotChecked=0, Total=3080 [2022-07-22 09:47:39,793 INFO L87 Difference]: Start difference. First operand 265 states and 286 transitions. Second operand has 56 states, 56 states have (on average 4.232142857142857) internal successors, (237), 56 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:47:42,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:47:42,158 INFO L93 Difference]: Finished difference Result 490 states and 539 transitions. [2022-07-22 09:47:42,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-07-22 09:47:42,159 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 4.232142857142857) internal successors, (237), 56 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2022-07-22 09:47:42,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:47:42,160 INFO L225 Difference]: With dead ends: 490 [2022-07-22 09:47:42,160 INFO L226 Difference]: Without dead ends: 460 [2022-07-22 09:47:42,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 148 SyntacticMatches, 11 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2981 ImplicationChecksByTransitivity, 43.4s TimeCoverageRelationStatistics Valid=789, Invalid=8520, Unknown=3, NotChecked=0, Total=9312 [2022-07-22 09:47:42,162 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 446 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 1405 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 1853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 237 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-22 09:47:42,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 828 Invalid, 1853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1405 Invalid, 0 Unknown, 237 Unchecked, 0.7s Time] [2022-07-22 09:47:42,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2022-07-22 09:47:42,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 317. [2022-07-22 09:47:42,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 316 states have (on average 1.0917721518987342) internal successors, (345), 316 states have internal predecessors, (345), 0 states have call successors, (0), 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-22 09:47:42,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 345 transitions. [2022-07-22 09:47:42,195 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 345 transitions. Word has length 83 [2022-07-22 09:47:42,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:47:42,196 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 345 transitions. [2022-07-22 09:47:42,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 4.232142857142857) internal successors, (237), 56 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:47:42,196 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 345 transitions. [2022-07-22 09:47:42,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-22 09:47:42,197 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:47:42,197 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 09:47:42,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-22 09:47:42,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:47:42,416 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:47:42,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:47:42,416 INFO L85 PathProgramCache]: Analyzing trace with hash 2048133086, now seen corresponding path program 14 times [2022-07-22 09:47:42,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:47:42,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720595444] [2022-07-22 09:47:42,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:47:42,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:47:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:47:42,631 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 49 proven. 45 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-22 09:47:42,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:47:42,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720595444] [2022-07-22 09:47:42,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720595444] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:47:42,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726147655] [2022-07-22 09:47:42,632 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 09:47:42,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:47:42,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:47:42,634 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 09:47:42,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-22 09:47:42,720 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 09:47:42,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 09:47:42,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-22 09:47:42,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:47:42,865 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 62 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-22 09:47:42,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 09:47:43,075 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 62 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-22 09:47:43,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726147655] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 09:47:43,075 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 09:47:43,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 21 [2022-07-22 09:47:43,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541078187] [2022-07-22 09:47:43,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 09:47:43,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-22 09:47:43,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:47:43,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-22 09:47:43,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2022-07-22 09:47:43,077 INFO L87 Difference]: Start difference. First operand 317 states and 345 transitions. Second operand has 21 states, 21 states have (on average 4.238095238095238) internal successors, (89), 21 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:47:43,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:47:43,356 INFO L93 Difference]: Finished difference Result 388 states and 423 transitions. [2022-07-22 09:47:43,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-22 09:47:43,356 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.238095238095238) internal successors, (89), 21 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2022-07-22 09:47:43,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:47:43,357 INFO L225 Difference]: With dead ends: 388 [2022-07-22 09:47:43,357 INFO L226 Difference]: Without dead ends: 278 [2022-07-22 09:47:43,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 158 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=224, Invalid=706, Unknown=0, NotChecked=0, Total=930 [2022-07-22 09:47:43,358 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 269 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 09:47:43,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 74 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 09:47:43,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-07-22 09:47:43,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 247. [2022-07-22 09:47:43,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 1.08130081300813) internal successors, (266), 246 states have internal predecessors, (266), 0 states have call successors, (0), 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-22 09:47:43,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 266 transitions. [2022-07-22 09:47:43,383 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 266 transitions. Word has length 85 [2022-07-22 09:47:43,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:47:43,384 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 266 transitions. [2022-07-22 09:47:43,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.238095238095238) internal successors, (89), 21 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:47:43,384 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 266 transitions. [2022-07-22 09:47:43,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-22 09:47:43,385 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:47:43,385 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 09:47:43,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-07-22 09:47:43,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:47:43,596 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:47:43,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:47:43,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1479714958, now seen corresponding path program 15 times [2022-07-22 09:47:43,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:47:43,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887031650] [2022-07-22 09:47:43,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:47:43,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:47:43,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:47:44,078 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 09:47:44,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:47:44,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887031650] [2022-07-22 09:47:44,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887031650] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:47:44,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238020498] [2022-07-22 09:47:44,079 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 09:47:44,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:47:44,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:47:44,084 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 09:47:44,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-22 09:47:44,461 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-07-22 09:47:44,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 09:47:44,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-22 09:47:44,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:47:44,628 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-22 09:47:44,682 INFO L356 Elim1Store]: treesize reduction 60, result has 16.7 percent of original size [2022-07-22 09:47:44,683 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 2 case distinctions, treesize of input 38 treesize of output 28 [2022-07-22 09:47:45,058 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 13 proven. 182 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-22 09:47:45,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 09:47:45,264 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-22 09:47:45,266 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 30 treesize of output 26 [2022-07-22 09:47:45,665 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 195 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-22 09:47:45,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238020498] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 09:47:45,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 09:47:45,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 23] total 42 [2022-07-22 09:47:45,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047776938] [2022-07-22 09:47:45,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 09:47:45,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-22 09:47:45,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:47:45,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-22 09:47:45,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1534, Unknown=0, NotChecked=0, Total=1722 [2022-07-22 09:47:45,667 INFO L87 Difference]: Start difference. First operand 247 states and 266 transitions. Second operand has 42 states, 42 states have (on average 3.761904761904762) internal successors, (158), 42 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:47:47,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:47:47,170 INFO L93 Difference]: Finished difference Result 321 states and 347 transitions. [2022-07-22 09:47:47,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-07-22 09:47:47,170 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.761904761904762) internal successors, (158), 42 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2022-07-22 09:47:47,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:47:47,171 INFO L225 Difference]: With dead ends: 321 [2022-07-22 09:47:47,171 INFO L226 Difference]: Without dead ends: 319 [2022-07-22 09:47:47,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 152 SyntacticMatches, 11 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2370 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=815, Invalid=7017, Unknown=0, NotChecked=0, Total=7832 [2022-07-22 09:47:47,173 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 152 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 1623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-22 09:47:47,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 794 Invalid, 1623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1463 Invalid, 0 Unknown, 68 Unchecked, 0.6s Time] [2022-07-22 09:47:47,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-07-22 09:47:47,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 241. [2022-07-22 09:47:47,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 1.0833333333333333) internal successors, (260), 240 states have internal predecessors, (260), 0 states have call successors, (0), 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-22 09:47:47,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 260 transitions. [2022-07-22 09:47:47,195 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 260 transitions. Word has length 89 [2022-07-22 09:47:47,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:47:47,195 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 260 transitions. [2022-07-22 09:47:47,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.761904761904762) internal successors, (158), 42 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:47:47,195 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 260 transitions. [2022-07-22 09:47:47,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-22 09:47:47,196 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:47:47,196 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 09:47:47,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-22 09:47:47,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:47:47,400 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:47:47,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:47:47,401 INFO L85 PathProgramCache]: Analyzing trace with hash 339321817, now seen corresponding path program 16 times [2022-07-22 09:47:47,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:47:47,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702870493] [2022-07-22 09:47:47,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:47:47,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:47:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:47:47,606 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 49 proven. 62 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-22 09:47:47,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:47:47,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702870493] [2022-07-22 09:47:47,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702870493] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:47:47,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137284457] [2022-07-22 09:47:47,606 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 09:47:47,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:47:47,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:47:47,612 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 09:47:47,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-22 09:47:47,709 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 09:47:47,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 09:47:47,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-22 09:47:47,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:47:47,893 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 66 proven. 45 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-22 09:47:47,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 09:47:48,155 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 66 proven. 45 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-22 09:47:48,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137284457] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 09:47:48,155 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 09:47:48,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2022-07-22 09:47:48,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447682079] [2022-07-22 09:47:48,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 09:47:48,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-22 09:47:48,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:47:48,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-22 09:47:48,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2022-07-22 09:47:48,156 INFO L87 Difference]: Start difference. First operand 241 states and 260 transitions. Second operand has 23 states, 23 states have (on average 4.130434782608695) internal successors, (95), 23 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:47:48,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:47:48,896 INFO L93 Difference]: Finished difference Result 432 states and 469 transitions. [2022-07-22 09:47:48,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-22 09:47:48,897 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.130434782608695) internal successors, (95), 23 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2022-07-22 09:47:48,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:47:48,898 INFO L225 Difference]: With dead ends: 432 [2022-07-22 09:47:48,898 INFO L226 Difference]: Without dead ends: 377 [2022-07-22 09:47:48,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 164 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 801 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=552, Invalid=1898, Unknown=0, NotChecked=0, Total=2450 [2022-07-22 09:47:48,899 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 495 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 09:47:48,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 361 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 09:47:48,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-07-22 09:47:48,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 267. [2022-07-22 09:47:48,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 1.0827067669172932) internal successors, (288), 266 states have internal predecessors, (288), 0 states have call successors, (0), 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-22 09:47:48,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 288 transitions. [2022-07-22 09:47:48,933 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 288 transitions. Word has length 89 [2022-07-22 09:47:48,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:47:48,934 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 288 transitions. [2022-07-22 09:47:48,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.130434782608695) internal successors, (95), 23 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:47:48,934 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 288 transitions. [2022-07-22 09:47:48,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-22 09:47:48,935 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:47:48,935 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 09:47:48,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-22 09:47:49,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:47:49,139 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:47:49,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:47:49,139 INFO L85 PathProgramCache]: Analyzing trace with hash 717230923, now seen corresponding path program 17 times [2022-07-22 09:47:49,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:47:49,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596031816] [2022-07-22 09:47:49,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:47:49,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:47:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:47:49,306 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 15 proven. 58 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-07-22 09:47:49,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:47:49,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596031816] [2022-07-22 09:47:49,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596031816] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:47:49,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944722036] [2022-07-22 09:47:49,307 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 09:47:49,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:47:49,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:47:49,308 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 09:47:49,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-22 09:47:49,692 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-07-22 09:47:49,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 09:47:49,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-22 09:47:49,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:47:49,818 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 28 proven. 45 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-07-22 09:47:49,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 09:47:50,075 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 28 proven. 45 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-07-22 09:47:50,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944722036] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 09:47:50,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 09:47:50,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-07-22 09:47:50,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440713171] [2022-07-22 09:47:50,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 09:47:50,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-22 09:47:50,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:47:50,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-22 09:47:50,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-07-22 09:47:50,078 INFO L87 Difference]: Start difference. First operand 267 states and 288 transitions. Second operand has 20 states, 20 states have (on average 4.15) internal successors, (83), 20 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:47:50,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:47:50,415 INFO L93 Difference]: Finished difference Result 297 states and 320 transitions. [2022-07-22 09:47:50,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-22 09:47:50,416 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.15) internal successors, (83), 20 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2022-07-22 09:47:50,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:47:50,416 INFO L225 Difference]: With dead ends: 297 [2022-07-22 09:47:50,417 INFO L226 Difference]: Without dead ends: 248 [2022-07-22 09:47:50,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 174 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2022-07-22 09:47:50,418 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 185 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 09:47:50,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 108 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 09:47:50,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-07-22 09:47:50,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 246. [2022-07-22 09:47:50,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 1.0816326530612246) internal successors, (265), 245 states have internal predecessors, (265), 0 states have call successors, (0), 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-22 09:47:50,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 265 transitions. [2022-07-22 09:47:50,441 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 265 transitions. Word has length 93 [2022-07-22 09:47:50,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:47:50,441 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 265 transitions. [2022-07-22 09:47:50,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.15) internal successors, (83), 20 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:47:50,441 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 265 transitions. [2022-07-22 09:47:50,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-22 09:47:50,442 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:47:50,442 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 09:47:50,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-22 09:47:50,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:47:50,648 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:47:50,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:47:50,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1444230572, now seen corresponding path program 18 times [2022-07-22 09:47:50,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:47:50,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007677234] [2022-07-22 09:47:50,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:47:50,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:47:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:47:52,041 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 61 proven. 141 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-22 09:47:52,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:47:52,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007677234] [2022-07-22 09:47:52,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007677234] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:47:52,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408515111] [2022-07-22 09:47:52,049 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-22 09:47:52,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:47:52,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:47:52,050 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 09:47:52,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-22 09:47:52,583 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-07-22 09:47:52,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 09:47:52,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-22 09:47:52,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:47:52,636 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-22 09:47:52,665 INFO L356 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2022-07-22 09:47:52,666 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-22 09:47:52,700 INFO L356 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-07-22 09:47:52,700 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-22 09:47:52,711 INFO L356 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-07-22 09:47:52,711 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-22 09:47:52,746 INFO L356 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-07-22 09:47:52,746 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-22 09:47:52,756 INFO L356 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-07-22 09:47:52,756 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-22 09:47:52,781 INFO L356 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-07-22 09:47:52,782 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-22 09:47:52,818 INFO L356 Elim1Store]: treesize reduction 121, result has 15.4 percent of original size [2022-07-22 09:47:52,818 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 5 case distinctions, treesize of input 47 treesize of output 40 [2022-07-22 09:47:55,571 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 5 proven. 141 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-22 09:47:55,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 09:47:56,190 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 8) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 0) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20)) 0)) is different from false [2022-07-22 09:48:02,040 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_396| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_396|)) (forall ((v_ArrVal_1169 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_396|) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_1169) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20)) 0)))) is different from false [2022-07-22 09:48:10,907 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-22 09:48:10,908 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 30 treesize of output 26 [2022-07-22 09:48:10,946 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 1 proven. 122 refuted. 2 times theorem prover too weak. 67 trivial. 20 not checked. [2022-07-22 09:48:10,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408515111] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 09:48:10,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 09:48:10,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 18, 20] total 52 [2022-07-22 09:48:10,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620634040] [2022-07-22 09:48:10,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 09:48:10,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-22 09:48:10,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:48:10,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-22 09:48:10,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=2195, Unknown=27, NotChecked=194, Total=2652 [2022-07-22 09:48:10,947 INFO L87 Difference]: Start difference. First operand 246 states and 265 transitions. Second operand has 52 states, 52 states have (on average 3.923076923076923) internal successors, (204), 52 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:48:13,698 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (* 8 |c_ULTIMATE.start_main_~i~0#1|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (let ((.cse0 (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0)) (.cse3 (= (select .cse1 12) 0)) (.cse2 (+ .cse4 (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) (and (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (= 2 (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|)) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) .cse0 (= (select .cse1 .cse2) 0) (= (select .cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) 0) .cse3 (let ((.cse6 (div c_~CELLCOUNT~0 2))) (let ((.cse5 (* .cse6 8))) (or (and (<= (+ .cse4 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) (+ .cse5 7)) (not (= (+ c_~CELLCOUNT~0 (* .cse6 (- 2))) 0)) (not (<= 0 c_~CELLCOUNT~0))) (<= (+ .cse4 |c_ULTIMATE.start_main_~#volArray~0#1.offset| 1) .cse5) (and .cse0 .cse3 (not (= .cse2 12)))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_396| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_396|)) (forall ((v_ArrVal_1169 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_396|) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_1169) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20)) 0)))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 8) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 0) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20)) 0))))) is different from false [2022-07-22 09:48:14,158 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (and (= 0 (select .cse0 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (let ((.cse3 (div c_~CELLCOUNT~0 2))) (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) (.cse2 (* .cse3 8))) (or (<= .cse1 (+ .cse2 7)) (and (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (= (select .cse0 12) 0)) (and (not (= (+ c_~CELLCOUNT~0 (* .cse3 (- 2))) 0)) (not (<= 0 c_~CELLCOUNT~0)) (<= .cse1 (+ .cse2 15)))))) (<= 4 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 8) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 0) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20)) 0)))) is different from false [2022-07-22 09:48:14,611 WARN L833 $PredicateComparison]: unable to prove that (and (= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20))) (<= 4 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 8) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 0) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20)) 0))) is different from false [2022-07-22 09:48:16,914 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (and (= 0 (select .cse0 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20))) (= (select .cse0 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_396| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_396|)) (forall ((v_ArrVal_1169 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_396|) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_1169) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20)) 0)))) (<= 4 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 8) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 0) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20)) 0)))) is different from false [2022-07-22 09:48:17,331 WARN L833 $PredicateComparison]: unable to prove that (and (= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20))) (<= 5 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 8) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 0) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20)) 0))) is different from false [2022-07-22 09:48:19,433 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (let ((.cse3 (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0)) (.cse0 (* 8 |c_ULTIMATE.start_main_~i~0#1|)) (.cse4 (= (select .cse5 12) 0)) (.cse2 (div c_~CELLCOUNT~0 2))) (and (let ((.cse1 (* .cse2 8))) (or (<= (+ .cse0 |c_ULTIMATE.start_main_~#volArray~0#1.offset| 25) .cse1) (and (<= (+ .cse0 |c_ULTIMATE.start_main_~#volArray~0#1.offset| 17) .cse1) (not (= (+ c_~CELLCOUNT~0 (* .cse2 (- 2))) 0)) (not (<= 0 c_~CELLCOUNT~0))) (and .cse3 .cse4 (<= (+ (div (+ (* (- 1) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 16) 8) 4) .cse2)))) (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (= 2 (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|)) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) .cse3 (= (select .cse5 (+ .cse0 (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) 0) (= (select .cse5 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) 0) .cse4 (<= 6 .cse2) (forall ((|v_ULTIMATE.start_main_~i~0#1_396| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_396|)) (forall ((v_ArrVal_1169 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_396|) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_1169) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20)) 0)))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 8) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 0) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20)) 0))))) is different from false [2022-07-22 09:48:19,867 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (and (= 0 (select .cse0 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (let ((.cse3 (div c_~CELLCOUNT~0 2))) (let ((.cse1 (* 8 |c_ULTIMATE.start_main_~i~0#1|)) (.cse2 (* .cse3 8))) (or (<= (+ .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset| 17) .cse2) (and (not (= (+ c_~CELLCOUNT~0 (* .cse3 (- 2))) 0)) (not (<= 0 c_~CELLCOUNT~0)) (<= (+ .cse1 9 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) .cse2)) (and (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (= (select .cse0 12) 0) (<= (+ (div (+ (* (- 1) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 16) 8) 4) .cse3))))) (<= 4 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 8) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 0) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20)) 0)))) is different from false [2022-07-22 09:48:22,181 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* 8 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (and (= 0 (select .cse0 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= (select .cse0 (+ .cse1 (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_396| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_396|)) (forall ((v_ArrVal_1169 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_396|) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_1169) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20)) 0)))) (let ((.cse3 (div c_~CELLCOUNT~0 2))) (let ((.cse2 (* .cse3 8))) (or (<= (+ .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset| 17) .cse2) (and (not (= (+ c_~CELLCOUNT~0 (* .cse3 (- 2))) 0)) (not (<= 0 c_~CELLCOUNT~0)) (<= (+ .cse1 9 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) .cse2)) (and (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (= (select .cse0 12) 0) (<= (+ (div (+ (* (- 1) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 16) 8) 4) .cse3))))) (<= 4 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 8) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 0) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20)) 0)))) is different from false [2022-07-22 09:48:22,635 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (and (= 0 (select .cse0 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20))) (<= 5 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (let ((.cse3 (div c_~CELLCOUNT~0 2))) (let ((.cse1 (* 8 |c_ULTIMATE.start_main_~i~0#1|)) (.cse2 (* .cse3 8))) (or (and (<= (+ .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset| 1) .cse2) (not (= (+ c_~CELLCOUNT~0 (* .cse3 (- 2))) 0)) (not (<= 0 c_~CELLCOUNT~0))) (<= (+ .cse1 9 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) .cse2) (and (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (= (select .cse0 12) 0) (<= (+ (div (+ (* (- 1) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 16) 8) 4) .cse3))))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 8) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 0) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20)) 0)))) is different from false [2022-07-22 09:48:24,700 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* 8 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (and (= 0 (select .cse0 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= (select .cse0 (+ .cse1 (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) 0) (let ((.cse3 (div c_~CELLCOUNT~0 2))) (let ((.cse2 (* .cse3 8))) (or (and (<= (+ .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset| 1) .cse2) (not (= (+ c_~CELLCOUNT~0 (* .cse3 (- 2))) 0)) (not (<= 0 c_~CELLCOUNT~0))) (<= (+ .cse1 9 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) .cse2) (and (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (= (select .cse0 12) 0) (<= (+ (div (+ (* (- 1) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 16) 8) 4) .cse3))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_396| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_396|)) (forall ((v_ArrVal_1169 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_396|) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_1169) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20)) 0)))) (<= 4 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 8) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 0) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20)) 0)))) is different from false [2022-07-22 09:48:25,131 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (and (= 0 (select .cse0 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20))) (<= 5 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (let ((.cse3 (div c_~CELLCOUNT~0 2))) (let ((.cse2 (* .cse3 8)) (.cse1 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (or (and (<= (+ .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) (+ .cse2 7)) (not (= (+ c_~CELLCOUNT~0 (* .cse3 (- 2))) 0)) (not (<= 0 c_~CELLCOUNT~0))) (<= (+ .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset| 1) .cse2) (and (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (= (select .cse0 12) 0) (not (= (+ .cse1 (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 12)))))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 8) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 0) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20)) 0)))) is different from false [2022-07-22 09:48:27,235 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|)) (.cse1 (+ .cse2 (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) (and (= 0 (select .cse0 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= (select .cse0 .cse1) 0) (let ((.cse4 (div c_~CELLCOUNT~0 2))) (let ((.cse3 (* .cse4 8))) (or (and (<= (+ .cse2 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) (+ .cse3 7)) (not (= (+ c_~CELLCOUNT~0 (* .cse4 (- 2))) 0)) (not (<= 0 c_~CELLCOUNT~0))) (<= (+ .cse2 |c_ULTIMATE.start_main_~#volArray~0#1.offset| 1) .cse3) (and (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (= (select .cse0 12) 0) (not (= .cse1 12)))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_396| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_396|)) (forall ((v_ArrVal_1169 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_396|) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_1169) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20)) 0)))) (<= 4 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 8) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 0) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20)) 0))))) is different from false [2022-07-22 09:48:27,665 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (and (= 0 (select .cse0 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20))) (<= 5 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (let ((.cse3 (div c_~CELLCOUNT~0 2))) (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) (.cse2 (* .cse3 8))) (or (<= .cse1 (+ .cse2 7)) (and (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (= (select .cse0 12) 0)) (and (not (= (+ c_~CELLCOUNT~0 (* .cse3 (- 2))) 0)) (not (<= 0 c_~CELLCOUNT~0)) (<= .cse1 (+ .cse2 15)))))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 8) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 0) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20)) 0)))) is different from false [2022-07-22 09:48:30,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:48:30,304 INFO L93 Difference]: Finished difference Result 434 states and 476 transitions. [2022-07-22 09:48:30,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-07-22 09:48:30,305 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.923076923076923) internal successors, (204), 52 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2022-07-22 09:48:30,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:48:30,311 INFO L225 Difference]: With dead ends: 434 [2022-07-22 09:48:30,311 INFO L226 Difference]: Without dead ends: 392 [2022-07-22 09:48:30,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 175 SyntacticMatches, 11 SemanticMatches, 119 ConstructedPredicates, 15 IntricatePredicates, 1 DeprecatedPredicates, 3736 ImplicationChecksByTransitivity, 36.9s TimeCoverageRelationStatistics Valid=1158, Invalid=9984, Unknown=48, NotChecked=3330, Total=14520 [2022-07-22 09:48:30,313 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 430 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 1618 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 2177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 355 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-22 09:48:30,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 808 Invalid, 2177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1618 Invalid, 0 Unknown, 355 Unchecked, 0.7s Time] [2022-07-22 09:48:30,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2022-07-22 09:48:30,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 248. [2022-07-22 09:48:30,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 1.0728744939271255) internal successors, (265), 247 states have internal predecessors, (265), 0 states have call successors, (0), 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-22 09:48:30,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 265 transitions. [2022-07-22 09:48:30,339 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 265 transitions. Word has length 93 [2022-07-22 09:48:30,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:48:30,339 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 265 transitions. [2022-07-22 09:48:30,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.923076923076923) internal successors, (204), 52 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:48:30,340 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 265 transitions. [2022-07-22 09:48:30,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-22 09:48:30,341 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:48:30,341 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 09:48:30,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-22 09:48:30,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:48:30,555 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:48:30,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:48:30,556 INFO L85 PathProgramCache]: Analyzing trace with hash -4107009, now seen corresponding path program 19 times [2022-07-22 09:48:30,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:48:30,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178591550] [2022-07-22 09:48:30,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:48:30,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:48:30,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:48:30,958 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 157 proven. 71 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-22 09:48:30,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:48:30,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178591550] [2022-07-22 09:48:30,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178591550] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:48:30,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877715741] [2022-07-22 09:48:30,959 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-22 09:48:30,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:48:30,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:48:30,960 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 09:48:30,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-22 09:48:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:48:31,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-22 09:48:31,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:48:31,733 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 200 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-22 09:48:31,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 09:48:32,055 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 200 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-22 09:48:32,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877715741] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 09:48:32,055 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 09:48:32,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 18] total 51 [2022-07-22 09:48:32,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393005205] [2022-07-22 09:48:32,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 09:48:32,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-22 09:48:32,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:48:32,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-22 09:48:32,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=1955, Unknown=0, NotChecked=0, Total=2550 [2022-07-22 09:48:32,057 INFO L87 Difference]: Start difference. First operand 248 states and 265 transitions. Second operand has 51 states, 51 states have (on average 4.627450980392157) internal successors, (236), 51 states have internal predecessors, (236), 0 states have call successors, (0), 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-22 09:48:32,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:48:32,531 INFO L93 Difference]: Finished difference Result 266 states and 283 transitions. [2022-07-22 09:48:32,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-22 09:48:32,532 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 4.627450980392157) internal successors, (236), 51 states have internal predecessors, (236), 0 states have call successors, (0), 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 95 [2022-07-22 09:48:32,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:48:32,532 INFO L225 Difference]: With dead ends: 266 [2022-07-22 09:48:32,533 INFO L226 Difference]: Without dead ends: 165 [2022-07-22 09:48:32,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 158 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1339 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=859, Invalid=2681, Unknown=0, NotChecked=0, Total=3540 [2022-07-22 09:48:32,534 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 521 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 09:48:32,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 328 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 09:48:32,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-22 09:48:32,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2022-07-22 09:48:32,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.0670731707317074) internal successors, (175), 164 states have internal predecessors, (175), 0 states have call successors, (0), 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-22 09:48:32,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 175 transitions. [2022-07-22 09:48:32,549 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 175 transitions. Word has length 95 [2022-07-22 09:48:32,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:48:32,550 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 175 transitions. [2022-07-22 09:48:32,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 4.627450980392157) internal successors, (236), 51 states have internal predecessors, (236), 0 states have call successors, (0), 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-22 09:48:32,550 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 175 transitions. [2022-07-22 09:48:32,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-22 09:48:32,551 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:48:32,551 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 09:48:32,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-07-22 09:48:32,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-22 09:48:32,763 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:48:32,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:48:32,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1835664570, now seen corresponding path program 20 times [2022-07-22 09:48:32,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:48:32,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72344964] [2022-07-22 09:48:32,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:48:32,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:48:32,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:48:33,780 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 92 proven. 108 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-22 09:48:33,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:48:33,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72344964] [2022-07-22 09:48:33,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72344964] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:48:33,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135743044] [2022-07-22 09:48:33,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 09:48:33,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:48:33,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:48:33,782 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 09:48:33,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-22 09:48:33,897 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 09:48:33,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 09:48:33,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-22 09:48:33,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:48:33,964 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-22 09:48:33,994 INFO L356 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2022-07-22 09:48:33,994 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-22 09:48:34,027 INFO L356 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-07-22 09:48:34,028 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-22 09:48:34,037 INFO L356 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-07-22 09:48:34,037 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-22 09:48:34,328 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 199 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-22 09:48:34,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 09:48:36,640 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_452| Int)) (or (forall ((v_ArrVal_1334 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_452|)) v_ArrVal_1334) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 28)) 0)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_452|)))) is different from false [2022-07-22 09:48:37,066 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1332 Int) (|v_ULTIMATE.start_main_~i~0#1_452| Int) (v_ArrVal_1334 Int)) (or (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~#volArray~0#1.offset| (- 8)) v_ArrVal_1332) (+ (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_452|)) v_ArrVal_1334) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 28)) 0) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_452|)))) is different from false [2022-07-22 09:48:37,072 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 33 treesize of output 31 [2022-07-22 09:48:37,081 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 840 treesize of output 824 [2022-07-22 09:48:37,188 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 191 refuted. 0 times theorem prover too weak. 45 trivial. 8 not checked. [2022-07-22 09:48:37,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135743044] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 09:48:37,189 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 09:48:37,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18, 20] total 50 [2022-07-22 09:48:37,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109410423] [2022-07-22 09:48:37,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 09:48:37,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-22 09:48:37,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:48:37,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-22 09:48:37,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=2063, Unknown=2, NotChecked=186, Total=2450 [2022-07-22 09:48:37,190 INFO L87 Difference]: Start difference. First operand 165 states and 175 transitions. Second operand has 50 states, 50 states have (on average 4.16) internal successors, (208), 50 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-22 09:48:40,131 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (let ((.cse2 (div c_~CELLCOUNT~0 2)) (.cse3 (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0)) (.cse0 (* 8 |c_ULTIMATE.start_main_~i~0#1|)) (.cse4 (= (select .cse5 12) 0))) (and (let ((.cse1 (* .cse2 8))) (or (<= (+ .cse0 |c_ULTIMATE.start_main_~#volArray~0#1.offset| 17) .cse1) (and (<= (+ (div (+ (* (- 1) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 16) 8) 3) .cse2) .cse3 .cse4) (and (not (= (+ c_~CELLCOUNT~0 (* .cse2 (- 2))) 0)) (not (<= 0 c_~CELLCOUNT~0)) (<= (+ .cse0 9 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) .cse1)))) (= (select .cse5 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_452| Int)) (or (forall ((v_ArrVal_1334 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_452|)) v_ArrVal_1334) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 28)) 0)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_452|)))) (<= 5 .cse2) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) .cse3 (= (select .cse5 (+ .cse0 (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) 0) (= |c_ULTIMATE.start_main_~i~0#1| 4) .cse4 (<= 4 |c_ULTIMATE.start_main_~i~0#1|)))) is different from false [2022-07-22 09:48:42,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:48:42,197 INFO L93 Difference]: Finished difference Result 323 states and 349 transitions. [2022-07-22 09:48:42,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-07-22 09:48:42,198 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.16) internal successors, (208), 50 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) Word has length 97 [2022-07-22 09:48:42,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:48:42,199 INFO L225 Difference]: With dead ends: 323 [2022-07-22 09:48:42,199 INFO L226 Difference]: Without dead ends: 295 [2022-07-22 09:48:42,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 181 SyntacticMatches, 7 SemanticMatches, 121 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 4550 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=1247, Invalid=13042, Unknown=3, NotChecked=714, Total=15006 [2022-07-22 09:48:42,205 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 550 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 2031 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 2744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 2031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 402 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-22 09:48:42,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 555 Invalid, 2744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 2031 Invalid, 0 Unknown, 402 Unchecked, 0.9s Time] [2022-07-22 09:48:42,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-07-22 09:48:42,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 216. [2022-07-22 09:48:42,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.0651162790697675) internal successors, (229), 215 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:48:42,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 229 transitions. [2022-07-22 09:48:42,227 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 229 transitions. Word has length 97 [2022-07-22 09:48:42,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:48:42,227 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 229 transitions. [2022-07-22 09:48:42,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.16) internal successors, (208), 50 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-22 09:48:42,227 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 229 transitions. [2022-07-22 09:48:42,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-22 09:48:42,228 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:48:42,228 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 09:48:42,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-07-22 09:48:42,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-22 09:48:42,446 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:48:42,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:48:42,446 INFO L85 PathProgramCache]: Analyzing trace with hash -493271563, now seen corresponding path program 21 times [2022-07-22 09:48:42,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:48:42,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862964011] [2022-07-22 09:48:42,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:48:42,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:48:42,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:48:43,644 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 16 proven. 274 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 09:48:43,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:48:43,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862964011] [2022-07-22 09:48:43,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862964011] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:48:43,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461103557] [2022-07-22 09:48:43,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 09:48:43,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:48:43,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:48:43,646 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 09:48:43,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-22 09:48:44,021 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-07-22 09:48:44,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 09:48:44,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 88 conjunts are in the unsatisfiable core [2022-07-22 09:48:44,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:48:44,084 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-22 09:48:44,116 INFO L356 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2022-07-22 09:48:44,116 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-22 09:48:44,219 INFO L356 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2022-07-22 09:48:44,219 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 38 treesize of output 28 [2022-07-22 09:48:44,283 INFO L356 Elim1Store]: treesize reduction 100, result has 20.0 percent of original size [2022-07-22 09:48:44,283 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 50 treesize of output 43 [2022-07-22 09:48:44,777 INFO L356 Elim1Store]: treesize reduction 516, result has 12.4 percent of original size [2022-07-22 09:48:44,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 174 treesize of output 161 [2022-07-22 09:48:45,108 INFO L356 Elim1Store]: treesize reduction 306, result has 48.0 percent of original size [2022-07-22 09:48:45,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 174 treesize of output 371 [2022-07-22 09:49:18,628 WARN L233 SmtUtils]: Spent 18.49s on a formula simplification. DAG size of input: 562 DAG size of output: 87 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 09:49:19,207 INFO L356 Elim1Store]: treesize reduction 1441, result has 8.4 percent of original size [2022-07-22 09:49:19,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 66 case distinctions, treesize of input 288 treesize of output 272 [2022-07-22 09:49:19,848 INFO L356 Elim1Store]: treesize reduction 1200, result has 21.1 percent of original size [2022-07-22 09:49:19,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 65 case distinctions, treesize of input 288 treesize of output 460 [2022-07-22 09:49:37,779 INFO L356 Elim1Store]: treesize reduction 1363, result has 8.5 percent of original size [2022-07-22 09:49:37,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 66 case distinctions, treesize of input 301 treesize of output 285 [2022-07-22 09:49:38,354 INFO L356 Elim1Store]: treesize reduction 1200, result has 19.5 percent of original size [2022-07-22 09:49:38,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 66 case distinctions, treesize of input 301 treesize of output 448