java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/matrix-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 02:30:02,486 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 02:30:02,488 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 02:30:02,500 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 02:30:02,500 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 02:30:02,501 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 02:30:02,502 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 02:30:02,504 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 02:30:02,506 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 02:30:02,507 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 02:30:02,508 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 02:30:02,509 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 02:30:02,509 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 02:30:02,510 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 02:30:02,511 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 02:30:02,512 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 02:30:02,513 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 02:30:02,514 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 02:30:02,516 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 02:30:02,518 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 02:30:02,519 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 02:30:02,520 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 02:30:02,521 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 02:30:02,522 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 02:30:02,524 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 02:30:02,524 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 02:30:02,525 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 02:30:02,525 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 02:30:02,526 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 02:30:02,527 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 02:30:02,527 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 02:30:02,528 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 02:30:02,529 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 02:30:02,529 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 02:30:02,530 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 02:30:02,531 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 02:30:02,531 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 02:30:02,532 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 02:30:02,532 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 02:30:02,533 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 02:30:02,533 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 02:30:02,534 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 02:30:02,548 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 02:30:02,548 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 02:30:02,550 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 02:30:02,550 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 02:30:02,550 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 02:30:02,550 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 02:30:02,551 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 02:30:02,551 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 02:30:02,551 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 02:30:02,551 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 02:30:02,551 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 02:30:02,552 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 02:30:02,552 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 02:30:02,552 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 02:30:02,552 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 02:30:02,552 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 02:30:02,553 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 02:30:02,553 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 02:30:02,553 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 02:30:02,553 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 02:30:02,553 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 02:30:02,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 02:30:02,554 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 02:30:02,554 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 02:30:02,554 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 02:30:02,554 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 02:30:02,555 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 02:30:02,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 02:30:02,555 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 02:30:02,583 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 02:30:02,596 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 02:30:02,599 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 02:30:02,601 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 02:30:02,601 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 02:30:02,602 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/matrix-1.c [2019-09-08 02:30:02,662 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/383b504ec/ffdb2302869a46aeba350dc6d9c5c10d/FLAG7704bd6b6 [2019-09-08 02:30:03,097 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 02:30:03,099 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/matrix-1.c [2019-09-08 02:30:03,106 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/383b504ec/ffdb2302869a46aeba350dc6d9c5c10d/FLAG7704bd6b6 [2019-09-08 02:30:03,443 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/383b504ec/ffdb2302869a46aeba350dc6d9c5c10d [2019-09-08 02:30:03,459 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 02:30:03,460 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 02:30:03,461 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 02:30:03,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 02:30:03,465 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 02:30:03,466 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:30:03" (1/1) ... [2019-09-08 02:30:03,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39268ede and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:30:03, skipping insertion in model container [2019-09-08 02:30:03,469 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:30:03" (1/1) ... [2019-09-08 02:30:03,476 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 02:30:03,494 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 02:30:03,691 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:30:03,695 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 02:30:03,718 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:30:03,738 INFO L192 MainTranslator]: Completed translation [2019-09-08 02:30:03,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:30:03 WrapperNode [2019-09-08 02:30:03,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 02:30:03,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 02:30:03,740 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 02:30:03,740 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 02:30:03,835 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:30:03" (1/1) ... [2019-09-08 02:30:03,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:30:03" (1/1) ... [2019-09-08 02:30:03,843 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:30:03" (1/1) ... [2019-09-08 02:30:03,843 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:30:03" (1/1) ... [2019-09-08 02:30:03,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:30:03" (1/1) ... [2019-09-08 02:30:03,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:30:03" (1/1) ... [2019-09-08 02:30:03,857 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:30:03" (1/1) ... [2019-09-08 02:30:03,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 02:30:03,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 02:30:03,860 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 02:30:03,860 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 02:30:03,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:30:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 02:30:03,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 02:30:03,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 02:30:03,923 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-08 02:30:03,924 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 02:30:03,924 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 02:30:03,924 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-08 02:30:03,924 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 02:30:03,924 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 02:30:03,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 02:30:03,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 02:30:03,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 02:30:03,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 02:30:03,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 02:30:03,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 02:30:04,214 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 02:30:04,215 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-08 02:30:04,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:30:04 BoogieIcfgContainer [2019-09-08 02:30:04,221 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 02:30:04,222 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 02:30:04,222 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 02:30:04,232 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 02:30:04,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 02:30:03" (1/3) ... [2019-09-08 02:30:04,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cdec854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:30:04, skipping insertion in model container [2019-09-08 02:30:04,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:30:03" (2/3) ... [2019-09-08 02:30:04,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cdec854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:30:04, skipping insertion in model container [2019-09-08 02:30:04,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:30:04" (3/3) ... [2019-09-08 02:30:04,239 INFO L109 eAbstractionObserver]: Analyzing ICFG matrix-1.c [2019-09-08 02:30:04,251 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 02:30:04,259 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 02:30:04,276 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 02:30:04,304 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 02:30:04,305 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 02:30:04,305 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 02:30:04,306 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 02:30:04,306 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 02:30:04,306 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 02:30:04,306 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 02:30:04,306 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 02:30:04,306 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 02:30:04,325 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-09-08 02:30:04,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-08 02:30:04,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:30:04,332 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:30:04,334 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:30:04,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:30:04,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1330517862, now seen corresponding path program 1 times [2019-09-08 02:30:04,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:30:04,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:30:04,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:30:04,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:30:04,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:30:04,421 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 02:30:04,422 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 02:30:04,422 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 02:30:04,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:30:04,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:30:04,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 1 conjunts are in the unsatisfiable core [2019-09-08 02:30:04,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:30:04,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:30:04,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:30:04,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 02:30:04,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 02:30:04,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 02:30:04,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 02:30:04,513 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2019-09-08 02:30:04,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:30:04,535 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2019-09-08 02:30:04,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 02:30:04,537 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-09-08 02:30:04,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:30:04,545 INFO L225 Difference]: With dead ends: 42 [2019-09-08 02:30:04,545 INFO L226 Difference]: Without dead ends: 17 [2019-09-08 02:30:04,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 02:30:04,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-08 02:30:04,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-08 02:30:04,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-08 02:30:04,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-09-08 02:30:04,603 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2019-09-08 02:30:04,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:30:04,604 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-09-08 02:30:04,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 02:30:04,606 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-09-08 02:30:04,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-08 02:30:04,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:30:04,607 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:30:04,607 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:30:04,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:30:04,609 INFO L82 PathProgramCache]: Analyzing trace with hash 672047389, now seen corresponding path program 1 times [2019-09-08 02:30:04,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:30:04,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:30:04,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:30:04,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:30:04,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:30:04,638 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 02:30:04,639 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 02:30:04,639 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-08 02:30:04,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 02:30:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:30:04,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 02:30:04,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:30:04,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:30:04,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:30:04,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 02:30:04,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 02:30:04,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 02:30:04,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 02:30:04,745 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 3 states. [2019-09-08 02:30:04,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:30:04,799 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2019-09-08 02:30:04,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 02:30:04,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-09-08 02:30:04,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:30:04,802 INFO L225 Difference]: With dead ends: 28 [2019-09-08 02:30:04,803 INFO L226 Difference]: Without dead ends: 22 [2019-09-08 02:30:04,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 02:30:04,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-08 02:30:04,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2019-09-08 02:30:04,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-08 02:30:04,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-09-08 02:30:04,813 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2019-09-08 02:30:04,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:30:04,814 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-09-08 02:30:04,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 02:30:04,815 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-09-08 02:30:04,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-08 02:30:04,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:30:04,819 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:30:04,819 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:30:04,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:30:04,821 INFO L82 PathProgramCache]: Analyzing trace with hash -830834987, now seen corresponding path program 1 times [2019-09-08 02:30:04,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:30:04,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:30:04,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:30:04,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:30:04,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:30:04,844 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 02:30:04,844 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 02:30:04,844 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-08 02:30:04,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 02:30:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:30:04,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 02:30:04,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:30:04,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:30:04,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:30:04,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 02:30:04,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 02:30:04,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 02:30:04,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 02:30:04,947 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 4 states. [2019-09-08 02:30:05,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:30:05,029 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2019-09-08 02:30:05,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 02:30:05,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-09-08 02:30:05,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:30:05,031 INFO L225 Difference]: With dead ends: 36 [2019-09-08 02:30:05,031 INFO L226 Difference]: Without dead ends: 25 [2019-09-08 02:30:05,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:30:05,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-08 02:30:05,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2019-09-08 02:30:05,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-08 02:30:05,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-09-08 02:30:05,036 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2019-09-08 02:30:05,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:30:05,037 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-09-08 02:30:05,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 02:30:05,037 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-09-08 02:30:05,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-08 02:30:05,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:30:05,038 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:30:05,038 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:30:05,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:30:05,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1529445450, now seen corresponding path program 1 times [2019-09-08 02:30:05,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:30:05,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:30:05,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:30:05,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:30:05,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:30:05,047 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 02:30:05,047 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 02:30:05,047 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-08 02:30:05,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 02:30:05,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:30:05,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-08 02:30:05,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:30:05,200 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-08 02:30:05,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:05,425 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 28 [2019-09-08 02:30:05,426 INFO L567 ElimStorePlain]: treesize reduction 361, result has 9.3 percent of original size [2019-09-08 02:30:05,427 INFO L464 ElimStorePlain]: Eliminatee v_prenex_13 vanished before elimination [2019-09-08 02:30:05,427 INFO L464 ElimStorePlain]: Eliminatee v_prenex_1 vanished before elimination [2019-09-08 02:30:05,427 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_7| vanished before elimination [2019-09-08 02:30:05,427 INFO L464 ElimStorePlain]: Eliminatee v_prenex_3 vanished before elimination [2019-09-08 02:30:05,428 INFO L464 ElimStorePlain]: Eliminatee v_prenex_11 vanished before elimination [2019-09-08 02:30:05,428 INFO L464 ElimStorePlain]: Eliminatee v_prenex_5 vanished before elimination [2019-09-08 02:30:05,442 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2019-09-08 02:30:05,442 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:05,454 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:05,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:30:05,455 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 16 variables, input treesize:453, output treesize:10 [2019-09-08 02:30:05,476 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-08 02:30:05,478 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:05,480 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:05,480 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:30:05,480 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-09-08 02:30:05,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:05,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:30:05,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 02:30:05,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-09-08 02:30:05,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 02:30:05,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 02:30:05,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 02:30:05,536 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 8 states. [2019-09-08 02:30:05,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:30:05,733 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2019-09-08 02:30:05,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 02:30:05,735 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-09-08 02:30:05,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:30:05,736 INFO L225 Difference]: With dead ends: 37 [2019-09-08 02:30:05,736 INFO L226 Difference]: Without dead ends: 31 [2019-09-08 02:30:05,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-09-08 02:30:05,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-08 02:30:05,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2019-09-08 02:30:05,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-08 02:30:05,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-09-08 02:30:05,745 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 18 [2019-09-08 02:30:05,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:30:05,746 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-09-08 02:30:05,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 02:30:05,747 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-09-08 02:30:05,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-08 02:30:05,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:30:05,748 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:30:05,748 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:30:05,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:30:05,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1922472460, now seen corresponding path program 1 times [2019-09-08 02:30:05,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:30:05,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:30:05,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:30:05,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:30:05,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:30:05,769 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 02:30:05,770 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 02:30:05,770 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-08 02:30:05,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 02:30:05,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:30:05,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-08 02:30:05,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:30:05,892 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-08 02:30:05,892 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:05,945 INFO L567 ElimStorePlain]: treesize reduction 137, result has 26.7 percent of original size [2019-09-08 02:30:05,946 INFO L464 ElimStorePlain]: Eliminatee v_prenex_18 vanished before elimination [2019-09-08 02:30:05,946 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_8| vanished before elimination [2019-09-08 02:30:05,954 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2019-09-08 02:30:05,955 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:05,970 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:05,971 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:30:05,971 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:251, output treesize:28 [2019-09-08 02:30:06,058 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-09-08 02:30:06,058 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:06,062 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:06,063 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:30:06,063 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2019-09-08 02:30:06,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:06,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 02:30:06,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 02:30:06,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-09-08 02:30:06,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 02:30:06,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 02:30:06,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-09-08 02:30:06,113 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 12 states. [2019-09-08 02:30:06,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:30:06,332 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2019-09-08 02:30:06,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 02:30:06,335 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-09-08 02:30:06,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:30:06,335 INFO L225 Difference]: With dead ends: 49 [2019-09-08 02:30:06,336 INFO L226 Difference]: Without dead ends: 32 [2019-09-08 02:30:06,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-09-08 02:30:06,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-08 02:30:06,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2019-09-08 02:30:06,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-08 02:30:06,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-09-08 02:30:06,342 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 18 [2019-09-08 02:30:06,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:30:06,342 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-09-08 02:30:06,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 02:30:06,342 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-09-08 02:30:06,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-08 02:30:06,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:30:06,343 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:30:06,343 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:30:06,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:30:06,344 INFO L82 PathProgramCache]: Analyzing trace with hash -422232267, now seen corresponding path program 2 times [2019-09-08 02:30:06,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:30:06,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:30:06,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:30:06,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:30:06,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:30:06,350 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 02:30:06,350 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 02:30:06,351 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 02:30:06,385 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:30:06,412 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:30:06,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:30:06,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 02:30:06,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:30:06,434 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:30:06,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 02:30:06,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-09-08 02:30:06,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 02:30:06,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 02:30:06,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:30:06,439 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 5 states. [2019-09-08 02:30:06,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:30:06,465 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2019-09-08 02:30:06,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 02:30:06,465 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-09-08 02:30:06,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:30:06,466 INFO L225 Difference]: With dead ends: 42 [2019-09-08 02:30:06,466 INFO L226 Difference]: Without dead ends: 26 [2019-09-08 02:30:06,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:30:06,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-08 02:30:06,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-09-08 02:30:06,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-08 02:30:06,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-09-08 02:30:06,473 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 21 [2019-09-08 02:30:06,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:30:06,473 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-09-08 02:30:06,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 02:30:06,473 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-09-08 02:30:06,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-08 02:30:06,474 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:30:06,474 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:30:06,475 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:30:06,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:30:06,475 INFO L82 PathProgramCache]: Analyzing trace with hash 239488911, now seen corresponding path program 3 times [2019-09-08 02:30:06,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:30:06,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:30:06,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:30:06,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:30:06,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:30:06,483 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 02:30:06,483 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 02:30:06,484 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-08 02:30:06,510 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 02:30:06,567 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-08 02:30:06,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:30:06,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-08 02:30:06,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:30:06,625 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-08 02:30:06,625 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:06,824 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 28 [2019-09-08 02:30:06,825 INFO L567 ElimStorePlain]: treesize reduction 407, result has 8.3 percent of original size [2019-09-08 02:30:06,825 INFO L464 ElimStorePlain]: Eliminatee v_prenex_31 vanished before elimination [2019-09-08 02:30:06,828 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2019-09-08 02:30:06,829 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:06,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:06,838 INFO L464 ElimStorePlain]: Eliminatee v_prenex_23 vanished before elimination [2019-09-08 02:30:06,838 INFO L464 ElimStorePlain]: Eliminatee v_prenex_33 vanished before elimination [2019-09-08 02:30:06,839 INFO L464 ElimStorePlain]: Eliminatee v_prenex_29 vanished before elimination [2019-09-08 02:30:06,839 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_9| vanished before elimination [2019-09-08 02:30:06,839 INFO L464 ElimStorePlain]: Eliminatee v_prenex_27 vanished before elimination [2019-09-08 02:30:06,839 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:30:06,840 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 16 variables, input treesize:509, output treesize:10 [2019-09-08 02:30:06,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:06,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:06,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:06,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:06,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:06,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:06,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:06,881 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-08 02:30:06,881 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:06,915 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:06,916 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 132 [2019-09-08 02:30:06,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:06,918 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:06,924 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-08 02:30:06,924 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:06,957 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:06,957 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 132 [2019-09-08 02:30:06,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:06,959 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:06,968 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-08 02:30:06,968 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:06,974 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-08 02:30:06,975 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:06,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:30:06,989 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 85 [2019-09-08 02:30:06,990 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:07,024 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:07,025 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 123 [2019-09-08 02:30:07,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,026 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-09-08 02:30:07,665 WARN L188 SmtUtils]: Spent 637.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-08 02:30:07,665 INFO L567 ElimStorePlain]: treesize reduction 108, result has 76.6 percent of original size [2019-09-08 02:30:07,667 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-09-08 02:30:07,668 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:669, output treesize:253 [2019-09-08 02:30:07,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:30:07,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:30:07,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:30:07,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:30:07,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:30:07,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:30:07,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:30:07,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:30:07,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:30:07,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:30:07,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:30:07,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:30:07,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:30:07,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:30:07,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:30:07,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:07,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:08,087 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:30:08,088 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 29 [2019-09-08 02:30:08,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:08,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-08 02:30:08,111 INFO L567 ElimStorePlain]: treesize reduction 20, result has 41.2 percent of original size [2019-09-08 02:30:08,113 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:30:08,114 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:3 [2019-09-08 02:30:08,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:30:08,156 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 02:30:08,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 02:30:08,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-08 02:30:08,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 02:30:08,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 02:30:08,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-08 02:30:08,161 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 10 states. [2019-09-08 02:30:10,336 WARN L188 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 69 DAG size of output: 29 [2019-09-08 02:30:10,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:30:10,563 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2019-09-08 02:30:10,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 02:30:10,564 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-09-08 02:30:10,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:30:10,564 INFO L225 Difference]: With dead ends: 37 [2019-09-08 02:30:10,564 INFO L226 Difference]: Without dead ends: 31 [2019-09-08 02:30:10,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-09-08 02:30:10,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-08 02:30:10,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2019-09-08 02:30:10,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-08 02:30:10,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-09-08 02:30:10,569 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2019-09-08 02:30:10,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:30:10,570 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-09-08 02:30:10,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 02:30:10,570 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-09-08 02:30:10,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-08 02:30:10,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:30:10,571 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:30:10,571 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:30:10,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:30:10,571 INFO L82 PathProgramCache]: Analyzing trace with hash -153538099, now seen corresponding path program 1 times [2019-09-08 02:30:10,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:30:10,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:30:10,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:30:10,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:30:10,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:30:10,577 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 02:30:10,577 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 02:30:10,577 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 02:30:10,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:30:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:30:10,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 02:30:10,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:30:10,641 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 02:30:10,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 02:30:10,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-09-08 02:30:10,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 02:30:10,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 02:30:10,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 02:30:10,646 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 4 states. [2019-09-08 02:30:10,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:30:10,662 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2019-09-08 02:30:10,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 02:30:10,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-09-08 02:30:10,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:30:10,663 INFO L225 Difference]: With dead ends: 31 [2019-09-08 02:30:10,663 INFO L226 Difference]: Without dead ends: 0 [2019-09-08 02:30:10,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 02:30:10,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-08 02:30:10,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-08 02:30:10,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-08 02:30:10,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-08 02:30:10,665 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2019-09-08 02:30:10,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:30:10,665 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-08 02:30:10,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 02:30:10,665 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-08 02:30:10,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-08 02:30:10,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-08 02:30:10,851 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-08 02:30:10,851 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-09-08 02:30:10,851 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-08 02:30:10,851 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-08 02:30:10,851 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-08 02:30:10,851 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-08 02:30:10,852 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-08 02:30:10,852 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 11 31) no Hoare annotation was computed. [2019-09-08 02:30:10,852 INFO L443 ceAbstractionStarter]: For program point L19-2(lines 19 26) no Hoare annotation was computed. [2019-09-08 02:30:10,852 INFO L439 ceAbstractionStarter]: At program point L19-3(lines 19 26) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |main_~#matriz~0.base|)) (.cse0 (= 1 main_~N_COL~0)) (.cse1 (= 1 main_~N_LIN~0)) (.cse3 (= main_~j~0 1))) (or (and .cse0 (= main_~j~0 0) .cse1) (and .cse0 (<= (+ (select .cse2 (+ (* 4 (mod (+ main_~j~0 4294967295) 4294967296)) |main_~#matriz~0.offset|)) 1) main_~maior~0) .cse3) (and (<= (select .cse2 |main_~#matriz~0.offset|) main_~maior~0) (= 1 main_~k~0) .cse0 .cse1 .cse3))) [2019-09-08 02:30:10,852 INFO L443 ceAbstractionStarter]: For program point L19-4(lines 19 26) no Hoare annotation was computed. [2019-09-08 02:30:10,852 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 11 31) no Hoare annotation was computed. [2019-09-08 02:30:10,853 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 11 31) the Hoare annotation is: true [2019-09-08 02:30:10,853 INFO L439 ceAbstractionStarter]: At program point L28(line 28) the Hoare annotation is: (and (<= |main_#t~mem6| main_~maior~0) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)) [2019-09-08 02:30:10,853 INFO L443 ceAbstractionStarter]: For program point L28-1(line 28) no Hoare annotation was computed. [2019-09-08 02:30:10,853 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 25) no Hoare annotation was computed. [2019-09-08 02:30:10,853 INFO L443 ceAbstractionStarter]: For program point L20-2(lines 20 26) no Hoare annotation was computed. [2019-09-08 02:30:10,853 INFO L439 ceAbstractionStarter]: At program point L20-3(lines 20 26) the Hoare annotation is: (let ((.cse0 (= 1 main_~N_COL~0)) (.cse2 (= 1 main_~N_LIN~0)) (.cse1 (= main_~j~0 0))) (or (and (= main_~k~0 0) .cse0 .cse1 .cse2) (and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= 1 main_~k~0) .cse0 .cse2 .cse1))) [2019-09-08 02:30:10,854 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-09-08 02:30:10,854 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-09-08 02:30:10,854 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-09-08 02:30:10,854 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-09-08 02:30:10,854 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-09-08 02:30:10,854 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-09-08 02:30:10,861 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:30:10,866 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:30:10,867 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:30:10,867 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:30:10,868 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:30:10,868 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:30:10,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 02:30:10 BoogieIcfgContainer [2019-09-08 02:30:10,871 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-08 02:30:10,872 INFO L168 Benchmark]: Toolchain (without parser) took 7411.99 ms. Allocated memory was 141.6 MB in the beginning and 254.8 MB in the end (delta: 113.2 MB). Free memory was 89.8 MB in the beginning and 180.5 MB in the end (delta: -90.8 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. [2019-09-08 02:30:10,873 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 141.6 MB. Free memory was 107.8 MB in the beginning and 107.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-08 02:30:10,874 INFO L168 Benchmark]: CACSL2BoogieTranslator took 277.72 ms. Allocated memory is still 141.6 MB. Free memory was 89.3 MB in the beginning and 79.0 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2019-09-08 02:30:10,875 INFO L168 Benchmark]: Boogie Preprocessor took 119.59 ms. Allocated memory was 141.6 MB in the beginning and 201.3 MB in the end (delta: 59.8 MB). Free memory was 79.0 MB in the beginning and 178.3 MB in the end (delta: -99.3 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2019-09-08 02:30:10,876 INFO L168 Benchmark]: RCFGBuilder took 361.71 ms. Allocated memory is still 201.3 MB. Free memory was 178.3 MB in the beginning and 163.5 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2019-09-08 02:30:10,877 INFO L168 Benchmark]: TraceAbstraction took 6648.70 ms. Allocated memory was 201.3 MB in the beginning and 254.8 MB in the end (delta: 53.5 MB). Free memory was 163.5 MB in the beginning and 180.5 MB in the end (delta: -17.0 MB). Peak memory consumption was 36.4 MB. Max. memory is 7.1 GB. [2019-09-08 02:30:10,881 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46 ms. Allocated memory is still 141.6 MB. Free memory was 107.8 MB in the beginning and 107.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 277.72 ms. Allocated memory is still 141.6 MB. Free memory was 89.3 MB in the beginning and 79.0 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 119.59 ms. Allocated memory was 141.6 MB in the beginning and 201.3 MB in the end (delta: 59.8 MB). Free memory was 79.0 MB in the beginning and 178.3 MB in the end (delta: -99.3 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 361.71 ms. Allocated memory is still 201.3 MB. Free memory was 178.3 MB in the beginning and 163.5 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6648.70 ms. Allocated memory was 201.3 MB in the beginning and 254.8 MB in the end (delta: 53.5 MB). Free memory was 163.5 MB in the beginning and 180.5 MB in the end (delta: -17.0 MB). Peak memory consumption was 36.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant [2019-09-08 02:30:10,889 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:30:10,890 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((k == 0 && 1 == N_COL) && j == 0) && 1 == N_LIN) || ((((unknown-#memory_int-unknown[matriz][matriz] <= maior && 1 == k) && 1 == N_COL) && 1 == N_LIN) && j == 0) - InvariantResult [Line: 19]: Loop Invariant [2019-09-08 02:30:10,890 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:30:10,891 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:30:10,891 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:30:10,891 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((1 == N_COL && j == 0) && 1 == N_LIN) || ((1 == N_COL && unknown-#memory_int-unknown[matriz][4 * ((j + 4294967295) % 4294967296) + matriz] + 1 <= maior) && j == 1)) || ((((unknown-#memory_int-unknown[matriz][matriz] <= maior && 1 == k) && 1 == N_COL) && 1 == N_LIN) && j == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. SAFE Result, 6.5s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 110 SDtfs, 62 SDslu, 254 SDs, 0 SdLazy, 319 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 28 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 16 PreInvPairs, 25 NumberOfFragments, 105 HoareAnnotationTreeSize, 16 FomulaSimplifications, 98 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 58 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 144 NumberOfCodeBlocks, 141 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 136 ConstructedInterpolants, 5 QuantifiedInterpolants, 21471 SizeOfPredicates, 43 NumberOfNonLiveVariables, 582 ConjunctsInSsa, 101 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 18/35 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...