/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loops/matrix-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 21:05:46,712 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:05:46,714 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:05:46,778 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:05:46,779 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:05:46,780 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:05:46,782 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:05:46,784 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:05:46,785 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:05:46,788 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:05:46,789 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:05:46,790 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:05:46,790 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:05:46,792 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:05:46,793 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:05:46,795 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:05:46,795 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:05:46,796 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:05:46,798 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:05:46,801 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:05:46,803 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:05:46,804 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:05:46,804 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:05:46,805 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:05:46,806 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:05:46,811 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:05:46,811 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:05:46,811 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:05:46,812 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:05:46,812 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:05:46,813 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:05:46,813 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:05:46,814 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:05:46,815 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:05:46,815 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:05:46,816 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:05:46,816 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:05:46,816 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:05:46,817 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:05:46,817 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:05:46,817 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:05:46,818 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:05:46,819 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 21:05:46,838 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:05:46,839 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:05:46,840 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:05:46,840 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:05:46,841 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:05:46,841 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:05:46,841 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:05:46,841 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:05:46,841 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:05:46,842 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:05:46,842 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:05:46,842 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:05:46,842 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:05:46,842 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:05:46,842 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:05:46,842 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:05:46,842 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:05:46,842 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:05:46,843 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:05:46,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:05:46,843 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:05:46,843 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:05:46,843 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:05:46,843 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:05:46,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:05:46,844 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:05:46,844 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:05:46,844 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:05:46,845 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:05:46,845 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 21:05:47,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:05:47,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:05:47,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:05:47,060 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:05:47,061 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:05:47,062 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/matrix-2.c [2022-04-27 21:05:47,108 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6940c6e6/3d8f2aac912c4172b7e6c85eaf38ec65/FLAGde99f5db7 [2022-04-27 21:05:47,484 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:05:47,484 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/matrix-2.c [2022-04-27 21:05:47,493 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6940c6e6/3d8f2aac912c4172b7e6c85eaf38ec65/FLAGde99f5db7 [2022-04-27 21:05:47,506 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6940c6e6/3d8f2aac912c4172b7e6c85eaf38ec65 [2022-04-27 21:05:47,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:05:47,510 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:05:47,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:05:47,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:05:47,514 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:05:47,515 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:05:47" (1/1) ... [2022-04-27 21:05:47,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4236c5c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:47, skipping insertion in model container [2022-04-27 21:05:47,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:05:47" (1/1) ... [2022-04-27 21:05:47,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:05:47,532 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:05:47,699 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/matrix-2.c[320,333] [2022-04-27 21:05:47,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:05:47,734 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:05:47,745 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/matrix-2.c[320,333] [2022-04-27 21:05:47,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:05:47,773 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:05:47,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:47 WrapperNode [2022-04-27 21:05:47,774 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:05:47,775 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:05:47,775 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:05:47,775 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:05:47,783 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:47" (1/1) ... [2022-04-27 21:05:47,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:47" (1/1) ... [2022-04-27 21:05:47,793 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:47" (1/1) ... [2022-04-27 21:05:47,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:47" (1/1) ... [2022-04-27 21:05:47,806 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:47" (1/1) ... [2022-04-27 21:05:47,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:47" (1/1) ... [2022-04-27 21:05:47,818 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:47" (1/1) ... [2022-04-27 21:05:47,821 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:05:47,822 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:05:47,822 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:05:47,822 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:05:47,823 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:47" (1/1) ... [2022-04-27 21:05:47,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:05:47,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:05:47,848 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-04-27 21:05:47,868 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-04-27 21:05:47,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:05:47,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:05:47,891 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:05:47,891 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 21:05:47,891 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:05:47,892 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:05:47,892 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:05:47,892 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:05:47,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:05:47,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 21:05:47,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 21:05:47,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 21:05:47,893 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:05:47,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-27 21:05:47,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:05:47,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:05:47,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:05:47,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:05:47,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:05:47,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:05:47,940 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:05:47,942 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:05:48,095 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:05:48,099 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:05:48,099 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-27 21:05:48,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:05:48 BoogieIcfgContainer [2022-04-27 21:05:48,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:05:48,101 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:05:48,101 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:05:48,115 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:05:48,118 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:05:48" (1/1) ... [2022-04-27 21:05:48,119 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:05:48,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:05:48 BasicIcfg [2022-04-27 21:05:48,158 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:05:48,159 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:05:48,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:05:48,167 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:05:48,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:05:47" (1/4) ... [2022-04-27 21:05:48,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac9662e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:05:48, skipping insertion in model container [2022-04-27 21:05:48,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:47" (2/4) ... [2022-04-27 21:05:48,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac9662e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:05:48, skipping insertion in model container [2022-04-27 21:05:48,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:05:48" (3/4) ... [2022-04-27 21:05:48,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac9662e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:05:48, skipping insertion in model container [2022-04-27 21:05:48,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:05:48" (4/4) ... [2022-04-27 21:05:48,169 INFO L111 eAbstractionObserver]: Analyzing ICFG matrix-2.cqvasr [2022-04-27 21:05:48,179 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:05:48,179 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 21:05:48,224 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:05:48,230 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=FINITE_AUTOMATA, 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@78dafd01, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3b7e1582 [2022-04-27 21:05:48,230 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 21:05:48,235 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:05:48,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 21:05:48,239 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:05:48,240 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:05:48,240 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:05:48,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:05:48,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1921619598, now seen corresponding path program 1 times [2022-04-27 21:05:48,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:05:48,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893868475] [2022-04-27 21:05:48,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:05:48,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:05:48,329 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 21:05:48,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1142681464] [2022-04-27 21:05:48,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:05:48,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:05:48,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:05:48,331 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-04-27 21:05:48,332 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-04-27 21:05:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:48,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-27 21:05:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:48,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:05:48,476 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 21:05:48,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} [87] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= (select |v_#length_3| 2) 11) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {32#true} is VALID [2022-04-27 21:05:48,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 21:05:48,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} [120] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 21:05:48,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 21:05:48,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} [89] mainENTRY-->L22-3: Formula: (and (= v_main_~j~0_2 0) (= |v_main_~#matriz~0.offset_1| 0) (= 0 (select |v_#valid_2| |v_main_~#matriz~0.base_1|)) (<= |v_main_#t~nondet6_2| 2147483647) (= |v_main_#t~nondet5_2| v_main_~N_COL~0_1) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#matriz~0.base_1| 1)) (= |v_#length_1| (store |v_#length_2| |v_main_~#matriz~0.base_1| (* (mod v_main_~N_COL~0_1 4294967296) (* (mod v_main_~N_LIN~0_1 4294967296) 4)))) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (< |v_#StackHeapBarrier_1| |v_main_~#matriz~0.base_1|) (= |v_main_#t~nondet6_2| v_main_~maior~0_1) (not (= |v_main_~#matriz~0.base_1| 0)) (= |v_main_#t~nondet4_2| v_main_~N_LIN~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_#t~nondet6=|v_main_#t~nondet6_2|, #valid=|v_#valid_2|, #length=|v_#length_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|, main_~N_LIN~0=v_main_~N_LIN~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_2, #valid=|v_#valid_1|, main_~maior~0=v_main_~maior~0_1, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #length=|v_#length_1|, main_~N_COL~0=v_main_~N_COL~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~#matriz~0.base, main_#t~nondet6, main_~N_LIN~0, main_~k~0, main_~j~0, #valid, main_~maior~0, main_~#matriz~0.offset, #length, main_~N_COL~0] {32#true} is VALID [2022-04-27 21:05:48,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {32#true} [91] L22-3-->L22-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 21:05:48,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#false} [94] L22-4-->L31-3: Formula: (= v_main_~j~0_1 0) InVars {} OutVars{main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] {33#false} is VALID [2022-04-27 21:05:48,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#false} [100] L31-3-->L32-3: Formula: (and (< (mod v_main_~j~0_6 4294967296) (mod v_main_~N_COL~0_4 4294967296)) (= v_main_~k~0_2 0)) InVars {main_~N_COL~0=v_main_~N_COL~0_4, main_~j~0=v_main_~j~0_6} OutVars{main_~N_COL~0=v_main_~N_COL~0_4, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {33#false} is VALID [2022-04-27 21:05:48,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} [107] L32-3-->L33: Formula: (let ((.cse0 (mod v_main_~k~0_6 4294967296)) (.cse1 (mod v_main_~N_LIN~0_4 4294967296))) (and (= |v_main_#t~mem14_1| (select (select |v_#memory_int_1| |v_main_~#matriz~0.base_2|) (+ (* .cse0 4) (* (mod v_main_~j~0_8 4294967296) (* .cse1 4)) |v_main_~#matriz~0.offset_2|))) (< .cse0 .cse1))) InVars {main_~#matriz~0.base=|v_main_~#matriz~0.base_2|, main_~N_LIN~0=v_main_~N_LIN~0_4, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_8, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_2|, #memory_int=|v_#memory_int_1|} OutVars{main_#t~mem14=|v_main_#t~mem14_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_2|, main_~N_LIN~0=v_main_~N_LIN~0_4, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_8, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_2|, #memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[main_#t~mem14] {33#false} is VALID [2022-04-27 21:05:48,480 INFO L272 TraceCheckUtils]: 10: Hoare triple {33#false} [111] L33-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< |v_main_#t~mem14_4| v_main_~maior~0_7) 1 0)) InVars {main_~maior~0=v_main_~maior~0_7, main_#t~mem14=|v_main_#t~mem14_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem14, main_~maior~0] {33#false} is VALID [2022-04-27 21:05:48,480 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} [113] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {33#false} is VALID [2022-04-27 21:05:48,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#false} [115] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 21:05:48,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {33#false} [117] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 21:05:48,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:05:48,482 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 21:05:48,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:05:48,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893868475] [2022-04-27 21:05:48,483 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 21:05:48,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142681464] [2022-04-27 21:05:48,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142681464] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:05:48,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:05:48,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-27 21:05:48,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823857429] [2022-04-27 21:05:48,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:05:48,489 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 21:05:48,490 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:05:48,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:48,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:05:48,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-27 21:05:48,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:05:48,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-27 21:05:48,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-27 21:05:48,530 INFO L87 Difference]: Start difference. First operand has 29 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:48,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:48,581 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-27 21:05:48,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-27 21:05:48,582 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 21:05:48,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:05:48,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:48,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2022-04-27 21:05:48,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:48,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2022-04-27 21:05:48,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 71 transitions. [2022-04-27 21:05:48,670 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:05:48,679 INFO L225 Difference]: With dead ends: 52 [2022-04-27 21:05:48,679 INFO L226 Difference]: Without dead ends: 24 [2022-04-27 21:05:48,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 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-04-27 21:05:48,687 INFO L413 NwaCegarLoop]: 33 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, 33 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-04-27 21:05:48,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:05:48,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-27 21:05:48,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-27 21:05:48,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:05:48,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:05:48,715 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:05:48,715 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:05:48,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:48,719 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-27 21:05:48,719 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-27 21:05:48,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:05:48,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:05:48,721 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 24 states. [2022-04-27 21:05:48,724 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 24 states. [2022-04-27 21:05:48,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:48,732 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-27 21:05:48,732 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-27 21:05:48,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:05:48,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:05:48,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:05:48,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:05:48,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:05:48,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-04-27 21:05:48,738 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 14 [2022-04-27 21:05:48,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:05:48,738 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-04-27 21:05:48,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:48,739 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-27 21:05:48,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 21:05:48,740 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:05:48,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:05:48,763 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-04-27 21:05:48,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-27 21:05:48,952 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:05:48,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:05:48,952 INFO L85 PathProgramCache]: Analyzing trace with hash -178809263, now seen corresponding path program 1 times [2022-04-27 21:05:48,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:05:48,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288285695] [2022-04-27 21:05:48,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:05:48,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:05:48,976 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 21:05:48,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1971158162] [2022-04-27 21:05:48,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:05:48,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:05:48,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:05:48,980 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-04-27 21:05:48,982 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-04-27 21:05:49,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:49,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 21:05:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:49,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:05:49,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {225#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#true} is VALID [2022-04-27 21:05:49,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {225#true} [87] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= (select |v_#length_3| 2) 11) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {225#true} is VALID [2022-04-27 21:05:49,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {225#true} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#true} is VALID [2022-04-27 21:05:49,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {225#true} {225#true} [120] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#true} is VALID [2022-04-27 21:05:49,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {225#true} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#true} is VALID [2022-04-27 21:05:49,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {225#true} [89] mainENTRY-->L22-3: Formula: (and (= v_main_~j~0_2 0) (= |v_main_~#matriz~0.offset_1| 0) (= 0 (select |v_#valid_2| |v_main_~#matriz~0.base_1|)) (<= |v_main_#t~nondet6_2| 2147483647) (= |v_main_#t~nondet5_2| v_main_~N_COL~0_1) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#matriz~0.base_1| 1)) (= |v_#length_1| (store |v_#length_2| |v_main_~#matriz~0.base_1| (* (mod v_main_~N_COL~0_1 4294967296) (* (mod v_main_~N_LIN~0_1 4294967296) 4)))) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (< |v_#StackHeapBarrier_1| |v_main_~#matriz~0.base_1|) (= |v_main_#t~nondet6_2| v_main_~maior~0_1) (not (= |v_main_~#matriz~0.base_1| 0)) (= |v_main_#t~nondet4_2| v_main_~N_LIN~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_#t~nondet6=|v_main_#t~nondet6_2|, #valid=|v_#valid_2|, #length=|v_#length_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|, main_~N_LIN~0=v_main_~N_LIN~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_2, #valid=|v_#valid_1|, main_~maior~0=v_main_~maior~0_1, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #length=|v_#length_1|, main_~N_COL~0=v_main_~N_COL~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~#matriz~0.base, main_#t~nondet6, main_~N_LIN~0, main_~k~0, main_~j~0, #valid, main_~maior~0, main_~#matriz~0.offset, #length, main_~N_COL~0] {245#(= main_~j~0 0)} is VALID [2022-04-27 21:05:49,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {245#(= main_~j~0 0)} [92] L22-3-->L22-4: Formula: (not (< (mod v_main_~j~0_5 4294967296) (mod v_main_~N_COL~0_3 4294967296))) InVars {main_~N_COL~0=v_main_~N_COL~0_3, main_~j~0=v_main_~j~0_5} OutVars{main_~N_COL~0=v_main_~N_COL~0_3, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {249#(not (< 0 (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-27 21:05:49,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {249#(not (< 0 (mod main_~N_COL~0 4294967296)))} [94] L22-4-->L31-3: Formula: (= v_main_~j~0_1 0) InVars {} OutVars{main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] {253#(and (= main_~j~0 0) (not (< 0 (mod main_~N_COL~0 4294967296))))} is VALID [2022-04-27 21:05:49,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {253#(and (= main_~j~0 0) (not (< 0 (mod main_~N_COL~0 4294967296))))} [100] L31-3-->L32-3: Formula: (and (< (mod v_main_~j~0_6 4294967296) (mod v_main_~N_COL~0_4 4294967296)) (= v_main_~k~0_2 0)) InVars {main_~N_COL~0=v_main_~N_COL~0_4, main_~j~0=v_main_~j~0_6} OutVars{main_~N_COL~0=v_main_~N_COL~0_4, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {226#false} is VALID [2022-04-27 21:05:49,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {226#false} [107] L32-3-->L33: Formula: (let ((.cse0 (mod v_main_~k~0_6 4294967296)) (.cse1 (mod v_main_~N_LIN~0_4 4294967296))) (and (= |v_main_#t~mem14_1| (select (select |v_#memory_int_1| |v_main_~#matriz~0.base_2|) (+ (* .cse0 4) (* (mod v_main_~j~0_8 4294967296) (* .cse1 4)) |v_main_~#matriz~0.offset_2|))) (< .cse0 .cse1))) InVars {main_~#matriz~0.base=|v_main_~#matriz~0.base_2|, main_~N_LIN~0=v_main_~N_LIN~0_4, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_8, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_2|, #memory_int=|v_#memory_int_1|} OutVars{main_#t~mem14=|v_main_#t~mem14_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_2|, main_~N_LIN~0=v_main_~N_LIN~0_4, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_8, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_2|, #memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[main_#t~mem14] {226#false} is VALID [2022-04-27 21:05:49,131 INFO L272 TraceCheckUtils]: 10: Hoare triple {226#false} [111] L33-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< |v_main_#t~mem14_4| v_main_~maior~0_7) 1 0)) InVars {main_~maior~0=v_main_~maior~0_7, main_#t~mem14=|v_main_#t~mem14_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem14, main_~maior~0] {226#false} is VALID [2022-04-27 21:05:49,131 INFO L290 TraceCheckUtils]: 11: Hoare triple {226#false} [113] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {226#false} is VALID [2022-04-27 21:05:49,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {226#false} [115] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {226#false} is VALID [2022-04-27 21:05:49,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {226#false} [117] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#false} is VALID [2022-04-27 21:05:49,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:05:49,132 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 21:05:49,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:05:49,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288285695] [2022-04-27 21:05:49,132 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 21:05:49,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971158162] [2022-04-27 21:05:49,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971158162] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:05:49,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:05:49,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 21:05:49,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58032368] [2022-04-27 21:05:49,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:05:49,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 21:05:49,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:05:49,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:49,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:05:49,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 21:05:49,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:05:49,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 21:05:49,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:05:49,145 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:49,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:49,252 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-04-27 21:05:49,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 21:05:49,253 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 21:05:49,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:05:49,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:49,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-04-27 21:05:49,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:49,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-04-27 21:05:49,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 59 transitions. [2022-04-27 21:05:49,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:05:49,302 INFO L225 Difference]: With dead ends: 49 [2022-04-27 21:05:49,303 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 21:05:49,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-04-27 21:05:49,305 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:05:49,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 77 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:05:49,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 21:05:49,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2022-04-27 21:05:49,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:05:49,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:05:49,313 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:05:49,314 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:05:49,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:49,317 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-04-27 21:05:49,317 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-04-27 21:05:49,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:05:49,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:05:49,319 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 35 states. [2022-04-27 21:05:49,319 INFO L87 Difference]: Start difference. First operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 35 states. [2022-04-27 21:05:49,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:49,324 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-04-27 21:05:49,324 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-04-27 21:05:49,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:05:49,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:05:49,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:05:49,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:05:49,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:05:49,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-27 21:05:49,329 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 14 [2022-04-27 21:05:49,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:05:49,330 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-27 21:05:49,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:49,332 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-27 21:05:49,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 21:05:49,333 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:05:49,333 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:05:49,351 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-04-27 21:05:49,539 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,SelfDestructingSolverStorable1 [2022-04-27 21:05:49,540 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:05:49,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:05:49,540 INFO L85 PathProgramCache]: Analyzing trace with hash 490549227, now seen corresponding path program 1 times [2022-04-27 21:05:49,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:05:49,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528500004] [2022-04-27 21:05:49,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:05:49,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:05:49,556 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 21:05:49,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1380642502] [2022-04-27 21:05:49,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:05:49,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:05:49,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:05:49,568 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-04-27 21:05:49,569 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-04-27 21:05:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:49,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 21:05:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:49,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:05:49,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {446#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {446#true} is VALID [2022-04-27 21:05:49,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {446#true} [87] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= (select |v_#length_3| 2) 11) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {446#true} is VALID [2022-04-27 21:05:49,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {446#true} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {446#true} is VALID [2022-04-27 21:05:49,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {446#true} {446#true} [120] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {446#true} is VALID [2022-04-27 21:05:49,730 INFO L272 TraceCheckUtils]: 4: Hoare triple {446#true} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {446#true} is VALID [2022-04-27 21:05:49,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {446#true} [89] mainENTRY-->L22-3: Formula: (and (= v_main_~j~0_2 0) (= |v_main_~#matriz~0.offset_1| 0) (= 0 (select |v_#valid_2| |v_main_~#matriz~0.base_1|)) (<= |v_main_#t~nondet6_2| 2147483647) (= |v_main_#t~nondet5_2| v_main_~N_COL~0_1) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#matriz~0.base_1| 1)) (= |v_#length_1| (store |v_#length_2| |v_main_~#matriz~0.base_1| (* (mod v_main_~N_COL~0_1 4294967296) (* (mod v_main_~N_LIN~0_1 4294967296) 4)))) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (< |v_#StackHeapBarrier_1| |v_main_~#matriz~0.base_1|) (= |v_main_#t~nondet6_2| v_main_~maior~0_1) (not (= |v_main_~#matriz~0.base_1| 0)) (= |v_main_#t~nondet4_2| v_main_~N_LIN~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_#t~nondet6=|v_main_#t~nondet6_2|, #valid=|v_#valid_2|, #length=|v_#length_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|, main_~N_LIN~0=v_main_~N_LIN~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_2, #valid=|v_#valid_1|, main_~maior~0=v_main_~maior~0_1, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #length=|v_#length_1|, main_~N_COL~0=v_main_~N_COL~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~#matriz~0.base, main_#t~nondet6, main_~N_LIN~0, main_~k~0, main_~j~0, #valid, main_~maior~0, main_~#matriz~0.offset, #length, main_~N_COL~0] {446#true} is VALID [2022-04-27 21:05:49,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {446#true} [93] L22-3-->L23-3: Formula: (and (< (mod v_main_~j~0_7 4294967296) (mod v_main_~N_COL~0_5 4294967296)) (= v_main_~k~0_3 0)) InVars {main_~N_COL~0=v_main_~N_COL~0_5, main_~j~0=v_main_~j~0_7} OutVars{main_~N_COL~0=v_main_~N_COL~0_5, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~k~0] {469#(= main_~k~0 0)} is VALID [2022-04-27 21:05:49,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {469#(= main_~k~0 0)} [96] L23-3-->L22-2: Formula: (not (< (mod v_main_~k~0_5 4294967296) (mod v_main_~N_LIN~0_3 4294967296))) InVars {main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_5} OutVars{main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {473#(not (< 0 (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-27 21:05:49,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {473#(not (< 0 (mod main_~N_LIN~0 4294967296)))} [101] L22-2-->L22-3: Formula: (= v_main_~j~0_13 (+ v_main_~j~0_14 1)) InVars {main_~j~0=v_main_~j~0_14} OutVars{main_~j~0=v_main_~j~0_13, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~j~0, main_#t~post7] {473#(not (< 0 (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-27 21:05:49,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {473#(not (< 0 (mod main_~N_LIN~0 4294967296)))} [92] L22-3-->L22-4: Formula: (not (< (mod v_main_~j~0_5 4294967296) (mod v_main_~N_COL~0_3 4294967296))) InVars {main_~N_COL~0=v_main_~N_COL~0_3, main_~j~0=v_main_~j~0_5} OutVars{main_~N_COL~0=v_main_~N_COL~0_3, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {473#(not (< 0 (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-27 21:05:49,732 INFO L290 TraceCheckUtils]: 10: Hoare triple {473#(not (< 0 (mod main_~N_LIN~0 4294967296)))} [94] L22-4-->L31-3: Formula: (= v_main_~j~0_1 0) InVars {} OutVars{main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] {473#(not (< 0 (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-27 21:05:49,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {473#(not (< 0 (mod main_~N_LIN~0 4294967296)))} [100] L31-3-->L32-3: Formula: (and (< (mod v_main_~j~0_6 4294967296) (mod v_main_~N_COL~0_4 4294967296)) (= v_main_~k~0_2 0)) InVars {main_~N_COL~0=v_main_~N_COL~0_4, main_~j~0=v_main_~j~0_6} OutVars{main_~N_COL~0=v_main_~N_COL~0_4, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {486#(and (= main_~k~0 0) (not (< 0 (mod main_~N_LIN~0 4294967296))))} is VALID [2022-04-27 21:05:49,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {486#(and (= main_~k~0 0) (not (< 0 (mod main_~N_LIN~0 4294967296))))} [107] L32-3-->L33: Formula: (let ((.cse0 (mod v_main_~k~0_6 4294967296)) (.cse1 (mod v_main_~N_LIN~0_4 4294967296))) (and (= |v_main_#t~mem14_1| (select (select |v_#memory_int_1| |v_main_~#matriz~0.base_2|) (+ (* .cse0 4) (* (mod v_main_~j~0_8 4294967296) (* .cse1 4)) |v_main_~#matriz~0.offset_2|))) (< .cse0 .cse1))) InVars {main_~#matriz~0.base=|v_main_~#matriz~0.base_2|, main_~N_LIN~0=v_main_~N_LIN~0_4, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_8, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_2|, #memory_int=|v_#memory_int_1|} OutVars{main_#t~mem14=|v_main_#t~mem14_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_2|, main_~N_LIN~0=v_main_~N_LIN~0_4, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_8, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_2|, #memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[main_#t~mem14] {447#false} is VALID [2022-04-27 21:05:49,735 INFO L272 TraceCheckUtils]: 13: Hoare triple {447#false} [111] L33-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< |v_main_#t~mem14_4| v_main_~maior~0_7) 1 0)) InVars {main_~maior~0=v_main_~maior~0_7, main_#t~mem14=|v_main_#t~mem14_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem14, main_~maior~0] {447#false} is VALID [2022-04-27 21:05:49,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {447#false} [113] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {447#false} is VALID [2022-04-27 21:05:49,735 INFO L290 TraceCheckUtils]: 15: Hoare triple {447#false} [115] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {447#false} is VALID [2022-04-27 21:05:49,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {447#false} [117] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {447#false} is VALID [2022-04-27 21:05:49,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:05:49,736 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 21:05:49,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:05:49,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528500004] [2022-04-27 21:05:49,736 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 21:05:49,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380642502] [2022-04-27 21:05:49,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380642502] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:05:49,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:05:49,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 21:05:49,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560747557] [2022-04-27 21:05:49,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:05:49,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 21:05:49,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:05:49,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:49,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:05:49,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 21:05:49,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:05:49,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 21:05:49,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:05:49,752 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:49,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:49,876 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-04-27 21:05:49,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 21:05:49,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 21:05:49,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:05:49,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:49,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-04-27 21:05:49,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:49,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-04-27 21:05:49,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 71 transitions. [2022-04-27 21:05:49,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:05:49,946 INFO L225 Difference]: With dead ends: 57 [2022-04-27 21:05:49,946 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 21:05:49,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-04-27 21:05:49,949 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 11 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:05:49,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 80 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:05:49,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 21:05:49,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2022-04-27 21:05:49,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:05:49,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:05:49,952 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:05:49,952 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:05:49,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:49,954 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-27 21:05:49,954 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-27 21:05:49,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:05:49,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:05:49,954 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 32 states. [2022-04-27 21:05:49,954 INFO L87 Difference]: Start difference. First operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 32 states. [2022-04-27 21:05:49,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:49,956 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-27 21:05:49,956 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-27 21:05:49,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:05:49,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:05:49,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:05:49,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:05:49,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:05:49,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-27 21:05:49,957 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 17 [2022-04-27 21:05:49,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:05:49,957 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-27 21:05:49,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:49,958 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 21:05:49,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 21:05:49,958 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:05:49,958 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] [2022-04-27 21:05:49,974 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-04-27 21:05:50,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:05:50,171 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:05:50,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:05:50,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1532617408, now seen corresponding path program 1 times [2022-04-27 21:05:50,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:05:50,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376281939] [2022-04-27 21:05:50,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:05:50,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:05:50,187 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 21:05:50,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [729303727] [2022-04-27 21:05:50,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:05:50,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:05:50,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:05:50,188 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-04-27 21:05:50,201 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-04-27 21:05:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 21:05:50,250 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 21:05:50,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 21:05:50,271 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 21:05:50,272 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 21:05:50,272 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 21:05:50,321 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-04-27 21:05:50,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:05:50,476 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-04-27 21:05:50,478 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 21:05:50,493 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 21:05:50,494 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 21:05:50,494 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 21:05:50,494 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 21:05:50,494 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:05:50,494 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-04-27 21:05:50,494 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-04-27 21:05:50,494 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-04-27 21:05:50,494 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 21:05:50,494 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 21:05:50,494 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 21:05:50,494 WARN L170 areAnnotationChecker]: L22-4 has no Hoare annotation [2022-04-27 21:05:50,494 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2022-04-27 21:05:50,494 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2022-04-27 21:05:50,494 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2022-04-27 21:05:50,494 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 21:05:50,494 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 21:05:50,494 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-27 21:05:50,495 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 21:05:50,495 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2022-04-27 21:05:50,495 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2022-04-27 21:05:50,495 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2022-04-27 21:05:50,495 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-04-27 21:05:50,495 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-27 21:05:50,495 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-27 21:05:50,495 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:05:50,495 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2022-04-27 21:05:50,495 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-04-27 21:05:50,495 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-04-27 21:05:50,495 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-04-27 21:05:50,495 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2022-04-27 21:05:50,495 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-27 21:05:50,495 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 21:05:50,495 WARN L170 areAnnotationChecker]: L31-2 has no Hoare annotation [2022-04-27 21:05:50,495 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 21:05:50,495 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2022-04-27 21:05:50,495 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 21:05:50,495 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 21:05:50,495 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 21:05:50,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:05:50 BasicIcfg [2022-04-27 21:05:50,496 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 21:05:50,497 INFO L158 Benchmark]: Toolchain (without parser) took 2987.12ms. Allocated memory was 213.9MB in the beginning and 333.4MB in the end (delta: 119.5MB). Free memory was 158.1MB in the beginning and 173.8MB in the end (delta: -15.6MB). Peak memory consumption was 103.5MB. Max. memory is 8.0GB. [2022-04-27 21:05:50,497 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 213.9MB. Free memory was 174.3MB in the beginning and 174.1MB in the end (delta: 129.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 21:05:50,497 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.42ms. Allocated memory was 213.9MB in the beginning and 333.4MB in the end (delta: 119.5MB). Free memory was 158.0MB in the beginning and 305.4MB in the end (delta: -147.4MB). Peak memory consumption was 8.5MB. Max. memory is 8.0GB. [2022-04-27 21:05:50,497 INFO L158 Benchmark]: Boogie Preprocessor took 46.39ms. Allocated memory is still 333.4MB. Free memory was 305.4MB in the beginning and 303.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 21:05:50,498 INFO L158 Benchmark]: RCFGBuilder took 278.60ms. Allocated memory is still 333.4MB. Free memory was 303.8MB in the beginning and 289.6MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-27 21:05:50,498 INFO L158 Benchmark]: IcfgTransformer took 57.45ms. Allocated memory is still 333.4MB. Free memory was 289.6MB in the beginning and 287.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 21:05:50,498 INFO L158 Benchmark]: TraceAbstraction took 2336.75ms. Allocated memory is still 333.4MB. Free memory was 287.0MB in the beginning and 173.8MB in the end (delta: 113.2MB). Peak memory consumption was 113.2MB. Max. memory is 8.0GB. [2022-04-27 21:05:50,499 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 213.9MB. Free memory was 174.3MB in the beginning and 174.1MB in the end (delta: 129.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 262.42ms. Allocated memory was 213.9MB in the beginning and 333.4MB in the end (delta: 119.5MB). Free memory was 158.0MB in the beginning and 305.4MB in the end (delta: -147.4MB). Peak memory consumption was 8.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.39ms. Allocated memory is still 333.4MB. Free memory was 305.4MB in the beginning and 303.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 278.60ms. Allocated memory is still 333.4MB. Free memory was 303.8MB in the beginning and 289.6MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 57.45ms. Allocated memory is still 333.4MB. Free memory was 289.6MB in the beginning and 287.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 2336.75ms. Allocated memory is still 333.4MB. Free memory was 287.0MB in the beginning and 173.8MB in the end (delta: 113.2MB). Peak memory consumption was 113.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 7]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] unsigned int N_LIN=__VERIFIER_nondet_uint(); [L17] unsigned int N_COL=__VERIFIER_nondet_uint(); [L18] unsigned int j,k; [L19] int matriz[N_COL][N_LIN], maior; [L21] maior = __VERIFIER_nondet_int() [L22] j=0 VAL [j=0, maior=-1, matriz={4:0}, N_COL=1, N_LIN=1] [L22] COND TRUE jmaior [L28] EXPR matriz[j][k] [L28] maior = matriz[j][k] [L23] k++ VAL [j=0, k=1, maior=0, matriz={4:0}, N_COL=1, N_LIN=1] [L23] COND FALSE !(k