java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-multidimensional/copy-partial-2-n-u_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:33:47,100 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:33:47,102 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:33:47,114 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:33:47,114 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:33:47,115 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:33:47,116 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:33:47,118 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:33:47,120 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:33:47,121 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:33:47,122 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:33:47,122 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:33:47,123 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:33:47,124 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:33:47,125 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:33:47,126 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:33:47,127 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:33:47,129 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:33:47,131 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:33:47,133 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:33:47,134 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:33:47,135 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:33:47,138 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:33:47,138 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:33:47,139 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:33:47,140 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:33:47,143 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:33:47,144 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:33:47,144 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:33:47,145 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:33:47,147 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:33:47,148 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:33:47,148 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:33:47,148 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:33:47,151 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:33:47,151 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:33:47,153 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:33:47,187 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:33:47,187 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:33:47,188 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:33:47,188 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:33:47,190 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:33:47,190 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:33:47,190 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:33:47,190 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:33:47,190 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:33:47,191 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:33:47,191 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:33:47,191 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:33:47,191 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:33:47,191 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:33:47,191 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:33:47,193 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:33:47,193 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:33:47,193 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:33:47,193 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:33:47,193 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:33:47,194 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:33:47,194 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:33:47,194 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:33:47,194 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:33:47,194 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:33:47,194 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:33:47,196 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:33:47,196 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:33:47,196 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:33:47,196 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:33:47,197 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:33:47,249 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:33:47,261 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:33:47,265 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:33:47,267 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:33:47,267 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:33:47,268 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-multidimensional/copy-partial-2-n-u_true-unreach-call.i [2018-11-23 12:33:47,333 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fbed03ef/b9ecda59baf647d4bbced767c6169ad1/FLAG1069b9149 [2018-11-23 12:33:47,771 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:33:47,772 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-multidimensional/copy-partial-2-n-u_true-unreach-call.i [2018-11-23 12:33:47,779 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fbed03ef/b9ecda59baf647d4bbced767c6169ad1/FLAG1069b9149 [2018-11-23 12:33:48,148 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fbed03ef/b9ecda59baf647d4bbced767c6169ad1 [2018-11-23 12:33:48,158 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:33:48,160 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:33:48,161 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:33:48,161 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:33:48,165 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:33:48,166 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:33:48" (1/1) ... [2018-11-23 12:33:48,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@552c8a57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:48, skipping insertion in model container [2018-11-23 12:33:48,169 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:33:48" (1/1) ... [2018-11-23 12:33:48,180 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:33:48,212 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:33:48,488 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:33:48,493 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:33:48,526 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:33:48,552 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:33:48,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:48 WrapperNode [2018-11-23 12:33:48,553 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:33:48,554 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:33:48,554 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:33:48,554 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:33:48,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:48" (1/1) ... [2018-11-23 12:33:48,572 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:48" (1/1) ... [2018-11-23 12:33:48,581 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:33:48,581 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:33:48,581 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:33:48,582 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:33:48,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:48" (1/1) ... [2018-11-23 12:33:48,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:48" (1/1) ... [2018-11-23 12:33:48,594 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:48" (1/1) ... [2018-11-23 12:33:48,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:48" (1/1) ... [2018-11-23 12:33:48,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:48" (1/1) ... [2018-11-23 12:33:48,622 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:48" (1/1) ... [2018-11-23 12:33:48,623 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:48" (1/1) ... [2018-11-23 12:33:48,626 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:33:48,626 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:33:48,627 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:33:48,627 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:33:48,628 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:48" (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 [2018-11-23 12:33:48,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:33:48,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:33:48,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:33:48,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:33:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:33:48,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:33:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:33:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:33:48,759 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:33:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:33:48,759 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:33:48,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:33:49,445 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:33:49,446 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 12:33:49,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:33:49 BoogieIcfgContainer [2018-11-23 12:33:49,447 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:33:49,448 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:33:49,448 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:33:49,451 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:33:49,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:33:48" (1/3) ... [2018-11-23 12:33:49,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49869902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:33:49, skipping insertion in model container [2018-11-23 12:33:49,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:48" (2/3) ... [2018-11-23 12:33:49,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49869902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:33:49, skipping insertion in model container [2018-11-23 12:33:49,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:33:49" (3/3) ... [2018-11-23 12:33:49,455 INFO L112 eAbstractionObserver]: Analyzing ICFG copy-partial-2-n-u_true-unreach-call.i [2018-11-23 12:33:49,463 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:33:49,470 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:33:49,489 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:33:49,522 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:33:49,522 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:33:49,522 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:33:49,523 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:33:49,523 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:33:49,523 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:33:49,523 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:33:49,523 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:33:49,524 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:33:49,542 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-23 12:33:49,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:33:49,549 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:49,550 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:33:49,552 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:49,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:49,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1035913628, now seen corresponding path program 1 times [2018-11-23 12:33:49,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:49,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:49,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:49,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:49,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:49,643 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:49,644 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:49,644 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 [2018-11-23 12:33:49,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:49,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:49,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:50,124 INFO L256 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2018-11-23 12:33:50,128 INFO L273 TraceCheckUtils]: 1: Hoare triple {33#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33#true} is VALID [2018-11-23 12:33:50,128 INFO L273 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2018-11-23 12:33:50,129 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #99#return; {33#true} is VALID [2018-11-23 12:33:50,129 INFO L256 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret5 := main(); {33#true} is VALID [2018-11-23 12:33:50,132 INFO L273 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;~q~0 := 500;~s~0 := 700;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);assume 0 != (if ~q~0 < ~m~0 then 1 else 0);assume 0 != (if ~s~0 < ~n~0 then 1 else 0);~i~0 := 0;~j~0 := 0; {53#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:50,135 INFO L273 TraceCheckUtils]: 6: Hoare triple {53#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {34#false} is VALID [2018-11-23 12:33:50,136 INFO L273 TraceCheckUtils]: 7: Hoare triple {34#false} ~i~0 := 0;~j~0 := 0; {34#false} is VALID [2018-11-23 12:33:50,136 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#false} assume !(~i~0 < ~q~0); {34#false} is VALID [2018-11-23 12:33:50,136 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#false} ~i~0 := 0;~j~0 := 0; {34#false} is VALID [2018-11-23 12:33:50,137 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#false} assume !!(~i~0 < ~q~0);~j~0 := 0; {34#false} is VALID [2018-11-23 12:33:50,137 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#false} assume !!(~j~0 < ~s~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem4 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {34#false} is VALID [2018-11-23 12:33:50,137 INFO L256 TraceCheckUtils]: 12: Hoare triple {34#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {34#false} is VALID [2018-11-23 12:33:50,138 INFO L273 TraceCheckUtils]: 13: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2018-11-23 12:33:50,138 INFO L273 TraceCheckUtils]: 14: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2018-11-23 12:33:50,138 INFO L273 TraceCheckUtils]: 15: Hoare triple {34#false} assume !false; {34#false} is VALID [2018-11-23 12:33:50,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:33:50,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:33:50,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:33:50,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:33:50,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:50,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:33:50,234 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:50,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:33:50,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:33:50,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:33:50,248 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2018-11-23 12:33:50,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:50,852 INFO L93 Difference]: Finished difference Result 57 states and 86 transitions. [2018-11-23 12:33:50,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:33:50,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:33:50,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:50,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:33:50,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2018-11-23 12:33:50,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:33:50,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2018-11-23 12:33:50,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 86 transitions. [2018-11-23 12:33:51,342 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:51,353 INFO L225 Difference]: With dead ends: 57 [2018-11-23 12:33:51,353 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 12:33:51,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:33:51,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 12:33:51,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-11-23 12:33:51,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:51,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 26 states. [2018-11-23 12:33:51,419 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 26 states. [2018-11-23 12:33:51,419 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 26 states. [2018-11-23 12:33:51,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:51,424 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2018-11-23 12:33:51,424 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2018-11-23 12:33:51,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:51,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:51,425 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 28 states. [2018-11-23 12:33:51,426 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 28 states. [2018-11-23 12:33:51,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:51,430 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2018-11-23 12:33:51,430 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2018-11-23 12:33:51,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:51,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:51,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:51,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:51,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:33:51,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-11-23 12:33:51,435 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 16 [2018-11-23 12:33:51,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:51,436 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-23 12:33:51,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:33:51,436 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2018-11-23 12:33:51,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:33:51,437 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:51,437 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:33:51,438 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:51,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:51,438 INFO L82 PathProgramCache]: Analyzing trace with hash 573516244, now seen corresponding path program 1 times [2018-11-23 12:33:51,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:51,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:51,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:51,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:51,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:51,448 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:51,448 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:51,448 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:33:51,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:51,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:51,781 INFO L256 TraceCheckUtils]: 0: Hoare triple {257#true} call ULTIMATE.init(); {257#true} is VALID [2018-11-23 12:33:51,781 INFO L273 TraceCheckUtils]: 1: Hoare triple {257#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {257#true} is VALID [2018-11-23 12:33:51,782 INFO L273 TraceCheckUtils]: 2: Hoare triple {257#true} assume true; {257#true} is VALID [2018-11-23 12:33:51,782 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {257#true} {257#true} #99#return; {257#true} is VALID [2018-11-23 12:33:51,782 INFO L256 TraceCheckUtils]: 4: Hoare triple {257#true} call #t~ret5 := main(); {257#true} is VALID [2018-11-23 12:33:51,783 INFO L273 TraceCheckUtils]: 5: Hoare triple {257#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;~q~0 := 500;~s~0 := 700;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);assume 0 != (if ~q~0 < ~m~0 then 1 else 0);assume 0 != (if ~s~0 < ~n~0 then 1 else 0);~i~0 := 0;~j~0 := 0; {277#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:33:51,784 INFO L273 TraceCheckUtils]: 6: Hoare triple {277#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {281#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:33:51,788 INFO L273 TraceCheckUtils]: 7: Hoare triple {281#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !(~j~0 < ~n~0); {258#false} is VALID [2018-11-23 12:33:51,788 INFO L273 TraceCheckUtils]: 8: Hoare triple {258#false} ~i~0 := 1 + ~i~0; {258#false} is VALID [2018-11-23 12:33:51,789 INFO L273 TraceCheckUtils]: 9: Hoare triple {258#false} assume !(~i~0 < ~m~0); {258#false} is VALID [2018-11-23 12:33:51,789 INFO L273 TraceCheckUtils]: 10: Hoare triple {258#false} ~i~0 := 0;~j~0 := 0; {258#false} is VALID [2018-11-23 12:33:51,790 INFO L273 TraceCheckUtils]: 11: Hoare triple {258#false} assume !(~i~0 < ~q~0); {258#false} is VALID [2018-11-23 12:33:51,790 INFO L273 TraceCheckUtils]: 12: Hoare triple {258#false} ~i~0 := 0;~j~0 := 0; {258#false} is VALID [2018-11-23 12:33:51,790 INFO L273 TraceCheckUtils]: 13: Hoare triple {258#false} assume !!(~i~0 < ~q~0);~j~0 := 0; {258#false} is VALID [2018-11-23 12:33:51,790 INFO L273 TraceCheckUtils]: 14: Hoare triple {258#false} assume !!(~j~0 < ~s~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem4 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {258#false} is VALID [2018-11-23 12:33:51,790 INFO L256 TraceCheckUtils]: 15: Hoare triple {258#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {258#false} is VALID [2018-11-23 12:33:51,791 INFO L273 TraceCheckUtils]: 16: Hoare triple {258#false} ~cond := #in~cond; {258#false} is VALID [2018-11-23 12:33:51,791 INFO L273 TraceCheckUtils]: 17: Hoare triple {258#false} assume 0 == ~cond; {258#false} is VALID [2018-11-23 12:33:51,791 INFO L273 TraceCheckUtils]: 18: Hoare triple {258#false} assume !false; {258#false} is VALID [2018-11-23 12:33:51,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:33:51,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:33:51,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:33:51,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-23 12:33:51,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:51,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:33:51,888 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:51,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:33:51,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:33:51,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:33:51,889 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 4 states. [2018-11-23 12:33:52,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:52,216 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2018-11-23 12:33:52,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:33:52,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-23 12:33:52,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:52,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:33:52,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2018-11-23 12:33:52,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:33:52,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2018-11-23 12:33:52,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 70 transitions. [2018-11-23 12:33:52,423 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:52,426 INFO L225 Difference]: With dead ends: 55 [2018-11-23 12:33:52,426 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 12:33:52,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:33:52,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 12:33:52,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2018-11-23 12:33:52,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:52,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 27 states. [2018-11-23 12:33:52,479 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 27 states. [2018-11-23 12:33:52,479 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 27 states. [2018-11-23 12:33:52,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:52,484 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2018-11-23 12:33:52,485 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2018-11-23 12:33:52,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:52,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:52,486 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 36 states. [2018-11-23 12:33:52,486 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 36 states. [2018-11-23 12:33:52,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:52,491 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2018-11-23 12:33:52,491 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2018-11-23 12:33:52,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:52,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:52,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:52,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:52,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:33:52,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-11-23 12:33:52,495 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 19 [2018-11-23 12:33:52,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:52,495 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-23 12:33:52,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:33:52,496 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2018-11-23 12:33:52,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:33:52,496 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:52,497 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:33:52,497 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:52,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:52,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1173975853, now seen corresponding path program 1 times [2018-11-23 12:33:52,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:52,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:52,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:52,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:52,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:52,506 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:52,506 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:52,506 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:33:52,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:52,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:52,697 INFO L256 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2018-11-23 12:33:52,698 INFO L273 TraceCheckUtils]: 1: Hoare triple {512#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {512#true} is VALID [2018-11-23 12:33:52,698 INFO L273 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2018-11-23 12:33:52,698 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #99#return; {512#true} is VALID [2018-11-23 12:33:52,699 INFO L256 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret5 := main(); {512#true} is VALID [2018-11-23 12:33:52,700 INFO L273 TraceCheckUtils]: 5: Hoare triple {512#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;~q~0 := 500;~s~0 := 700;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);assume 0 != (if ~q~0 < ~m~0 then 1 else 0);assume 0 != (if ~s~0 < ~n~0 then 1 else 0);~i~0 := 0;~j~0 := 0; {532#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:33:52,701 INFO L273 TraceCheckUtils]: 6: Hoare triple {532#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {536#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:33:52,703 INFO L273 TraceCheckUtils]: 7: Hoare triple {536#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {540#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:33:52,704 INFO L273 TraceCheckUtils]: 8: Hoare triple {540#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !(~j~0 < ~n~0); {513#false} is VALID [2018-11-23 12:33:52,704 INFO L273 TraceCheckUtils]: 9: Hoare triple {513#false} ~i~0 := 1 + ~i~0; {513#false} is VALID [2018-11-23 12:33:52,705 INFO L273 TraceCheckUtils]: 10: Hoare triple {513#false} assume !(~i~0 < ~m~0); {513#false} is VALID [2018-11-23 12:33:52,705 INFO L273 TraceCheckUtils]: 11: Hoare triple {513#false} ~i~0 := 0;~j~0 := 0; {513#false} is VALID [2018-11-23 12:33:52,706 INFO L273 TraceCheckUtils]: 12: Hoare triple {513#false} assume !(~i~0 < ~q~0); {513#false} is VALID [2018-11-23 12:33:52,706 INFO L273 TraceCheckUtils]: 13: Hoare triple {513#false} ~i~0 := 0;~j~0 := 0; {513#false} is VALID [2018-11-23 12:33:52,706 INFO L273 TraceCheckUtils]: 14: Hoare triple {513#false} assume !!(~i~0 < ~q~0);~j~0 := 0; {513#false} is VALID [2018-11-23 12:33:52,706 INFO L273 TraceCheckUtils]: 15: Hoare triple {513#false} assume !!(~j~0 < ~s~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem4 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {513#false} is VALID [2018-11-23 12:33:52,707 INFO L256 TraceCheckUtils]: 16: Hoare triple {513#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {513#false} is VALID [2018-11-23 12:33:52,707 INFO L273 TraceCheckUtils]: 17: Hoare triple {513#false} ~cond := #in~cond; {513#false} is VALID [2018-11-23 12:33:52,707 INFO L273 TraceCheckUtils]: 18: Hoare triple {513#false} assume 0 == ~cond; {513#false} is VALID [2018-11-23 12:33:52,708 INFO L273 TraceCheckUtils]: 19: Hoare triple {513#false} assume !false; {513#false} is VALID [2018-11-23 12:33:52,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:33:52,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:33:52,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 12:33:52,729 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 12:33:52,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:52,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:33:52,768 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:52,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:33:52,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:33:52,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:33:52,769 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 5 states. [2018-11-23 12:33:53,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:53,099 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2018-11-23 12:33:53,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:33:53,099 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 12:33:53,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:53,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:33:53,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2018-11-23 12:33:53,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:33:53,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2018-11-23 12:33:53,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 84 transitions. [2018-11-23 12:33:53,235 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:53,237 INFO L225 Difference]: With dead ends: 66 [2018-11-23 12:33:53,237 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 12:33:53,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:33:53,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 12:33:53,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 28. [2018-11-23 12:33:53,291 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:53,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 28 states. [2018-11-23 12:33:53,292 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 28 states. [2018-11-23 12:33:53,292 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 28 states. [2018-11-23 12:33:53,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:53,297 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2018-11-23 12:33:53,297 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2018-11-23 12:33:53,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:53,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:53,298 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 46 states. [2018-11-23 12:33:53,298 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 46 states. [2018-11-23 12:33:53,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:53,302 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2018-11-23 12:33:53,303 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2018-11-23 12:33:53,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:53,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:53,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:53,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:53,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:33:53,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-11-23 12:33:53,306 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 20 [2018-11-23 12:33:53,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:53,307 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-23 12:33:53,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:33:53,307 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 12:33:53,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:33:53,308 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:53,308 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:33:53,308 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:53,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:53,309 INFO L82 PathProgramCache]: Analyzing trace with hash 488343988, now seen corresponding path program 2 times [2018-11-23 12:33:53,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:53,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:53,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:53,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:53,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:53,317 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:53,317 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:53,317 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:33:53,335 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:33:53,352 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 12:33:53,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:33:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:53,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:53,433 INFO L256 TraceCheckUtils]: 0: Hoare triple {811#true} call ULTIMATE.init(); {811#true} is VALID [2018-11-23 12:33:53,433 INFO L273 TraceCheckUtils]: 1: Hoare triple {811#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {811#true} is VALID [2018-11-23 12:33:53,434 INFO L273 TraceCheckUtils]: 2: Hoare triple {811#true} assume true; {811#true} is VALID [2018-11-23 12:33:53,434 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {811#true} {811#true} #99#return; {811#true} is VALID [2018-11-23 12:33:53,435 INFO L256 TraceCheckUtils]: 4: Hoare triple {811#true} call #t~ret5 := main(); {811#true} is VALID [2018-11-23 12:33:53,436 INFO L273 TraceCheckUtils]: 5: Hoare triple {811#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;~q~0 := 500;~s~0 := 700;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);assume 0 != (if ~q~0 < ~m~0 then 1 else 0);assume 0 != (if ~s~0 < ~n~0 then 1 else 0);~i~0 := 0;~j~0 := 0; {831#(<= 500 main_~q~0)} is VALID [2018-11-23 12:33:53,436 INFO L273 TraceCheckUtils]: 6: Hoare triple {831#(<= 500 main_~q~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {831#(<= 500 main_~q~0)} is VALID [2018-11-23 12:33:53,438 INFO L273 TraceCheckUtils]: 7: Hoare triple {831#(<= 500 main_~q~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {831#(<= 500 main_~q~0)} is VALID [2018-11-23 12:33:53,443 INFO L273 TraceCheckUtils]: 8: Hoare triple {831#(<= 500 main_~q~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {831#(<= 500 main_~q~0)} is VALID [2018-11-23 12:33:53,444 INFO L273 TraceCheckUtils]: 9: Hoare triple {831#(<= 500 main_~q~0)} assume !(~j~0 < ~n~0); {831#(<= 500 main_~q~0)} is VALID [2018-11-23 12:33:53,444 INFO L273 TraceCheckUtils]: 10: Hoare triple {831#(<= 500 main_~q~0)} ~i~0 := 1 + ~i~0; {831#(<= 500 main_~q~0)} is VALID [2018-11-23 12:33:53,445 INFO L273 TraceCheckUtils]: 11: Hoare triple {831#(<= 500 main_~q~0)} assume !(~i~0 < ~m~0); {831#(<= 500 main_~q~0)} is VALID [2018-11-23 12:33:53,445 INFO L273 TraceCheckUtils]: 12: Hoare triple {831#(<= 500 main_~q~0)} ~i~0 := 0;~j~0 := 0; {853#(and (<= 500 main_~q~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:33:53,446 INFO L273 TraceCheckUtils]: 13: Hoare triple {853#(and (<= 500 main_~q~0) (<= main_~i~0 0))} assume !(~i~0 < ~q~0); {812#false} is VALID [2018-11-23 12:33:53,446 INFO L273 TraceCheckUtils]: 14: Hoare triple {812#false} ~i~0 := 0;~j~0 := 0; {812#false} is VALID [2018-11-23 12:33:53,447 INFO L273 TraceCheckUtils]: 15: Hoare triple {812#false} assume !!(~i~0 < ~q~0);~j~0 := 0; {812#false} is VALID [2018-11-23 12:33:53,447 INFO L273 TraceCheckUtils]: 16: Hoare triple {812#false} assume !!(~j~0 < ~s~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem4 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {812#false} is VALID [2018-11-23 12:33:53,448 INFO L256 TraceCheckUtils]: 17: Hoare triple {812#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {812#false} is VALID [2018-11-23 12:33:53,448 INFO L273 TraceCheckUtils]: 18: Hoare triple {812#false} ~cond := #in~cond; {812#false} is VALID [2018-11-23 12:33:53,449 INFO L273 TraceCheckUtils]: 19: Hoare triple {812#false} assume 0 == ~cond; {812#false} is VALID [2018-11-23 12:33:53,449 INFO L273 TraceCheckUtils]: 20: Hoare triple {812#false} assume !false; {812#false} is VALID [2018-11-23 12:33:53,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:33:53,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:33:53,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:33:53,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-23 12:33:53,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:53,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:33:53,494 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:53,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:33:53,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:33:53,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:33:53,495 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 4 states. [2018-11-23 12:33:53,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:53,824 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2018-11-23 12:33:53,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:33:53,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-23 12:33:53,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:53,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:33:53,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2018-11-23 12:33:53,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:33:53,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2018-11-23 12:33:53,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 59 transitions. [2018-11-23 12:33:53,958 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:53,960 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:33:53,961 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:33:53,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:33:53,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:33:54,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 29. [2018-11-23 12:33:54,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:54,020 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 29 states. [2018-11-23 12:33:54,020 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 29 states. [2018-11-23 12:33:54,021 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 29 states. [2018-11-23 12:33:54,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:54,025 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2018-11-23 12:33:54,025 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2018-11-23 12:33:54,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:54,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:54,026 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 40 states. [2018-11-23 12:33:54,026 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 40 states. [2018-11-23 12:33:54,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:54,029 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2018-11-23 12:33:54,029 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2018-11-23 12:33:54,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:54,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:54,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:54,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:54,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:33:54,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2018-11-23 12:33:54,033 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 21 [2018-11-23 12:33:54,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:54,033 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2018-11-23 12:33:54,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:33:54,034 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 12:33:54,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:33:54,034 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:54,035 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:33:54,035 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:54,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:54,035 INFO L82 PathProgramCache]: Analyzing trace with hash -362294696, now seen corresponding path program 1 times [2018-11-23 12:33:54,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:54,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:54,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:54,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:33:54,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:54,043 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:54,043 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:54,043 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:33:54,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:54,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:54,214 INFO L256 TraceCheckUtils]: 0: Hoare triple {1081#true} call ULTIMATE.init(); {1081#true} is VALID [2018-11-23 12:33:54,215 INFO L273 TraceCheckUtils]: 1: Hoare triple {1081#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1081#true} is VALID [2018-11-23 12:33:54,215 INFO L273 TraceCheckUtils]: 2: Hoare triple {1081#true} assume true; {1081#true} is VALID [2018-11-23 12:33:54,216 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1081#true} {1081#true} #99#return; {1081#true} is VALID [2018-11-23 12:33:54,216 INFO L256 TraceCheckUtils]: 4: Hoare triple {1081#true} call #t~ret5 := main(); {1081#true} is VALID [2018-11-23 12:33:54,217 INFO L273 TraceCheckUtils]: 5: Hoare triple {1081#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;~q~0 := 500;~s~0 := 700;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);assume 0 != (if ~q~0 < ~m~0 then 1 else 0);assume 0 != (if ~s~0 < ~n~0 then 1 else 0);~i~0 := 0;~j~0 := 0; {1101#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:33:54,218 INFO L273 TraceCheckUtils]: 6: Hoare triple {1101#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {1105#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:33:54,220 INFO L273 TraceCheckUtils]: 7: Hoare triple {1105#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {1109#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:33:54,220 INFO L273 TraceCheckUtils]: 8: Hoare triple {1109#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {1113#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:33:54,221 INFO L273 TraceCheckUtils]: 9: Hoare triple {1113#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !(~j~0 < ~n~0); {1082#false} is VALID [2018-11-23 12:33:54,222 INFO L273 TraceCheckUtils]: 10: Hoare triple {1082#false} ~i~0 := 1 + ~i~0; {1082#false} is VALID [2018-11-23 12:33:54,222 INFO L273 TraceCheckUtils]: 11: Hoare triple {1082#false} assume !(~i~0 < ~m~0); {1082#false} is VALID [2018-11-23 12:33:54,223 INFO L273 TraceCheckUtils]: 12: Hoare triple {1082#false} ~i~0 := 0;~j~0 := 0; {1082#false} is VALID [2018-11-23 12:33:54,223 INFO L273 TraceCheckUtils]: 13: Hoare triple {1082#false} assume !!(~i~0 < ~q~0);~j~0 := 0; {1082#false} is VALID [2018-11-23 12:33:54,223 INFO L273 TraceCheckUtils]: 14: Hoare triple {1082#false} assume !(~j~0 < ~s~0); {1082#false} is VALID [2018-11-23 12:33:54,224 INFO L273 TraceCheckUtils]: 15: Hoare triple {1082#false} ~i~0 := 1 + ~i~0; {1082#false} is VALID [2018-11-23 12:33:54,224 INFO L273 TraceCheckUtils]: 16: Hoare triple {1082#false} assume !(~i~0 < ~q~0); {1082#false} is VALID [2018-11-23 12:33:54,224 INFO L273 TraceCheckUtils]: 17: Hoare triple {1082#false} ~i~0 := 0;~j~0 := 0; {1082#false} is VALID [2018-11-23 12:33:54,225 INFO L273 TraceCheckUtils]: 18: Hoare triple {1082#false} assume !!(~i~0 < ~q~0);~j~0 := 0; {1082#false} is VALID [2018-11-23 12:33:54,225 INFO L273 TraceCheckUtils]: 19: Hoare triple {1082#false} assume !!(~j~0 < ~s~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem4 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {1082#false} is VALID [2018-11-23 12:33:54,225 INFO L256 TraceCheckUtils]: 20: Hoare triple {1082#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1082#false} is VALID [2018-11-23 12:33:54,225 INFO L273 TraceCheckUtils]: 21: Hoare triple {1082#false} ~cond := #in~cond; {1082#false} is VALID [2018-11-23 12:33:54,225 INFO L273 TraceCheckUtils]: 22: Hoare triple {1082#false} assume 0 == ~cond; {1082#false} is VALID [2018-11-23 12:33:54,226 INFO L273 TraceCheckUtils]: 23: Hoare triple {1082#false} assume !false; {1082#false} is VALID [2018-11-23 12:33:54,227 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:33:54,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:33:54,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-23 12:33:54,247 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-23 12:33:54,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:54,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:33:54,271 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:54,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:33:54,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:33:54,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:33:54,272 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 6 states. [2018-11-23 12:33:54,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:54,783 INFO L93 Difference]: Finished difference Result 79 states and 102 transitions. [2018-11-23 12:33:54,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:33:54,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-23 12:33:54,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:54,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:33:54,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2018-11-23 12:33:54,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:33:54,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2018-11-23 12:33:54,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 98 transitions. [2018-11-23 12:33:54,993 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:54,996 INFO L225 Difference]: With dead ends: 79 [2018-11-23 12:33:54,996 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 12:33:54,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:33:54,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 12:33:55,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 30. [2018-11-23 12:33:55,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:55,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 30 states. [2018-11-23 12:33:55,068 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 30 states. [2018-11-23 12:33:55,068 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 30 states. [2018-11-23 12:33:55,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:55,072 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2018-11-23 12:33:55,072 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2018-11-23 12:33:55,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:55,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:55,074 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 57 states. [2018-11-23 12:33:55,074 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 57 states. [2018-11-23 12:33:55,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:55,077 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2018-11-23 12:33:55,078 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2018-11-23 12:33:55,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:55,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:55,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:55,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:55,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:33:55,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-11-23 12:33:55,081 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 24 [2018-11-23 12:33:55,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:55,081 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-23 12:33:55,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:33:55,081 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-11-23 12:33:55,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:33:55,082 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:55,082 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:33:55,083 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:55,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:55,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1895729479, now seen corresponding path program 2 times [2018-11-23 12:33:55,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:55,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:55,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:55,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:55,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:55,091 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:55,091 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:55,091 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 [2018-11-23 12:33:55,107 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:33:55,129 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:33:55,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:33:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:55,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:55,274 INFO L256 TraceCheckUtils]: 0: Hoare triple {1441#true} call ULTIMATE.init(); {1441#true} is VALID [2018-11-23 12:33:55,275 INFO L273 TraceCheckUtils]: 1: Hoare triple {1441#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1441#true} is VALID [2018-11-23 12:33:55,275 INFO L273 TraceCheckUtils]: 2: Hoare triple {1441#true} assume true; {1441#true} is VALID [2018-11-23 12:33:55,275 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1441#true} {1441#true} #99#return; {1441#true} is VALID [2018-11-23 12:33:55,276 INFO L256 TraceCheckUtils]: 4: Hoare triple {1441#true} call #t~ret5 := main(); {1441#true} is VALID [2018-11-23 12:33:55,277 INFO L273 TraceCheckUtils]: 5: Hoare triple {1441#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;~q~0 := 500;~s~0 := 700;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);assume 0 != (if ~q~0 < ~m~0 then 1 else 0);assume 0 != (if ~s~0 < ~n~0 then 1 else 0);~i~0 := 0;~j~0 := 0; {1461#(<= 500 main_~q~0)} is VALID [2018-11-23 12:33:55,282 INFO L273 TraceCheckUtils]: 6: Hoare triple {1461#(<= 500 main_~q~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {1461#(<= 500 main_~q~0)} is VALID [2018-11-23 12:33:55,283 INFO L273 TraceCheckUtils]: 7: Hoare triple {1461#(<= 500 main_~q~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {1461#(<= 500 main_~q~0)} is VALID [2018-11-23 12:33:55,283 INFO L273 TraceCheckUtils]: 8: Hoare triple {1461#(<= 500 main_~q~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {1461#(<= 500 main_~q~0)} is VALID [2018-11-23 12:33:55,284 INFO L273 TraceCheckUtils]: 9: Hoare triple {1461#(<= 500 main_~q~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {1461#(<= 500 main_~q~0)} is VALID [2018-11-23 12:33:55,284 INFO L273 TraceCheckUtils]: 10: Hoare triple {1461#(<= 500 main_~q~0)} assume !(~j~0 < ~n~0); {1461#(<= 500 main_~q~0)} is VALID [2018-11-23 12:33:55,284 INFO L273 TraceCheckUtils]: 11: Hoare triple {1461#(<= 500 main_~q~0)} ~i~0 := 1 + ~i~0; {1461#(<= 500 main_~q~0)} is VALID [2018-11-23 12:33:55,285 INFO L273 TraceCheckUtils]: 12: Hoare triple {1461#(<= 500 main_~q~0)} assume !(~i~0 < ~m~0); {1461#(<= 500 main_~q~0)} is VALID [2018-11-23 12:33:55,285 INFO L273 TraceCheckUtils]: 13: Hoare triple {1461#(<= 500 main_~q~0)} ~i~0 := 0;~j~0 := 0; {1486#(and (<= 500 main_~q~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:33:55,286 INFO L273 TraceCheckUtils]: 14: Hoare triple {1486#(and (<= 500 main_~q~0) (<= main_~i~0 0))} assume !!(~i~0 < ~q~0);~j~0 := 0; {1486#(and (<= 500 main_~q~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:33:55,286 INFO L273 TraceCheckUtils]: 15: Hoare triple {1486#(and (<= 500 main_~q~0) (<= main_~i~0 0))} assume !(~j~0 < ~s~0); {1486#(and (<= 500 main_~q~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:33:55,287 INFO L273 TraceCheckUtils]: 16: Hoare triple {1486#(and (<= 500 main_~q~0) (<= main_~i~0 0))} ~i~0 := 1 + ~i~0; {1496#(and (<= 500 main_~q~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:33:55,291 INFO L273 TraceCheckUtils]: 17: Hoare triple {1496#(and (<= 500 main_~q~0) (<= main_~i~0 1))} assume !(~i~0 < ~q~0); {1442#false} is VALID [2018-11-23 12:33:55,291 INFO L273 TraceCheckUtils]: 18: Hoare triple {1442#false} ~i~0 := 0;~j~0 := 0; {1442#false} is VALID [2018-11-23 12:33:55,291 INFO L273 TraceCheckUtils]: 19: Hoare triple {1442#false} assume !!(~i~0 < ~q~0);~j~0 := 0; {1442#false} is VALID [2018-11-23 12:33:55,292 INFO L273 TraceCheckUtils]: 20: Hoare triple {1442#false} assume !!(~j~0 < ~s~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem4 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {1442#false} is VALID [2018-11-23 12:33:55,292 INFO L256 TraceCheckUtils]: 21: Hoare triple {1442#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1442#false} is VALID [2018-11-23 12:33:55,292 INFO L273 TraceCheckUtils]: 22: Hoare triple {1442#false} ~cond := #in~cond; {1442#false} is VALID [2018-11-23 12:33:55,292 INFO L273 TraceCheckUtils]: 23: Hoare triple {1442#false} assume 0 == ~cond; {1442#false} is VALID [2018-11-23 12:33:55,293 INFO L273 TraceCheckUtils]: 24: Hoare triple {1442#false} assume !false; {1442#false} is VALID [2018-11-23 12:33:55,295 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 12:33:55,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:33:55,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 12:33:55,318 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-23 12:33:55,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:55,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:33:55,344 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:55,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:33:55,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:33:55,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:33:55,345 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 5 states. [2018-11-23 12:33:55,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:55,722 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2018-11-23 12:33:55,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:33:55,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-23 12:33:55,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:55,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:33:55,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2018-11-23 12:33:55,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:33:55,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2018-11-23 12:33:55,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 76 transitions. [2018-11-23 12:33:55,815 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:55,818 INFO L225 Difference]: With dead ends: 69 [2018-11-23 12:33:55,819 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 12:33:55,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:33:55,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 12:33:55,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 33. [2018-11-23 12:33:55,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:55,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 33 states. [2018-11-23 12:33:55,915 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 33 states. [2018-11-23 12:33:55,915 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 33 states. [2018-11-23 12:33:55,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:55,918 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2018-11-23 12:33:55,918 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 71 transitions. [2018-11-23 12:33:55,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:55,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:55,919 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 57 states. [2018-11-23 12:33:55,919 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 57 states. [2018-11-23 12:33:55,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:55,922 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2018-11-23 12:33:55,923 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 71 transitions. [2018-11-23 12:33:55,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:55,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:55,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:55,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:55,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:33:55,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-23 12:33:55,925 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 25 [2018-11-23 12:33:55,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:55,926 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-23 12:33:55,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:33:55,926 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-23 12:33:55,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:33:55,927 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:55,927 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:33:55,927 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:55,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:55,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1579223859, now seen corresponding path program 3 times [2018-11-23 12:33:55,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:55,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:55,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:55,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:33:55,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:55,936 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:55,936 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:55,936 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:33:55,969 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:33:55,988 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 12:33:55,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:33:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:56,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:56,425 INFO L256 TraceCheckUtils]: 0: Hoare triple {1794#true} call ULTIMATE.init(); {1794#true} is VALID [2018-11-23 12:33:56,426 INFO L273 TraceCheckUtils]: 1: Hoare triple {1794#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1794#true} is VALID [2018-11-23 12:33:56,426 INFO L273 TraceCheckUtils]: 2: Hoare triple {1794#true} assume true; {1794#true} is VALID [2018-11-23 12:33:56,427 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1794#true} {1794#true} #99#return; {1794#true} is VALID [2018-11-23 12:33:56,427 INFO L256 TraceCheckUtils]: 4: Hoare triple {1794#true} call #t~ret5 := main(); {1794#true} is VALID [2018-11-23 12:33:56,441 INFO L273 TraceCheckUtils]: 5: Hoare triple {1794#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;~q~0 := 500;~s~0 := 700;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);assume 0 != (if ~q~0 < ~m~0 then 1 else 0);assume 0 != (if ~s~0 < ~n~0 then 1 else 0);~i~0 := 0;~j~0 := 0; {1814#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:56,454 INFO L273 TraceCheckUtils]: 6: Hoare triple {1814#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~i~0 < ~m~0);~j~0 := 0; {1814#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:56,467 INFO L273 TraceCheckUtils]: 7: Hoare triple {1814#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {1814#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:56,473 INFO L273 TraceCheckUtils]: 8: Hoare triple {1814#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {1814#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:56,490 INFO L273 TraceCheckUtils]: 9: Hoare triple {1814#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {1814#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:56,506 INFO L273 TraceCheckUtils]: 10: Hoare triple {1814#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~j~0 < ~n~0); {1814#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:56,515 INFO L273 TraceCheckUtils]: 11: Hoare triple {1814#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} ~i~0 := 1 + ~i~0; {1833#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:56,528 INFO L273 TraceCheckUtils]: 12: Hoare triple {1833#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {1795#false} is VALID [2018-11-23 12:33:56,528 INFO L273 TraceCheckUtils]: 13: Hoare triple {1795#false} ~i~0 := 0;~j~0 := 0; {1795#false} is VALID [2018-11-23 12:33:56,528 INFO L273 TraceCheckUtils]: 14: Hoare triple {1795#false} assume !!(~i~0 < ~q~0);~j~0 := 0; {1795#false} is VALID [2018-11-23 12:33:56,529 INFO L273 TraceCheckUtils]: 15: Hoare triple {1795#false} assume !(~j~0 < ~s~0); {1795#false} is VALID [2018-11-23 12:33:56,529 INFO L273 TraceCheckUtils]: 16: Hoare triple {1795#false} ~i~0 := 1 + ~i~0; {1795#false} is VALID [2018-11-23 12:33:56,529 INFO L273 TraceCheckUtils]: 17: Hoare triple {1795#false} assume !!(~i~0 < ~q~0);~j~0 := 0; {1795#false} is VALID [2018-11-23 12:33:56,529 INFO L273 TraceCheckUtils]: 18: Hoare triple {1795#false} assume !(~j~0 < ~s~0); {1795#false} is VALID [2018-11-23 12:33:56,530 INFO L273 TraceCheckUtils]: 19: Hoare triple {1795#false} ~i~0 := 1 + ~i~0; {1795#false} is VALID [2018-11-23 12:33:56,530 INFO L273 TraceCheckUtils]: 20: Hoare triple {1795#false} assume !(~i~0 < ~q~0); {1795#false} is VALID [2018-11-23 12:33:56,530 INFO L273 TraceCheckUtils]: 21: Hoare triple {1795#false} ~i~0 := 0;~j~0 := 0; {1795#false} is VALID [2018-11-23 12:33:56,531 INFO L273 TraceCheckUtils]: 22: Hoare triple {1795#false} assume !!(~i~0 < ~q~0);~j~0 := 0; {1795#false} is VALID [2018-11-23 12:33:56,531 INFO L273 TraceCheckUtils]: 23: Hoare triple {1795#false} assume !!(~j~0 < ~s~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem4 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {1795#false} is VALID [2018-11-23 12:33:56,531 INFO L256 TraceCheckUtils]: 24: Hoare triple {1795#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1795#false} is VALID [2018-11-23 12:33:56,531 INFO L273 TraceCheckUtils]: 25: Hoare triple {1795#false} ~cond := #in~cond; {1795#false} is VALID [2018-11-23 12:33:56,532 INFO L273 TraceCheckUtils]: 26: Hoare triple {1795#false} assume 0 == ~cond; {1795#false} is VALID [2018-11-23 12:33:56,532 INFO L273 TraceCheckUtils]: 27: Hoare triple {1795#false} assume !false; {1795#false} is VALID [2018-11-23 12:33:56,556 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 12:33:56,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:33:56,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-11-23 12:33:56,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-23 12:33:56,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:56,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:33:56,736 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:56,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:33:56,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:33:56,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:33:56,737 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 4 states. [2018-11-23 12:33:57,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:57,578 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2018-11-23 12:33:57,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:33:57,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-23 12:33:57,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:57,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:33:57,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2018-11-23 12:33:57,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:33:57,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2018-11-23 12:33:57,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 58 transitions. [2018-11-23 12:33:57,646 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:57,648 INFO L225 Difference]: With dead ends: 64 [2018-11-23 12:33:57,648 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 12:33:57,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:33:57,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 12:33:57,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2018-11-23 12:33:57,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:57,718 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 39 states. [2018-11-23 12:33:57,718 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 39 states. [2018-11-23 12:33:57,718 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 39 states. [2018-11-23 12:33:57,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:57,721 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-23 12:33:57,721 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-23 12:33:57,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:57,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:57,722 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 44 states. [2018-11-23 12:33:57,722 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 44 states. [2018-11-23 12:33:57,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:57,723 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-23 12:33:57,724 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-23 12:33:57,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:57,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:57,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:57,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:57,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:33:57,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-11-23 12:33:57,726 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 28 [2018-11-23 12:33:57,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:57,726 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-23 12:33:57,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:33:57,726 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2018-11-23 12:33:57,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:33:57,727 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:57,727 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:33:57,727 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:57,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:57,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1507565378, now seen corresponding path program 4 times [2018-11-23 12:33:57,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:57,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:57,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:57,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:33:57,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:57,735 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:57,735 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:57,736 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 [2018-11-23 12:33:57,751 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:33:57,765 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:33:57,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:33:57,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:57,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:57,856 INFO L256 TraceCheckUtils]: 0: Hoare triple {2133#true} call ULTIMATE.init(); {2133#true} is VALID [2018-11-23 12:33:57,857 INFO L273 TraceCheckUtils]: 1: Hoare triple {2133#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2133#true} is VALID [2018-11-23 12:33:57,857 INFO L273 TraceCheckUtils]: 2: Hoare triple {2133#true} assume true; {2133#true} is VALID [2018-11-23 12:33:57,857 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2133#true} {2133#true} #99#return; {2133#true} is VALID [2018-11-23 12:33:57,858 INFO L256 TraceCheckUtils]: 4: Hoare triple {2133#true} call #t~ret5 := main(); {2133#true} is VALID [2018-11-23 12:33:57,858 INFO L273 TraceCheckUtils]: 5: Hoare triple {2133#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;~q~0 := 500;~s~0 := 700;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);assume 0 != (if ~q~0 < ~m~0 then 1 else 0);assume 0 != (if ~s~0 < ~n~0 then 1 else 0);~i~0 := 0;~j~0 := 0; {2133#true} is VALID [2018-11-23 12:33:57,858 INFO L273 TraceCheckUtils]: 6: Hoare triple {2133#true} assume !!(~i~0 < ~m~0);~j~0 := 0; {2133#true} is VALID [2018-11-23 12:33:57,858 INFO L273 TraceCheckUtils]: 7: Hoare triple {2133#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {2133#true} is VALID [2018-11-23 12:33:57,859 INFO L273 TraceCheckUtils]: 8: Hoare triple {2133#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {2133#true} is VALID [2018-11-23 12:33:57,859 INFO L273 TraceCheckUtils]: 9: Hoare triple {2133#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {2133#true} is VALID [2018-11-23 12:33:57,859 INFO L273 TraceCheckUtils]: 10: Hoare triple {2133#true} assume !(~j~0 < ~n~0); {2133#true} is VALID [2018-11-23 12:33:57,860 INFO L273 TraceCheckUtils]: 11: Hoare triple {2133#true} ~i~0 := 1 + ~i~0; {2133#true} is VALID [2018-11-23 12:33:57,860 INFO L273 TraceCheckUtils]: 12: Hoare triple {2133#true} assume !!(~i~0 < ~m~0);~j~0 := 0; {2133#true} is VALID [2018-11-23 12:33:57,860 INFO L273 TraceCheckUtils]: 13: Hoare triple {2133#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {2133#true} is VALID [2018-11-23 12:33:57,860 INFO L273 TraceCheckUtils]: 14: Hoare triple {2133#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {2133#true} is VALID [2018-11-23 12:33:57,860 INFO L273 TraceCheckUtils]: 15: Hoare triple {2133#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {2133#true} is VALID [2018-11-23 12:33:57,860 INFO L273 TraceCheckUtils]: 16: Hoare triple {2133#true} assume !(~j~0 < ~n~0); {2133#true} is VALID [2018-11-23 12:33:57,861 INFO L273 TraceCheckUtils]: 17: Hoare triple {2133#true} ~i~0 := 1 + ~i~0; {2133#true} is VALID [2018-11-23 12:33:57,861 INFO L273 TraceCheckUtils]: 18: Hoare triple {2133#true} assume !(~i~0 < ~m~0); {2133#true} is VALID [2018-11-23 12:33:57,861 INFO L273 TraceCheckUtils]: 19: Hoare triple {2133#true} ~i~0 := 0;~j~0 := 0; {2133#true} is VALID [2018-11-23 12:33:57,861 INFO L273 TraceCheckUtils]: 20: Hoare triple {2133#true} assume !!(~i~0 < ~q~0);~j~0 := 0; {2198#(<= main_~j~0 0)} is VALID [2018-11-23 12:33:57,862 INFO L273 TraceCheckUtils]: 21: Hoare triple {2198#(<= main_~j~0 0)} assume !(~j~0 < ~s~0); {2202#(<= main_~s~0 0)} is VALID [2018-11-23 12:33:57,862 INFO L273 TraceCheckUtils]: 22: Hoare triple {2202#(<= main_~s~0 0)} ~i~0 := 1 + ~i~0; {2202#(<= main_~s~0 0)} is VALID [2018-11-23 12:33:57,863 INFO L273 TraceCheckUtils]: 23: Hoare triple {2202#(<= main_~s~0 0)} assume !!(~i~0 < ~q~0);~j~0 := 0; {2202#(<= main_~s~0 0)} is VALID [2018-11-23 12:33:57,863 INFO L273 TraceCheckUtils]: 24: Hoare triple {2202#(<= main_~s~0 0)} assume !(~j~0 < ~s~0); {2202#(<= main_~s~0 0)} is VALID [2018-11-23 12:33:57,863 INFO L273 TraceCheckUtils]: 25: Hoare triple {2202#(<= main_~s~0 0)} ~i~0 := 1 + ~i~0; {2202#(<= main_~s~0 0)} is VALID [2018-11-23 12:33:57,864 INFO L273 TraceCheckUtils]: 26: Hoare triple {2202#(<= main_~s~0 0)} assume !(~i~0 < ~q~0); {2202#(<= main_~s~0 0)} is VALID [2018-11-23 12:33:57,864 INFO L273 TraceCheckUtils]: 27: Hoare triple {2202#(<= main_~s~0 0)} ~i~0 := 0;~j~0 := 0; {2202#(<= main_~s~0 0)} is VALID [2018-11-23 12:33:57,865 INFO L273 TraceCheckUtils]: 28: Hoare triple {2202#(<= main_~s~0 0)} assume !!(~i~0 < ~q~0);~j~0 := 0; {2224#(and (<= 0 main_~j~0) (<= main_~s~0 0))} is VALID [2018-11-23 12:33:57,866 INFO L273 TraceCheckUtils]: 29: Hoare triple {2224#(and (<= 0 main_~j~0) (<= main_~s~0 0))} assume !!(~j~0 < ~s~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem4 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {2134#false} is VALID [2018-11-23 12:33:57,866 INFO L256 TraceCheckUtils]: 30: Hoare triple {2134#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {2134#false} is VALID [2018-11-23 12:33:57,867 INFO L273 TraceCheckUtils]: 31: Hoare triple {2134#false} ~cond := #in~cond; {2134#false} is VALID [2018-11-23 12:33:57,867 INFO L273 TraceCheckUtils]: 32: Hoare triple {2134#false} assume 0 == ~cond; {2134#false} is VALID [2018-11-23 12:33:57,867 INFO L273 TraceCheckUtils]: 33: Hoare triple {2134#false} assume !false; {2134#false} is VALID [2018-11-23 12:33:57,871 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-23 12:33:57,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:33:57,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 12:33:57,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-23 12:33:57,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:57,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:33:57,914 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:57,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:33:57,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:33:57,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:33:57,915 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand 5 states. [2018-11-23 12:33:58,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:58,358 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2018-11-23 12:33:58,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:33:58,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-23 12:33:58,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:58,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:33:58,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2018-11-23 12:33:58,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:33:58,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2018-11-23 12:33:58,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 75 transitions. [2018-11-23 12:33:58,438 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:58,439 INFO L225 Difference]: With dead ends: 74 [2018-11-23 12:33:58,439 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 12:33:58,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:33:58,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 12:33:58,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-11-23 12:33:58,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:58,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 42 states. [2018-11-23 12:33:58,515 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 42 states. [2018-11-23 12:33:58,515 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 42 states. [2018-11-23 12:33:58,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:58,517 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2018-11-23 12:33:58,517 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2018-11-23 12:33:58,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:58,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:58,518 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 45 states. [2018-11-23 12:33:58,518 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 45 states. [2018-11-23 12:33:58,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:58,520 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2018-11-23 12:33:58,520 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2018-11-23 12:33:58,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:58,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:58,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:58,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:58,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:33:58,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2018-11-23 12:33:58,522 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 34 [2018-11-23 12:33:58,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:58,523 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2018-11-23 12:33:58,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:33:58,523 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-23 12:33:58,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 12:33:58,524 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:58,524 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:33:58,524 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:58,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:58,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1070464288, now seen corresponding path program 1 times [2018-11-23 12:33:58,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:58,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:58,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:58,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:33:58,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:58,530 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:58,530 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:58,531 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:33:58,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:58,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:58,723 INFO L256 TraceCheckUtils]: 0: Hoare triple {2518#true} call ULTIMATE.init(); {2518#true} is VALID [2018-11-23 12:33:58,723 INFO L273 TraceCheckUtils]: 1: Hoare triple {2518#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2518#true} is VALID [2018-11-23 12:33:58,724 INFO L273 TraceCheckUtils]: 2: Hoare triple {2518#true} assume true; {2518#true} is VALID [2018-11-23 12:33:58,724 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2518#true} {2518#true} #99#return; {2518#true} is VALID [2018-11-23 12:33:58,724 INFO L256 TraceCheckUtils]: 4: Hoare triple {2518#true} call #t~ret5 := main(); {2518#true} is VALID [2018-11-23 12:33:58,725 INFO L273 TraceCheckUtils]: 5: Hoare triple {2518#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;~q~0 := 500;~s~0 := 700;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);assume 0 != (if ~q~0 < ~m~0 then 1 else 0);assume 0 != (if ~s~0 < ~n~0 then 1 else 0);~i~0 := 0;~j~0 := 0; {2538#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:33:58,725 INFO L273 TraceCheckUtils]: 6: Hoare triple {2538#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {2542#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:33:58,726 INFO L273 TraceCheckUtils]: 7: Hoare triple {2542#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {2546#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:33:58,727 INFO L273 TraceCheckUtils]: 8: Hoare triple {2546#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {2550#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:33:58,728 INFO L273 TraceCheckUtils]: 9: Hoare triple {2550#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {2554#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-23 12:33:58,729 INFO L273 TraceCheckUtils]: 10: Hoare triple {2554#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !(~j~0 < ~n~0); {2519#false} is VALID [2018-11-23 12:33:58,729 INFO L273 TraceCheckUtils]: 11: Hoare triple {2519#false} ~i~0 := 1 + ~i~0; {2519#false} is VALID [2018-11-23 12:33:58,729 INFO L273 TraceCheckUtils]: 12: Hoare triple {2519#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {2519#false} is VALID [2018-11-23 12:33:58,730 INFO L273 TraceCheckUtils]: 13: Hoare triple {2519#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {2519#false} is VALID [2018-11-23 12:33:58,730 INFO L273 TraceCheckUtils]: 14: Hoare triple {2519#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {2519#false} is VALID [2018-11-23 12:33:58,730 INFO L273 TraceCheckUtils]: 15: Hoare triple {2519#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {2519#false} is VALID [2018-11-23 12:33:58,731 INFO L273 TraceCheckUtils]: 16: Hoare triple {2519#false} assume !(~j~0 < ~n~0); {2519#false} is VALID [2018-11-23 12:33:58,731 INFO L273 TraceCheckUtils]: 17: Hoare triple {2519#false} ~i~0 := 1 + ~i~0; {2519#false} is VALID [2018-11-23 12:33:58,731 INFO L273 TraceCheckUtils]: 18: Hoare triple {2519#false} assume !(~i~0 < ~m~0); {2519#false} is VALID [2018-11-23 12:33:58,732 INFO L273 TraceCheckUtils]: 19: Hoare triple {2519#false} ~i~0 := 0;~j~0 := 0; {2519#false} is VALID [2018-11-23 12:33:58,732 INFO L273 TraceCheckUtils]: 20: Hoare triple {2519#false} assume !!(~i~0 < ~q~0);~j~0 := 0; {2519#false} is VALID [2018-11-23 12:33:58,732 INFO L273 TraceCheckUtils]: 21: Hoare triple {2519#false} assume !!(~j~0 < ~s~0);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem2;~j~0 := 1 + ~j~0; {2519#false} is VALID [2018-11-23 12:33:58,733 INFO L273 TraceCheckUtils]: 22: Hoare triple {2519#false} assume !(~j~0 < ~s~0); {2519#false} is VALID [2018-11-23 12:33:58,733 INFO L273 TraceCheckUtils]: 23: Hoare triple {2519#false} ~i~0 := 1 + ~i~0; {2519#false} is VALID [2018-11-23 12:33:58,733 INFO L273 TraceCheckUtils]: 24: Hoare triple {2519#false} assume !!(~i~0 < ~q~0);~j~0 := 0; {2519#false} is VALID [2018-11-23 12:33:58,733 INFO L273 TraceCheckUtils]: 25: Hoare triple {2519#false} assume !!(~j~0 < ~s~0);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem2;~j~0 := 1 + ~j~0; {2519#false} is VALID [2018-11-23 12:33:58,734 INFO L273 TraceCheckUtils]: 26: Hoare triple {2519#false} assume !(~j~0 < ~s~0); {2519#false} is VALID [2018-11-23 12:33:58,734 INFO L273 TraceCheckUtils]: 27: Hoare triple {2519#false} ~i~0 := 1 + ~i~0; {2519#false} is VALID [2018-11-23 12:33:58,734 INFO L273 TraceCheckUtils]: 28: Hoare triple {2519#false} assume !(~i~0 < ~q~0); {2519#false} is VALID [2018-11-23 12:33:58,734 INFO L273 TraceCheckUtils]: 29: Hoare triple {2519#false} ~i~0 := 0;~j~0 := 0; {2519#false} is VALID [2018-11-23 12:33:58,734 INFO L273 TraceCheckUtils]: 30: Hoare triple {2519#false} assume !!(~i~0 < ~q~0);~j~0 := 0; {2519#false} is VALID [2018-11-23 12:33:58,735 INFO L273 TraceCheckUtils]: 31: Hoare triple {2519#false} assume !!(~j~0 < ~s~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem4 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {2519#false} is VALID [2018-11-23 12:33:58,735 INFO L256 TraceCheckUtils]: 32: Hoare triple {2519#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {2519#false} is VALID [2018-11-23 12:33:58,735 INFO L273 TraceCheckUtils]: 33: Hoare triple {2519#false} ~cond := #in~cond; {2519#false} is VALID [2018-11-23 12:33:58,735 INFO L273 TraceCheckUtils]: 34: Hoare triple {2519#false} assume 0 == ~cond; {2519#false} is VALID [2018-11-23 12:33:58,736 INFO L273 TraceCheckUtils]: 35: Hoare triple {2519#false} assume !false; {2519#false} is VALID [2018-11-23 12:33:58,737 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 12:33:58,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:33:58,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-23 12:33:58,758 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-11-23 12:33:58,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:58,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:33:58,788 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:58,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:33:58,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:33:58,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:33:58,789 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 7 states. [2018-11-23 12:33:59,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:59,544 INFO L93 Difference]: Finished difference Result 114 states and 145 transitions. [2018-11-23 12:33:59,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:33:59,545 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-11-23 12:33:59,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:59,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:33:59,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2018-11-23 12:33:59,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:33:59,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2018-11-23 12:33:59,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 106 transitions. [2018-11-23 12:33:59,716 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:59,718 INFO L225 Difference]: With dead ends: 114 [2018-11-23 12:33:59,718 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 12:33:59,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:33:59,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 12:33:59,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 44. [2018-11-23 12:33:59,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:59,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 44 states. [2018-11-23 12:33:59,821 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 44 states. [2018-11-23 12:33:59,821 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 44 states. [2018-11-23 12:33:59,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:59,826 INFO L93 Difference]: Finished difference Result 83 states and 106 transitions. [2018-11-23 12:33:59,826 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 106 transitions. [2018-11-23 12:33:59,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:59,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:59,827 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 83 states. [2018-11-23 12:33:59,827 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 83 states. [2018-11-23 12:33:59,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:59,830 INFO L93 Difference]: Finished difference Result 83 states and 106 transitions. [2018-11-23 12:33:59,831 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 106 transitions. [2018-11-23 12:33:59,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:59,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:59,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:59,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:59,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:33:59,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-11-23 12:33:59,833 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 36 [2018-11-23 12:33:59,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:59,833 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-11-23 12:33:59,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:33:59,834 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-11-23 12:33:59,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 12:33:59,834 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:59,835 INFO L402 BasicCegarLoop]: trace histogram [8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:33:59,835 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:59,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:59,835 INFO L82 PathProgramCache]: Analyzing trace with hash -620673214, now seen corresponding path program 2 times [2018-11-23 12:33:59,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:59,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:59,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:59,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:59,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:59,841 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:59,842 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:59,842 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:33:59,853 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:33:59,879 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:33:59,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:33:59,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:59,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:00,067 INFO L256 TraceCheckUtils]: 0: Hoare triple {3055#true} call ULTIMATE.init(); {3055#true} is VALID [2018-11-23 12:34:00,067 INFO L273 TraceCheckUtils]: 1: Hoare triple {3055#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3055#true} is VALID [2018-11-23 12:34:00,068 INFO L273 TraceCheckUtils]: 2: Hoare triple {3055#true} assume true; {3055#true} is VALID [2018-11-23 12:34:00,068 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3055#true} {3055#true} #99#return; {3055#true} is VALID [2018-11-23 12:34:00,068 INFO L256 TraceCheckUtils]: 4: Hoare triple {3055#true} call #t~ret5 := main(); {3055#true} is VALID [2018-11-23 12:34:00,069 INFO L273 TraceCheckUtils]: 5: Hoare triple {3055#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;~q~0 := 500;~s~0 := 700;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);assume 0 != (if ~q~0 < ~m~0 then 1 else 0);assume 0 != (if ~s~0 < ~n~0 then 1 else 0);~i~0 := 0;~j~0 := 0; {3075#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:00,070 INFO L273 TraceCheckUtils]: 6: Hoare triple {3075#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {3079#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:00,071 INFO L273 TraceCheckUtils]: 7: Hoare triple {3079#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {3083#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:34:00,072 INFO L273 TraceCheckUtils]: 8: Hoare triple {3083#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {3087#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:34:00,073 INFO L273 TraceCheckUtils]: 9: Hoare triple {3087#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {3091#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-23 12:34:00,074 INFO L273 TraceCheckUtils]: 10: Hoare triple {3091#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {3095#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-23 12:34:00,075 INFO L273 TraceCheckUtils]: 11: Hoare triple {3095#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume !(~j~0 < ~n~0); {3056#false} is VALID [2018-11-23 12:34:00,075 INFO L273 TraceCheckUtils]: 12: Hoare triple {3056#false} ~i~0 := 1 + ~i~0; {3056#false} is VALID [2018-11-23 12:34:00,076 INFO L273 TraceCheckUtils]: 13: Hoare triple {3056#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {3056#false} is VALID [2018-11-23 12:34:00,076 INFO L273 TraceCheckUtils]: 14: Hoare triple {3056#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {3056#false} is VALID [2018-11-23 12:34:00,076 INFO L273 TraceCheckUtils]: 15: Hoare triple {3056#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {3056#false} is VALID [2018-11-23 12:34:00,076 INFO L273 TraceCheckUtils]: 16: Hoare triple {3056#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {3056#false} is VALID [2018-11-23 12:34:00,077 INFO L273 TraceCheckUtils]: 17: Hoare triple {3056#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {3056#false} is VALID [2018-11-23 12:34:00,077 INFO L273 TraceCheckUtils]: 18: Hoare triple {3056#false} assume !(~j~0 < ~n~0); {3056#false} is VALID [2018-11-23 12:34:00,077 INFO L273 TraceCheckUtils]: 19: Hoare triple {3056#false} ~i~0 := 1 + ~i~0; {3056#false} is VALID [2018-11-23 12:34:00,077 INFO L273 TraceCheckUtils]: 20: Hoare triple {3056#false} assume !(~i~0 < ~m~0); {3056#false} is VALID [2018-11-23 12:34:00,078 INFO L273 TraceCheckUtils]: 21: Hoare triple {3056#false} ~i~0 := 0;~j~0 := 0; {3056#false} is VALID [2018-11-23 12:34:00,078 INFO L273 TraceCheckUtils]: 22: Hoare triple {3056#false} assume !!(~i~0 < ~q~0);~j~0 := 0; {3056#false} is VALID [2018-11-23 12:34:00,078 INFO L273 TraceCheckUtils]: 23: Hoare triple {3056#false} assume !!(~j~0 < ~s~0);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem2;~j~0 := 1 + ~j~0; {3056#false} is VALID [2018-11-23 12:34:00,078 INFO L273 TraceCheckUtils]: 24: Hoare triple {3056#false} assume !(~j~0 < ~s~0); {3056#false} is VALID [2018-11-23 12:34:00,078 INFO L273 TraceCheckUtils]: 25: Hoare triple {3056#false} ~i~0 := 1 + ~i~0; {3056#false} is VALID [2018-11-23 12:34:00,079 INFO L273 TraceCheckUtils]: 26: Hoare triple {3056#false} assume !!(~i~0 < ~q~0);~j~0 := 0; {3056#false} is VALID [2018-11-23 12:34:00,079 INFO L273 TraceCheckUtils]: 27: Hoare triple {3056#false} assume !!(~j~0 < ~s~0);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem2;~j~0 := 1 + ~j~0; {3056#false} is VALID [2018-11-23 12:34:00,079 INFO L273 TraceCheckUtils]: 28: Hoare triple {3056#false} assume !(~j~0 < ~s~0); {3056#false} is VALID [2018-11-23 12:34:00,079 INFO L273 TraceCheckUtils]: 29: Hoare triple {3056#false} ~i~0 := 1 + ~i~0; {3056#false} is VALID [2018-11-23 12:34:00,079 INFO L273 TraceCheckUtils]: 30: Hoare triple {3056#false} assume !(~i~0 < ~q~0); {3056#false} is VALID [2018-11-23 12:34:00,079 INFO L273 TraceCheckUtils]: 31: Hoare triple {3056#false} ~i~0 := 0;~j~0 := 0; {3056#false} is VALID [2018-11-23 12:34:00,080 INFO L273 TraceCheckUtils]: 32: Hoare triple {3056#false} assume !!(~i~0 < ~q~0);~j~0 := 0; {3056#false} is VALID [2018-11-23 12:34:00,080 INFO L273 TraceCheckUtils]: 33: Hoare triple {3056#false} assume !!(~j~0 < ~s~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem4 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {3056#false} is VALID [2018-11-23 12:34:00,080 INFO L256 TraceCheckUtils]: 34: Hoare triple {3056#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {3056#false} is VALID [2018-11-23 12:34:00,080 INFO L273 TraceCheckUtils]: 35: Hoare triple {3056#false} ~cond := #in~cond; {3056#false} is VALID [2018-11-23 12:34:00,081 INFO L273 TraceCheckUtils]: 36: Hoare triple {3056#false} assume 0 == ~cond; {3056#false} is VALID [2018-11-23 12:34:00,081 INFO L273 TraceCheckUtils]: 37: Hoare triple {3056#false} assume !false; {3056#false} is VALID [2018-11-23 12:34:00,082 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-23 12:34:00,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:00,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-23 12:34:00,112 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-11-23 12:34:00,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:00,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:34:00,146 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:00,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:34:00,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:34:00,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:34:00,147 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 8 states. [2018-11-23 12:34:00,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:00,932 INFO L93 Difference]: Finished difference Result 129 states and 165 transitions. [2018-11-23 12:34:00,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:34:00,933 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-11-23 12:34:00,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:00,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:34:00,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 120 transitions. [2018-11-23 12:34:00,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:34:00,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 120 transitions. [2018-11-23 12:34:00,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 120 transitions. [2018-11-23 12:34:01,088 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:01,090 INFO L225 Difference]: With dead ends: 129 [2018-11-23 12:34:01,091 INFO L226 Difference]: Without dead ends: 97 [2018-11-23 12:34:01,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:34:01,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-23 12:34:01,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 46. [2018-11-23 12:34:01,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:01,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 46 states. [2018-11-23 12:34:01,344 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 46 states. [2018-11-23 12:34:01,344 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 46 states. [2018-11-23 12:34:01,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:01,348 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2018-11-23 12:34:01,348 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2018-11-23 12:34:01,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:01,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:01,348 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 97 states. [2018-11-23 12:34:01,348 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 97 states. [2018-11-23 12:34:01,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:01,351 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2018-11-23 12:34:01,351 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2018-11-23 12:34:01,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:01,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:01,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:01,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:01,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:34:01,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-11-23 12:34:01,352 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 38 [2018-11-23 12:34:01,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:01,353 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-11-23 12:34:01,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:34:01,353 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-11-23 12:34:01,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:34:01,354 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:01,354 INFO L402 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:01,354 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:01,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:01,354 INFO L82 PathProgramCache]: Analyzing trace with hash 11267488, now seen corresponding path program 3 times [2018-11-23 12:34:01,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:01,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:01,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:01,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:01,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:01,361 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:01,361 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:01,361 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:34:01,372 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:34:01,394 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 12:34:01,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:01,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:01,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 12:34:01,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:34:01,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:34:01,553 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-11-23 12:34:01,960 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:34:01,962 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: zero is neutral element of plus operator at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:87) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.pqe.XnfDer.derSimple(XnfDer.java:134) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.pqe.XnfDer.tryToEliminate(XnfDer.java:97) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.QuantifierPusher.applyEliminationTechniques(QuantifierPusher.java:302) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:215) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPush(QuantifierPusher.java:134) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:107) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:253) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.TermDomainOperationProvider.constructQuantifiedFormula(TermDomainOperationProvider.java:115) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:136) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 12:34:01,967 INFO L168 Benchmark]: Toolchain (without parser) took 13808.91 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 856.7 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -259.0 MB). Peak memory consumption was 597.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:34:01,969 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:34:01,970 INFO L168 Benchmark]: CACSL2BoogieTranslator took 392.57 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:34:01,971 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.32 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:34:01,971 INFO L168 Benchmark]: Boogie Preprocessor took 44.94 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:34:01,972 INFO L168 Benchmark]: RCFGBuilder took 820.27 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -738.8 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2018-11-23 12:34:01,973 INFO L168 Benchmark]: TraceAbstraction took 12518.65 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 141.0 MB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 469.2 MB). Peak memory consumption was 610.2 MB. Max. memory is 7.1 GB. [2018-11-23 12:34:01,978 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 392.57 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 27.32 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.94 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 820.27 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -738.8 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12518.65 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 141.0 MB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 469.2 MB). Peak memory consumption was 610.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: zero is neutral element of plus operator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: zero is neutral element of plus operator: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:87) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...