/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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/matrix-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:17:09,857 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:17:09,858 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:17:09,892 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:17:09,892 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:17:09,893 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:17:09,894 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:17:09,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:17:09,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:17:09,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:17:09,897 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:17:09,898 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:17:09,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:17:09,899 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:17:09,900 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:17:09,901 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:17:09,901 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:17:09,902 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:17:09,903 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:17:09,905 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:17:09,906 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:17:09,907 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:17:09,907 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:17:09,908 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:17:09,909 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:17:09,911 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:17:09,911 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:17:09,911 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:17:09,912 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:17:09,912 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:17:09,913 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:17:09,913 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:17:09,917 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:17:09,920 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:17:09,920 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:17:09,921 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:17:09,921 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:17:09,922 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:17:09,922 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:17:09,922 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:17:09,923 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:17:09,925 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:17:09,926 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:17:09,945 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:17:09,946 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:17:09,946 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:17:09,946 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:17:09,946 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:17:09,947 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:17:09,947 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:17:09,947 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:17:09,947 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:17:09,947 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:17:09,947 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:17:09,947 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:17:09,948 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:17:09,948 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:17:09,948 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:17:09,948 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:17:09,948 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:17:09,948 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:17:09,948 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:17:09,948 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:17:09,948 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:17:09,948 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:17:09,949 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:17:09,949 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:17:09,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:17:09,949 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:17:09,949 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:17:09,949 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:17:09,949 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:17:09,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:17:09,949 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:17:09,949 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:17:09,949 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:17:09,950 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 10:17:10,129 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:17:10,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:17:10,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:17:10,144 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:17:10,148 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:17:10,149 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 10:17:10,205 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f7d3a4ac/ae77499abad24db2b068fbf80482f5ec/FLAGd3cf09a45 [2022-04-27 10:17:10,520 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:17:10,520 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/matrix-2.c [2022-04-27 10:17:10,525 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f7d3a4ac/ae77499abad24db2b068fbf80482f5ec/FLAGd3cf09a45 [2022-04-27 10:17:10,949 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f7d3a4ac/ae77499abad24db2b068fbf80482f5ec [2022-04-27 10:17:10,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:17:10,953 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:17:10,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:17:10,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:17:10,958 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:17:10,959 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:17:10" (1/1) ... [2022-04-27 10:17:10,960 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72c02124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:10, skipping insertion in model container [2022-04-27 10:17:10,960 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:17:10" (1/1) ... [2022-04-27 10:17:10,964 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:17:10,975 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:17:11,066 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 10:17:11,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:17:11,107 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:17:11,115 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 10:17:11,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:17:11,133 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:17:11,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:11 WrapperNode [2022-04-27 10:17:11,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:17:11,134 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:17:11,134 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:17:11,134 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:17:11,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:11" (1/1) ... [2022-04-27 10:17:11,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:11" (1/1) ... [2022-04-27 10:17:11,155 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:11" (1/1) ... [2022-04-27 10:17:11,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:11" (1/1) ... [2022-04-27 10:17:11,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:11" (1/1) ... [2022-04-27 10:17:11,165 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:11" (1/1) ... [2022-04-27 10:17:11,166 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:11" (1/1) ... [2022-04-27 10:17:11,167 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:17:11,168 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:17:11,168 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:17:11,168 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:17:11,168 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:11" (1/1) ... [2022-04-27 10:17:11,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:17:11,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:17:11,202 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 10:17:11,213 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 10:17:11,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:17:11,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:17:11,230 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:17:11,231 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:17:11,232 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:17:11,232 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:17:11,232 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:17:11,232 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:17:11,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:17:11,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:17:11,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 10:17:11,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:17:11,233 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:17:11,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-27 10:17:11,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:17:11,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:17:11,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:17:11,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:17:11,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:17:11,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:17:11,298 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:17:11,299 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:17:11,576 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:17:11,584 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:17:11,584 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-27 10:17:11,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:17:11 BoogieIcfgContainer [2022-04-27 10:17:11,585 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:17:11,587 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:17:11,587 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:17:11,589 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:17:11,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:17:10" (1/3) ... [2022-04-27 10:17:11,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5146c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:17:11, skipping insertion in model container [2022-04-27 10:17:11,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:11" (2/3) ... [2022-04-27 10:17:11,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5146c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:17:11, skipping insertion in model container [2022-04-27 10:17:11,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:17:11" (3/3) ... [2022-04-27 10:17:11,592 INFO L111 eAbstractionObserver]: Analyzing ICFG matrix-2.c [2022-04-27 10:17:11,602 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:17:11,602 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:17:11,651 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:17:11,664 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@25cf7ddf, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@55f24ce8 [2022-04-27 10:17:11,664 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:17:11,673 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 10:17:11,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 10:17:11,678 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:17:11,679 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:17:11,679 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:17:11,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:17:11,684 INFO L85 PathProgramCache]: Analyzing trace with hash -691068696, now seen corresponding path program 1 times [2022-04-27 10:17:11,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:17:11,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591912413] [2022-04-27 10:17:11,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:11,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:17:11,788 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 10:17:11,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1154545547] [2022-04-27 10:17:11,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:11,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:17:11,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:17:11,790 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 10:17:11,791 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 10:17:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:11,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 10:17:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:11,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:17:11,990 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2022-04-27 10:17:11,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-27 10:17:11,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-27 10:17:11,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #82#return; {32#true} is VALID [2022-04-27 10:17:11,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret15 := main(); {32#true} is VALID [2022-04-27 10:17:11,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} ~N_LIN~0 := #t~nondet4;havoc #t~nondet4;~N_COL~0 := #t~nondet5;havoc #t~nondet5;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.allocOnStack(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~maior~0 := #t~nondet6;havoc #t~nondet6;~j~0 := 0; {52#(= main_~j~0 0)} is VALID [2022-04-27 10:17:11,993 INFO L290 TraceCheckUtils]: 6: Hoare triple {52#(= main_~j~0 0)} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {56#(not (< 0 (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-27 10:17:11,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {56#(not (< 0 (mod main_~N_COL~0 4294967296)))} ~j~0 := 0; {60#(and (= main_~j~0 0) (not (< 0 (mod main_~N_COL~0 4294967296))))} is VALID [2022-04-27 10:17:11,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {60#(and (= main_~j~0 0) (not (< 0 (mod main_~N_COL~0 4294967296))))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {33#false} is VALID [2022-04-27 10:17:11,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);call #t~mem14 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); {33#false} is VALID [2022-04-27 10:17:11,995 INFO L272 TraceCheckUtils]: 10: Hoare triple {33#false} call __VERIFIER_assert((if #t~mem14 < ~maior~0 then 1 else 0)); {33#false} is VALID [2022-04-27 10:17:11,995 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-27 10:17:11,995 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-27 10:17:11,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-27 10:17:11,997 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 10:17:11,997 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 10:17:11,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:17:11,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591912413] [2022-04-27 10:17:11,997 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 10:17:11,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154545547] [2022-04-27 10:17:11,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154545547] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:17:11,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:17:11,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:17:12,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449738505] [2022-04-27 10:17:12,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:17:12,006 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 10:17:12,008 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:17:12,010 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 10:17:12,028 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 10:17:12,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:17:12,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:17:12,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:17:12,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:17:12,050 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 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 10:17:12,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:12,269 INFO L93 Difference]: Finished difference Result 68 states and 100 transitions. [2022-04-27 10:17:12,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:17:12,269 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 10:17:12,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:17:12,271 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 10:17:12,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-04-27 10:17:12,284 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 10:17:12,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-04-27 10:17:12,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 100 transitions. [2022-04-27 10:17:12,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:12,372 INFO L225 Difference]: With dead ends: 68 [2022-04-27 10:17:12,372 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 10:17:12,374 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 10:17:12,377 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:17:12,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 93 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:17:12,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 10:17:12,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2022-04-27 10:17:12,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:17:12,410 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 10:17:12,411 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 10:17:12,411 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 10:17:12,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:12,414 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-04-27 10:17:12,414 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-04-27 10:17:12,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:12,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:12,415 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 10:17:12,415 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 10:17:12,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:12,417 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-04-27 10:17:12,417 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-04-27 10:17:12,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:12,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:12,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:17:12,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:17:12,418 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 10:17:12,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-27 10:17:12,420 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 14 [2022-04-27 10:17:12,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:17:12,420 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-27 10:17:12,420 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 10:17:12,420 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-27 10:17:12,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 10:17:12,421 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:17:12,421 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 10:17:12,439 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 10:17:12,639 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 10:17:12,640 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:17:12,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:17:12,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1002836895, now seen corresponding path program 1 times [2022-04-27 10:17:12,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:17:12,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116196709] [2022-04-27 10:17:12,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:12,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:17:12,667 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 10:17:12,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [471080312] [2022-04-27 10:17:12,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:12,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:17:12,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:17:12,677 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 10:17:12,678 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 10:17:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:12,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 10:17:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:12,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:17:12,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {274#true} call ULTIMATE.init(); {274#true} is VALID [2022-04-27 10:17:12,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {274#true} is VALID [2022-04-27 10:17:12,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {274#true} assume true; {274#true} is VALID [2022-04-27 10:17:12,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {274#true} {274#true} #82#return; {274#true} is VALID [2022-04-27 10:17:12,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {274#true} call #t~ret15 := main(); {274#true} is VALID [2022-04-27 10:17:12,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {274#true} ~N_LIN~0 := #t~nondet4;havoc #t~nondet4;~N_COL~0 := #t~nondet5;havoc #t~nondet5;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.allocOnStack(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~maior~0 := #t~nondet6;havoc #t~nondet6;~j~0 := 0; {274#true} is VALID [2022-04-27 10:17:12,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {274#true} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {297#(= main_~k~0 0)} is VALID [2022-04-27 10:17:12,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {297#(= main_~k~0 0)} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {301#(not (< 0 (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-27 10:17:12,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {301#(not (< 0 (mod main_~N_LIN~0 4294967296)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {301#(not (< 0 (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-27 10:17:12,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {301#(not (< 0 (mod main_~N_LIN~0 4294967296)))} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {301#(not (< 0 (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-27 10:17:12,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {301#(not (< 0 (mod main_~N_LIN~0 4294967296)))} ~j~0 := 0; {301#(not (< 0 (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-27 10:17:12,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {301#(not (< 0 (mod main_~N_LIN~0 4294967296)))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {314#(and (= main_~k~0 0) (not (< 0 (mod main_~N_LIN~0 4294967296))))} is VALID [2022-04-27 10:17:12,810 INFO L290 TraceCheckUtils]: 12: Hoare triple {314#(and (= main_~k~0 0) (not (< 0 (mod main_~N_LIN~0 4294967296))))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);call #t~mem14 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); {275#false} is VALID [2022-04-27 10:17:12,810 INFO L272 TraceCheckUtils]: 13: Hoare triple {275#false} call __VERIFIER_assert((if #t~mem14 < ~maior~0 then 1 else 0)); {275#false} is VALID [2022-04-27 10:17:12,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {275#false} ~cond := #in~cond; {275#false} is VALID [2022-04-27 10:17:12,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {275#false} assume 0 == ~cond; {275#false} is VALID [2022-04-27 10:17:12,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {275#false} assume !false; {275#false} is VALID [2022-04-27 10:17:12,811 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 10:17:12,811 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 10:17:12,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:17:12,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116196709] [2022-04-27 10:17:12,811 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 10:17:12,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471080312] [2022-04-27 10:17:12,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471080312] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:17:12,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:17:12,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:17:12,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821454744] [2022-04-27 10:17:12,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:17:12,812 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 10:17:12,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:17:12,813 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 10:17:12,825 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 10:17:12,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:17:12,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:17:12,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:17:12,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:17:12,827 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 10:17:12,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:12,952 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-04-27 10:17:12,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:17:12,952 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 10:17:12,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:17:12,953 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 10:17:12,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-04-27 10:17:12,954 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 10:17:12,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-04-27 10:17:12,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 71 transitions. [2022-04-27 10:17:13,013 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 10:17:13,015 INFO L225 Difference]: With dead ends: 57 [2022-04-27 10:17:13,015 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 10:17:13,016 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 10:17:13,017 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 18 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:17:13,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 64 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:17:13,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 10:17:13,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2022-04-27 10:17:13,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:17:13,023 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 10:17:13,025 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 10:17:13,025 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 10:17:13,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:13,026 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-27 10:17:13,027 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-27 10:17:13,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:13,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:13,028 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 10:17:13,028 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 10:17:13,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:13,032 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-27 10:17:13,032 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-27 10:17:13,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:13,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:13,032 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:17:13,032 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:17:13,032 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 10:17:13,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-27 10:17:13,034 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 17 [2022-04-27 10:17:13,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:17:13,034 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-27 10:17:13,034 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 10:17:13,035 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 10:17:13,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 10:17:13,036 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:17:13,036 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 10:17:13,054 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 10:17:13,247 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 10:17:13,248 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:17:13,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:17:13,248 INFO L85 PathProgramCache]: Analyzing trace with hash -230396703, now seen corresponding path program 1 times [2022-04-27 10:17:13,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:17:13,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274856072] [2022-04-27 10:17:13,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:13,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:17:13,263 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 10:17:13,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1278714386] [2022-04-27 10:17:13,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:13,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:17:13,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:17:13,264 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 10:17:13,265 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 10:17:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 10:17:13,316 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 10:17:13,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 10:17:13,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 10:17:13,345 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 10:17:13,346 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:17:13,367 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 10:17:13,547 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 10:17:13,550 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 10:17:13,552 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:17:13,569 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:17:13,569 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 10:17:13,569 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 10:17:13,569 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 10:17:13,569 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 10:17:13,569 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 10:17:13,569 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 10:17:13,569 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:17:13,569 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 10:17:13,569 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 10:17:13,569 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-04-27 10:17:13,569 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-04-27 10:17:13,569 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-04-27 10:17:13,570 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 10:17:13,570 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 10:17:13,570 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:17:13,570 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:17:13,570 WARN L170 areAnnotationChecker]: L22-4 has no Hoare annotation [2022-04-27 10:17:13,570 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2022-04-27 10:17:13,570 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2022-04-27 10:17:13,570 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2022-04-27 10:17:13,570 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:17:13,570 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:17:13,570 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-27 10:17:13,570 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2022-04-27 10:17:13,570 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2022-04-27 10:17:13,570 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2022-04-27 10:17:13,570 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-04-27 10:17:13,571 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-27 10:17:13,571 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-27 10:17:13,571 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:17:13,571 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2022-04-27 10:17:13,571 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-04-27 10:17:13,571 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-04-27 10:17:13,571 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-04-27 10:17:13,571 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2022-04-27 10:17:13,571 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-27 10:17:13,571 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:17:13,571 WARN L170 areAnnotationChecker]: L31-2 has no Hoare annotation [2022-04-27 10:17:13,571 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 10:17:13,571 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 10:17:13,571 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2022-04-27 10:17:13,571 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:17:13,572 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 10:17:13,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:17:13 BoogieIcfgContainer [2022-04-27 10:17:13,572 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:17:13,573 INFO L158 Benchmark]: Toolchain (without parser) took 2619.85ms. Allocated memory was 194.0MB in the beginning and 256.9MB in the end (delta: 62.9MB). Free memory was 137.2MB in the beginning and 183.6MB in the end (delta: -46.4MB). Peak memory consumption was 17.1MB. Max. memory is 8.0GB. [2022-04-27 10:17:13,574 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 194.0MB. Free memory is still 153.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:17:13,582 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.59ms. Allocated memory was 194.0MB in the beginning and 256.9MB in the end (delta: 62.9MB). Free memory was 137.0MB in the beginning and 227.0MB in the end (delta: -90.0MB). Peak memory consumption was 8.8MB. Max. memory is 8.0GB. [2022-04-27 10:17:13,583 INFO L158 Benchmark]: Boogie Preprocessor took 33.12ms. Allocated memory is still 256.9MB. Free memory was 227.0MB in the beginning and 225.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 10:17:13,583 INFO L158 Benchmark]: RCFGBuilder took 417.77ms. Allocated memory is still 256.9MB. Free memory was 225.0MB in the beginning and 210.7MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-27 10:17:13,583 INFO L158 Benchmark]: TraceAbstraction took 1985.29ms. Allocated memory is still 256.9MB. Free memory was 210.3MB in the beginning and 184.2MB in the end (delta: 26.1MB). Peak memory consumption was 27.5MB. Max. memory is 8.0GB. [2022-04-27 10:17:13,584 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 194.0MB. Free memory is still 153.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 177.59ms. Allocated memory was 194.0MB in the beginning and 256.9MB in the end (delta: 62.9MB). Free memory was 137.0MB in the beginning and 227.0MB in the end (delta: -90.0MB). Peak memory consumption was 8.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.12ms. Allocated memory is still 256.9MB. Free memory was 227.0MB in the beginning and 225.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 417.77ms. Allocated memory is still 256.9MB. Free memory was 225.0MB in the beginning and 210.7MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 1985.29ms. Allocated memory is still 256.9MB. Free memory was 210.3MB in the beginning and 184.2MB in the end (delta: 26.1MB). Peak memory consumption was 27.5MB. 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=0, 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=1, matriz={4:0}, N_COL=1, N_LIN=1] [L23] COND FALSE !(k