/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/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops/matrix-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 15:56:19,605 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 15:56:19,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 15:56:19,645 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 15:56:19,647 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 15:56:19,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 15:56:19,649 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 15:56:19,650 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 15:56:19,650 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 15:56:19,651 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 15:56:19,651 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 15:56:19,652 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 15:56:19,652 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 15:56:19,653 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 15:56:19,654 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 15:56:19,654 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 15:56:19,655 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 15:56:19,655 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 15:56:19,656 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 15:56:19,657 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 15:56:19,658 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 15:56:19,660 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 15:56:19,661 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 15:56:19,662 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 15:56:19,662 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 15:56:19,664 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 15:56:19,664 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 15:56:19,664 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 15:56:19,665 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 15:56:19,665 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 15:56:19,666 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 15:56:19,666 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 15:56:19,667 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 15:56:19,667 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 15:56:19,668 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 15:56:19,668 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 15:56:19,668 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 15:56:19,669 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 15:56:19,669 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 15:56:19,669 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 15:56:19,670 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 15:56:19,671 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 15:56:19,671 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 15:56:19,677 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 15:56:19,678 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 15:56:19,678 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 15:56:19,679 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 15:56:19,679 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 15:56:19,679 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 15:56:19,679 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 15:56:19,679 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 15:56:19,679 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 15:56:19,679 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 15:56:19,679 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 15:56:19,680 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 15:56:19,680 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 15:56:19,680 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 15:56:19,680 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 15:56:19,680 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 15:56:19,680 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 15:56:19,680 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 15:56:19,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:56:19,680 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 15:56:19,680 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 15:56:19,681 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 15:56:19,681 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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 15:56:19,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 15:56:19,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 15:56:19,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 15:56:19,866 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 15:56:19,869 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 15:56:19,870 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 15:56:19,918 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf41b2b25/86ccf1dd1b8f49ed8bf1042153fae7df/FLAGaffd1d84b [2022-04-27 15:56:20,286 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 15:56:20,287 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/matrix-2.c [2022-04-27 15:56:20,292 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf41b2b25/86ccf1dd1b8f49ed8bf1042153fae7df/FLAGaffd1d84b [2022-04-27 15:56:20,305 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf41b2b25/86ccf1dd1b8f49ed8bf1042153fae7df [2022-04-27 15:56:20,307 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 15:56:20,309 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 15:56:20,311 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 15:56:20,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 15:56:20,314 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 15:56:20,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:56:20" (1/1) ... [2022-04-27 15:56:20,315 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@704bdecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:20, skipping insertion in model container [2022-04-27 15:56:20,315 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:56:20" (1/1) ... [2022-04-27 15:56:20,320 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 15:56:20,331 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 15:56:20,435 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 15:56:20,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:56:20,462 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 15:56:20,471 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 15:56:20,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:56:20,486 INFO L208 MainTranslator]: Completed translation [2022-04-27 15:56:20,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:20 WrapperNode [2022-04-27 15:56:20,486 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 15:56:20,487 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 15:56:20,487 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 15:56:20,487 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 15:56:20,498 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:20" (1/1) ... [2022-04-27 15:56:20,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:20" (1/1) ... [2022-04-27 15:56:20,504 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:20" (1/1) ... [2022-04-27 15:56:20,504 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:20" (1/1) ... [2022-04-27 15:56:20,509 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:20" (1/1) ... [2022-04-27 15:56:20,512 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:20" (1/1) ... [2022-04-27 15:56:20,522 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:20" (1/1) ... [2022-04-27 15:56:20,523 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 15:56:20,524 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 15:56:20,524 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 15:56:20,524 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 15:56:20,525 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:20" (1/1) ... [2022-04-27 15:56:20,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:56:20,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:56:20,547 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 15:56:20,548 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 15:56:20,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 15:56:20,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 15:56:20,572 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 15:56:20,572 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 15:56:20,572 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 15:56:20,572 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 15:56:20,572 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 15:56:20,573 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 15:56:20,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 15:56:20,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 15:56:20,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 15:56:20,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 15:56:20,573 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 15:56:20,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-27 15:56:20,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 15:56:20,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 15:56:20,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 15:56:20,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 15:56:20,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 15:56:20,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 15:56:20,621 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 15:56:20,622 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 15:56:20,843 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 15:56:20,848 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 15:56:20,848 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-27 15:56:20,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:56:20 BoogieIcfgContainer [2022-04-27 15:56:20,849 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 15:56:20,849 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 15:56:20,850 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 15:56:20,850 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 15:56:20,854 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:56:20" (1/1) ... [2022-04-27 15:56:20,855 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 15:56:20,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 03:56:20 BasicIcfg [2022-04-27 15:56:20,890 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 15:56:20,891 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 15:56:20,892 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 15:56:20,893 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 15:56:20,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 03:56:20" (1/4) ... [2022-04-27 15:56:20,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70cd4ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:56:20, skipping insertion in model container [2022-04-27 15:56:20,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:20" (2/4) ... [2022-04-27 15:56:20,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70cd4ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:56:20, skipping insertion in model container [2022-04-27 15:56:20,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:56:20" (3/4) ... [2022-04-27 15:56:20,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70cd4ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:56:20, skipping insertion in model container [2022-04-27 15:56:20,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 03:56:20" (4/4) ... [2022-04-27 15:56:20,896 INFO L111 eAbstractionObserver]: Analyzing ICFG matrix-2.cJordan [2022-04-27 15:56:20,906 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 15:56:20,906 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 15:56:20,947 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 15:56:20,958 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1c37b14c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@bc495a0 [2022-04-27 15:56:20,958 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 15:56:20,967 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 15:56:20,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 15:56:20,982 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:20,982 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:56:20,983 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:20,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:20,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1921619598, now seen corresponding path program 1 times [2022-04-27 15:56:20,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:20,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239527650] [2022-04-27 15:56:20,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:20,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:21,091 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 15:56:21,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1122711384] [2022-04-27 15:56:21,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:21,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:56:21,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:56:21,094 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 15:56:21,119 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 15:56:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:21,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-27 15:56:21,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:21,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 15:56:21,235 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 15:56:21,236 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 15:56:21,236 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 15:56:21,237 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 15:56:21,237 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 15:56:21,237 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_#length_1| (store |v_#length_2| |v_main_~#matriz~0.base_1| (* (let ((.cse0 (mod v_main_~N_COL~0_1 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) (* (let ((.cse1 (mod v_main_~N_LIN~0_1 4294967296))) (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296)))) 4)))) (= |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)) (<= 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 15:56:21,238 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 15:56:21,238 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 15:56:21,239 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 15:56:21,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} [107] L32-3-->L33: Formula: (let ((.cse1 (mod v_main_~N_LIN~0_4 4294967296)) (.cse0 (mod v_main_~k~0_6 4294967296))) (and (< .cse0 .cse1) (= (select (select |v_#memory_int_1| |v_main_~#matriz~0.base_2|) (+ (* (* (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296))) 4) (let ((.cse2 (mod v_main_~j~0_8 4294967296))) (ite (<= .cse2 2147483647) .cse2 (+ .cse2 (- 4294967296))))) |v_main_~#matriz~0.offset_2| (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))) |v_main_#t~mem14_1|))) 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 15:56:21,239 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 15:56:21,239 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 15:56:21,239 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 15:56:21,240 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 15:56:21,240 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 15:56:21,240 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 15:56:21,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:56:21,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239527650] [2022-04-27 15:56:21,241 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 15:56:21,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122711384] [2022-04-27 15:56:21,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122711384] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:56:21,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:56:21,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-27 15:56:21,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500656583] [2022-04-27 15:56:21,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:56:21,249 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 15:56:21,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:56:21,253 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 15:56:21,270 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 15:56:21,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-27 15:56:21,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:56:21,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-27 15:56:21,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-27 15:56:21,298 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 15:56:21,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:21,336 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-27 15:56:21,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-27 15:56:21,337 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 15:56:21,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:56:21,338 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 15:56:21,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2022-04-27 15:56:21,350 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 15:56:21,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2022-04-27 15:56:21,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 38 transitions. [2022-04-27 15:56:21,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:21,392 INFO L225 Difference]: With dead ends: 29 [2022-04-27 15:56:21,392 INFO L226 Difference]: Without dead ends: 24 [2022-04-27 15:56:21,393 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 15:56:21,398 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 15:56:21,399 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 15:56:21,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-27 15:56:21,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-27 15:56:21,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:56:21,417 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 15:56:21,417 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 15:56:21,417 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 15:56:21,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:21,422 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-27 15:56:21,422 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-27 15:56:21,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:21,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:21,423 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 15:56:21,423 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 15:56:21,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:21,429 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-27 15:56:21,429 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-27 15:56:21,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:21,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:21,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:56:21,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:56:21,430 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 15:56:21,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-04-27 15:56:21,432 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 14 [2022-04-27 15:56:21,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:56:21,433 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-04-27 15:56:21,433 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 15:56:21,433 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-27 15:56:21,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 15:56:21,433 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:21,433 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:56:21,452 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 15:56:21,634 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 15:56:21,635 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:21,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:21,635 INFO L85 PathProgramCache]: Analyzing trace with hash -178809263, now seen corresponding path program 1 times [2022-04-27 15:56:21,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:21,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706845263] [2022-04-27 15:56:21,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:21,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:21,658 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 15:56:21,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [845200526] [2022-04-27 15:56:21,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:21,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:56:21,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:56:21,661 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 15:56:21,666 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 15:56:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:21,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 15:56:21,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:21,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 15:56:21,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {176#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {176#true} is VALID [2022-04-27 15:56:21,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {176#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] {176#true} is VALID [2022-04-27 15:56:21,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {176#true} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {176#true} is VALID [2022-04-27 15:56:21,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {176#true} {176#true} [120] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {176#true} is VALID [2022-04-27 15:56:21,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {176#true} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {176#true} is VALID [2022-04-27 15:56:21,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {176#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_#length_1| (store |v_#length_2| |v_main_~#matriz~0.base_1| (* (let ((.cse0 (mod v_main_~N_COL~0_1 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) (* (let ((.cse1 (mod v_main_~N_LIN~0_1 4294967296))) (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296)))) 4)))) (= |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)) (<= 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] {196#(= main_~j~0 0)} is VALID [2022-04-27 15:56:21,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {196#(= 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[] {200#(not (< 0 (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-27 15:56:21,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {200#(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] {204#(and (= main_~j~0 0) (not (< 0 (mod main_~N_COL~0 4294967296))))} is VALID [2022-04-27 15:56:21,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {204#(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] {177#false} is VALID [2022-04-27 15:56:21,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {177#false} [107] L32-3-->L33: Formula: (let ((.cse1 (mod v_main_~N_LIN~0_4 4294967296)) (.cse0 (mod v_main_~k~0_6 4294967296))) (and (< .cse0 .cse1) (= (select (select |v_#memory_int_1| |v_main_~#matriz~0.base_2|) (+ (* (* (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296))) 4) (let ((.cse2 (mod v_main_~j~0_8 4294967296))) (ite (<= .cse2 2147483647) .cse2 (+ .cse2 (- 4294967296))))) |v_main_~#matriz~0.offset_2| (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))) |v_main_#t~mem14_1|))) 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] {177#false} is VALID [2022-04-27 15:56:21,807 INFO L272 TraceCheckUtils]: 10: Hoare triple {177#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] {177#false} is VALID [2022-04-27 15:56:21,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {177#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] {177#false} is VALID [2022-04-27 15:56:21,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {177#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[] {177#false} is VALID [2022-04-27 15:56:21,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {177#false} [117] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {177#false} is VALID [2022-04-27 15:56:21,808 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 15:56:21,808 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 15:56:21,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:56:21,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706845263] [2022-04-27 15:56:21,808 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 15:56:21,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845200526] [2022-04-27 15:56:21,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845200526] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:56:21,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:56:21,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:56:21,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442442455] [2022-04-27 15:56:21,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:56:21,810 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 15:56:21,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:56:21,810 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 15:56:21,822 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 15:56:21,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:56:21,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:56:21,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:56:21,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:56:21,824 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 15:56:21,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:21,918 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2022-04-27 15:56:21,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:56:21,918 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 15:56:21,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:56:21,919 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 15:56:21,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-04-27 15:56:21,921 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 15:56:21,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-04-27 15:56:21,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 46 transitions. [2022-04-27 15:56:21,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:21,963 INFO L225 Difference]: With dead ends: 37 [2022-04-27 15:56:21,964 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 15:56:21,964 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 15:56:21,966 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:56:21,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 59 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:56:21,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 15:56:21,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2022-04-27 15:56:21,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:56:21,972 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 15:56:21,972 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 15:56:21,973 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 15:56:21,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:21,977 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-04-27 15:56:21,977 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-04-27 15:56:21,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:21,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:21,979 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 15:56:21,979 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 15:56:21,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:21,982 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-04-27 15:56:21,982 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-04-27 15:56:21,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:21,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:21,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:56:21,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:56:21,983 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 15:56:21,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-27 15:56:21,985 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 14 [2022-04-27 15:56:21,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:56:21,985 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-27 15:56:21,987 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 15:56:21,987 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-27 15:56:21,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 15:56:21,988 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:21,988 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 15:56:22,007 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 15:56:22,204 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 15:56:22,204 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:22,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:22,205 INFO L85 PathProgramCache]: Analyzing trace with hash 490549227, now seen corresponding path program 1 times [2022-04-27 15:56:22,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:22,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191790826] [2022-04-27 15:56:22,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:22,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:22,222 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 15:56:22,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1847276811] [2022-04-27 15:56:22,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:22,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:56:22,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:56:22,227 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 15:56:22,229 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 15:56:22,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:22,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 15:56:22,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:22,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 15:56:22,367 INFO L272 TraceCheckUtils]: 0: Hoare triple {354#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {354#true} is VALID [2022-04-27 15:56:22,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {354#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] {354#true} is VALID [2022-04-27 15:56:22,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {354#true} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {354#true} is VALID [2022-04-27 15:56:22,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {354#true} {354#true} [120] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {354#true} is VALID [2022-04-27 15:56:22,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {354#true} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {354#true} is VALID [2022-04-27 15:56:22,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {354#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_#length_1| (store |v_#length_2| |v_main_~#matriz~0.base_1| (* (let ((.cse0 (mod v_main_~N_COL~0_1 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) (* (let ((.cse1 (mod v_main_~N_LIN~0_1 4294967296))) (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296)))) 4)))) (= |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)) (<= 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] {354#true} is VALID [2022-04-27 15:56:22,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {354#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] {377#(= main_~k~0 0)} is VALID [2022-04-27 15:56:22,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {377#(= 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[] {381#(not (< 0 (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-27 15:56:22,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {381#(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] {381#(not (< 0 (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-27 15:56:22,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {381#(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[] {381#(not (< 0 (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-27 15:56:22,371 INFO L290 TraceCheckUtils]: 10: Hoare triple {381#(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] {381#(not (< 0 (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-27 15:56:22,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {381#(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] {394#(and (= main_~k~0 0) (not (< 0 (mod main_~N_LIN~0 4294967296))))} is VALID [2022-04-27 15:56:22,373 INFO L290 TraceCheckUtils]: 12: Hoare triple {394#(and (= main_~k~0 0) (not (< 0 (mod main_~N_LIN~0 4294967296))))} [107] L32-3-->L33: Formula: (let ((.cse1 (mod v_main_~N_LIN~0_4 4294967296)) (.cse0 (mod v_main_~k~0_6 4294967296))) (and (< .cse0 .cse1) (= (select (select |v_#memory_int_1| |v_main_~#matriz~0.base_2|) (+ (* (* (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296))) 4) (let ((.cse2 (mod v_main_~j~0_8 4294967296))) (ite (<= .cse2 2147483647) .cse2 (+ .cse2 (- 4294967296))))) |v_main_~#matriz~0.offset_2| (* 4 (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))) |v_main_#t~mem14_1|))) 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] {355#false} is VALID [2022-04-27 15:56:22,374 INFO L272 TraceCheckUtils]: 13: Hoare triple {355#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] {355#false} is VALID [2022-04-27 15:56:22,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {355#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] {355#false} is VALID [2022-04-27 15:56:22,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {355#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[] {355#false} is VALID [2022-04-27 15:56:22,374 INFO L290 TraceCheckUtils]: 16: Hoare triple {355#false} [117] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#false} is VALID [2022-04-27 15:56:22,374 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 15:56:22,375 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 15:56:22,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:56:22,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191790826] [2022-04-27 15:56:22,375 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 15:56:22,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847276811] [2022-04-27 15:56:22,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847276811] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:56:22,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:56:22,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:56:22,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630835557] [2022-04-27 15:56:22,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:56:22,377 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 15:56:22,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:56:22,378 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 15:56:22,397 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 15:56:22,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:56:22,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:56:22,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:56:22,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:56:22,398 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 15:56:22,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:22,493 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-04-27 15:56:22,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:56:22,493 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 15:56:22,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:56:22,494 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 15:56:22,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-04-27 15:56:22,495 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 15:56:22,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-04-27 15:56:22,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 49 transitions. [2022-04-27 15:56:22,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:22,534 INFO L225 Difference]: With dead ends: 39 [2022-04-27 15:56:22,534 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 15:56:22,535 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 15:56:22,535 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 14 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:56:22,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 62 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:56:22,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 15:56:22,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2022-04-27 15:56:22,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:56:22,538 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 15:56:22,538 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 15:56:22,538 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 15:56:22,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:22,540 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-27 15:56:22,540 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-27 15:56:22,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:22,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:22,540 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 15:56:22,540 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 15:56:22,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:22,542 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-27 15:56:22,542 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-27 15:56:22,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:22,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:22,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:56:22,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:56:22,542 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 15:56:22,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-27 15:56:22,543 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 17 [2022-04-27 15:56:22,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:56:22,543 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-27 15:56:22,544 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 15:56:22,544 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 15:56:22,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 15:56:22,544 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:22,544 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 15:56:22,573 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 15:56:22,759 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 15:56:22,759 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:22,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:22,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1532617408, now seen corresponding path program 1 times [2022-04-27 15:56:22,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:22,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856839734] [2022-04-27 15:56:22,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:22,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:22,779 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 15:56:22,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [126121931] [2022-04-27 15:56:22,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:22,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:56:22,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:56:22,781 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 15:56:22,782 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 15:56:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 15:56:22,828 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 15:56:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 15:56:22,870 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 15:56:22,870 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 15:56:22,871 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 15:56:22,891 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 15:56:23,072 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 15:56:23,075 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-04-27 15:56:23,077 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 15:56:23,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:56:23 BasicIcfg [2022-04-27 15:56:23,096 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 15:56:23,097 INFO L158 Benchmark]: Toolchain (without parser) took 2787.85ms. Allocated memory was 175.1MB in the beginning and 221.2MB in the end (delta: 46.1MB). Free memory was 126.3MB in the beginning and 140.7MB in the end (delta: -14.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-04-27 15:56:23,097 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 175.1MB. Free memory was 142.3MB in the beginning and 142.1MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 15:56:23,097 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.83ms. Allocated memory is still 175.1MB. Free memory was 126.1MB in the beginning and 150.2MB in the end (delta: -24.1MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. [2022-04-27 15:56:23,098 INFO L158 Benchmark]: Boogie Preprocessor took 36.28ms. Allocated memory is still 175.1MB. Free memory was 150.2MB in the beginning and 148.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 15:56:23,098 INFO L158 Benchmark]: RCFGBuilder took 325.28ms. Allocated memory is still 175.1MB. Free memory was 148.1MB in the beginning and 134.0MB in the end (delta: 14.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-27 15:56:23,098 INFO L158 Benchmark]: IcfgTransformer took 40.88ms. Allocated memory is still 175.1MB. Free memory was 134.0MB in the beginning and 131.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 15:56:23,099 INFO L158 Benchmark]: TraceAbstraction took 2204.72ms. Allocated memory was 175.1MB in the beginning and 221.2MB in the end (delta: 46.1MB). Free memory was 131.3MB in the beginning and 141.2MB in the end (delta: -9.9MB). Peak memory consumption was 37.2MB. Max. memory is 8.0GB. [2022-04-27 15:56:23,100 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.10ms. Allocated memory is still 175.1MB. Free memory was 142.3MB in the beginning and 142.1MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 175.83ms. Allocated memory is still 175.1MB. Free memory was 126.1MB in the beginning and 150.2MB in the end (delta: -24.1MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.28ms. Allocated memory is still 175.1MB. Free memory was 150.2MB in the beginning and 148.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 325.28ms. Allocated memory is still 175.1MB. Free memory was 148.1MB in the beginning and 134.0MB in the end (delta: 14.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 40.88ms. Allocated memory is still 175.1MB. Free memory was 134.0MB in the beginning and 131.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 2204.72ms. Allocated memory was 175.1MB in the beginning and 221.2MB in the end (delta: 46.1MB). Free memory was 131.3MB in the beginning and 141.2MB in the end (delta: -9.9MB). Peak memory consumption was 37.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