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/transpose-u_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:35:24,998 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:35:25,003 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:35:25,019 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:35:25,020 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:35:25,021 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:35:25,022 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:35:25,024 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:35:25,026 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:35:25,027 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:35:25,027 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:35:25,028 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:35:25,029 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:35:25,030 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:35:25,031 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:35:25,032 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:35:25,033 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:35:25,035 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:35:25,037 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:35:25,038 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:35:25,039 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:35:25,040 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:35:25,043 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:35:25,043 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:35:25,043 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:35:25,047 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:35:25,048 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:35:25,049 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:35:25,052 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:35:25,053 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:35:25,053 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:35:25,054 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:35:25,054 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:35:25,054 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:35:25,057 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:35:25,059 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:35:25,060 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:35:25,088 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:35:25,088 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:35:25,089 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:35:25,089 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:35:25,090 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:35:25,090 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:35:25,091 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:35:25,091 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:35:25,091 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:35:25,091 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:35:25,091 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:35:25,092 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:35:25,092 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:35:25,092 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:35:25,092 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:35:25,092 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:35:25,092 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:35:25,093 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:35:25,093 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:35:25,093 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:35:25,093 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:35:25,093 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:35:25,094 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:35:25,094 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:35:25,094 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:35:25,094 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:35:25,094 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:35:25,095 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:35:25,095 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:35:25,095 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:35:25,095 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:35:25,140 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:35:25,153 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:35:25,156 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:35:25,158 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:35:25,158 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:35:25,159 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-multidimensional/transpose-u_true-unreach-call.i [2018-11-23 12:35:25,217 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8cdda22d/ffe344542d2e4f6db26a7f65f09997d1/FLAGb7bf949ee [2018-11-23 12:35:25,604 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:35:25,605 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-multidimensional/transpose-u_true-unreach-call.i [2018-11-23 12:35:25,612 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8cdda22d/ffe344542d2e4f6db26a7f65f09997d1/FLAGb7bf949ee [2018-11-23 12:35:25,994 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8cdda22d/ffe344542d2e4f6db26a7f65f09997d1 [2018-11-23 12:35:26,004 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:35:26,005 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:35:26,006 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:35:26,006 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:35:26,010 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:35:26,012 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:35:25" (1/1) ... [2018-11-23 12:35:26,015 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e2d8f9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:35:26, skipping insertion in model container [2018-11-23 12:35:26,015 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:35:25" (1/1) ... [2018-11-23 12:35:26,025 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:35:26,048 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:35:26,270 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:35:26,274 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:35:26,308 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:35:26,343 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:35:26,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:35:26 WrapperNode [2018-11-23 12:35:26,343 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:35:26,344 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:35:26,345 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:35:26,345 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:35:26,355 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:35:26" (1/1) ... [2018-11-23 12:35:26,368 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:35:26" (1/1) ... [2018-11-23 12:35:26,377 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:35:26,377 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:35:26,377 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:35:26,377 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:35:26,390 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:35:26" (1/1) ... [2018-11-23 12:35:26,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:35:26" (1/1) ... [2018-11-23 12:35:26,400 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:35:26" (1/1) ... [2018-11-23 12:35:26,400 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:35:26" (1/1) ... [2018-11-23 12:35:26,422 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:35:26" (1/1) ... [2018-11-23 12:35:26,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:35:26" (1/1) ... [2018-11-23 12:35:26,443 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:35:26" (1/1) ... [2018-11-23 12:35:26,445 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:35:26,446 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:35:26,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:35:26,446 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:35:26,447 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:35:26" (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:35:26,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:35:26,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:35:26,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:35:26,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:35:26,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:35:26,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:35:26,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:35:26,578 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:35:26,578 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:35:26,579 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:35:26,579 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:35:26,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:35:27,276 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:35:27,277 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 12:35:27,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:35:27 BoogieIcfgContainer [2018-11-23 12:35:27,277 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:35:27,278 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:35:27,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:35:27,282 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:35:27,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:35:25" (1/3) ... [2018-11-23 12:35:27,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2983fe72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:35:27, skipping insertion in model container [2018-11-23 12:35:27,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:35:26" (2/3) ... [2018-11-23 12:35:27,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2983fe72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:35:27, skipping insertion in model container [2018-11-23 12:35:27,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:35:27" (3/3) ... [2018-11-23 12:35:27,286 INFO L112 eAbstractionObserver]: Analyzing ICFG transpose-u_true-unreach-call.i [2018-11-23 12:35:27,297 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:35:27,308 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:35:27,328 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:35:27,360 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:35:27,361 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:35:27,361 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:35:27,361 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:35:27,361 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:35:27,361 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:35:27,362 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:35:27,362 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:35:27,362 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:35:27,382 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-23 12:35:27,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:35:27,388 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:35:27,389 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:35:27,391 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:35:27,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:35:27,397 INFO L82 PathProgramCache]: Analyzing trace with hash -869876316, now seen corresponding path program 1 times [2018-11-23 12:35:27,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:35:27,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:35:27,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:27,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:35:27,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:27,494 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:35:27,495 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:35:27,495 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:35:27,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:35:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:27,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:35:27,924 INFO L256 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {35#true} is VALID [2018-11-23 12:35:27,928 INFO L273 TraceCheckUtils]: 1: Hoare triple {35#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {35#true} is VALID [2018-11-23 12:35:27,929 INFO L273 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-23 12:35:27,929 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #99#return; {35#true} is VALID [2018-11-23 12:35:27,930 INFO L256 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret8 := main(); {35#true} is VALID [2018-11-23 12:35:27,932 INFO L273 TraceCheckUtils]: 5: Hoare triple {35#true} havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := 1000;~m~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);~i~0 := 0; {55#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:27,934 INFO L273 TraceCheckUtils]: 6: Hoare triple {55#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !(~i~0 < ~n~0); {36#false} is VALID [2018-11-23 12:35:27,934 INFO L273 TraceCheckUtils]: 7: Hoare triple {36#false} ~i~0 := 0;~j~0 := 0; {36#false} is VALID [2018-11-23 12:35:27,935 INFO L273 TraceCheckUtils]: 8: Hoare triple {36#false} assume !(~i~0 < ~n~0); {36#false} is VALID [2018-11-23 12:35:27,935 INFO L273 TraceCheckUtils]: 9: Hoare triple {36#false} ~i~0 := 0; {36#false} is VALID [2018-11-23 12:35:27,935 INFO L273 TraceCheckUtils]: 10: Hoare triple {36#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {36#false} is VALID [2018-11-23 12:35:27,935 INFO L273 TraceCheckUtils]: 11: Hoare triple {36#false} assume !!(~j~0 < ~n~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~j~0 * (4 * ~n~0) + 4 * ~i~0, 4);call #t~mem7 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {36#false} is VALID [2018-11-23 12:35:27,936 INFO L256 TraceCheckUtils]: 12: Hoare triple {36#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {36#false} is VALID [2018-11-23 12:35:27,936 INFO L273 TraceCheckUtils]: 13: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2018-11-23 12:35:27,936 INFO L273 TraceCheckUtils]: 14: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2018-11-23 12:35:27,937 INFO L273 TraceCheckUtils]: 15: Hoare triple {36#false} assume !false; {36#false} is VALID [2018-11-23 12:35:27,940 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:35:27,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:35:27,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:35:27,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:35:27,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:35:27,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:35:28,043 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:35:28,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:35:28,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:35:28,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:35:28,057 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2018-11-23 12:35:28,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:28,652 INFO L93 Difference]: Finished difference Result 62 states and 91 transitions. [2018-11-23 12:35:28,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:35:28,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:35:28,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:35:28,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:35:28,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2018-11-23 12:35:28,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:35:28,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2018-11-23 12:35:28,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 91 transitions. [2018-11-23 12:35:29,205 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:29,218 INFO L225 Difference]: With dead ends: 62 [2018-11-23 12:35:29,218 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 12:35:29,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:35:29,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 12:35:29,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-11-23 12:35:29,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:35:29,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 28 states. [2018-11-23 12:35:29,277 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 28 states. [2018-11-23 12:35:29,277 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 28 states. [2018-11-23 12:35:29,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:29,282 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2018-11-23 12:35:29,282 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2018-11-23 12:35:29,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:29,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:29,284 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 31 states. [2018-11-23 12:35:29,284 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 31 states. [2018-11-23 12:35:29,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:29,292 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2018-11-23 12:35:29,292 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2018-11-23 12:35:29,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:29,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:29,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:35:29,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:35:29,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:35:29,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-11-23 12:35:29,299 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 16 [2018-11-23 12:35:29,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:35:29,299 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-23 12:35:29,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:35:29,300 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 12:35:29,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:35:29,302 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:35:29,302 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:35:29,303 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:35:29,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:35:29,303 INFO L82 PathProgramCache]: Analyzing trace with hash 774791125, now seen corresponding path program 1 times [2018-11-23 12:35:29,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:35:29,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:35:29,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:29,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:35:29,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:29,315 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:35:29,316 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:35:29,316 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:35:29,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:35:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:29,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:35:29,525 INFO L256 TraceCheckUtils]: 0: Hoare triple {272#true} call ULTIMATE.init(); {272#true} is VALID [2018-11-23 12:35:29,526 INFO L273 TraceCheckUtils]: 1: Hoare triple {272#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {272#true} is VALID [2018-11-23 12:35:29,526 INFO L273 TraceCheckUtils]: 2: Hoare triple {272#true} assume true; {272#true} is VALID [2018-11-23 12:35:29,527 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {272#true} {272#true} #99#return; {272#true} is VALID [2018-11-23 12:35:29,527 INFO L256 TraceCheckUtils]: 4: Hoare triple {272#true} call #t~ret8 := main(); {272#true} is VALID [2018-11-23 12:35:29,528 INFO L273 TraceCheckUtils]: 5: Hoare triple {272#true} havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := 1000;~m~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);~i~0 := 0; {292#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:29,529 INFO L273 TraceCheckUtils]: 6: Hoare triple {292#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0; {296#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:35:29,530 INFO L273 TraceCheckUtils]: 7: Hoare triple {296#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} assume !(~j~0 < ~n~0); {273#false} is VALID [2018-11-23 12:35:29,530 INFO L273 TraceCheckUtils]: 8: Hoare triple {273#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {273#false} is VALID [2018-11-23 12:35:29,531 INFO L273 TraceCheckUtils]: 9: Hoare triple {273#false} assume !(~i~0 < ~n~0); {273#false} is VALID [2018-11-23 12:35:29,531 INFO L273 TraceCheckUtils]: 10: Hoare triple {273#false} ~i~0 := 0;~j~0 := 0; {273#false} is VALID [2018-11-23 12:35:29,532 INFO L273 TraceCheckUtils]: 11: Hoare triple {273#false} assume !(~i~0 < ~n~0); {273#false} is VALID [2018-11-23 12:35:29,532 INFO L273 TraceCheckUtils]: 12: Hoare triple {273#false} ~i~0 := 0; {273#false} is VALID [2018-11-23 12:35:29,533 INFO L273 TraceCheckUtils]: 13: Hoare triple {273#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {273#false} is VALID [2018-11-23 12:35:29,533 INFO L273 TraceCheckUtils]: 14: Hoare triple {273#false} assume !!(~j~0 < ~n~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~j~0 * (4 * ~n~0) + 4 * ~i~0, 4);call #t~mem7 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {273#false} is VALID [2018-11-23 12:35:29,533 INFO L256 TraceCheckUtils]: 15: Hoare triple {273#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {273#false} is VALID [2018-11-23 12:35:29,533 INFO L273 TraceCheckUtils]: 16: Hoare triple {273#false} ~cond := #in~cond; {273#false} is VALID [2018-11-23 12:35:29,534 INFO L273 TraceCheckUtils]: 17: Hoare triple {273#false} assume 0 == ~cond; {273#false} is VALID [2018-11-23 12:35:29,534 INFO L273 TraceCheckUtils]: 18: Hoare triple {273#false} assume !false; {273#false} is VALID [2018-11-23 12:35:29,540 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:35:29,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:35:29,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:35:29,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-23 12:35:29,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:35:29,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:35:29,606 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:35:29,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:35:29,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:35:29,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:35:29,608 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 4 states. [2018-11-23 12:35:29,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:29,959 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2018-11-23 12:35:29,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:35:29,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-23 12:35:29,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:35:29,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:35:29,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2018-11-23 12:35:29,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:35:29,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2018-11-23 12:35:29,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 73 transitions. [2018-11-23 12:35:30,125 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:30,127 INFO L225 Difference]: With dead ends: 59 [2018-11-23 12:35:30,128 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 12:35:30,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 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:35:30,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 12:35:30,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2018-11-23 12:35:30,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:35:30,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 31 states. [2018-11-23 12:35:30,171 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 31 states. [2018-11-23 12:35:30,171 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 31 states. [2018-11-23 12:35:30,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:30,175 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2018-11-23 12:35:30,176 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-23 12:35:30,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:30,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:30,177 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 38 states. [2018-11-23 12:35:30,177 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 38 states. [2018-11-23 12:35:30,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:30,181 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2018-11-23 12:35:30,181 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-23 12:35:30,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:30,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:30,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:35:30,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:35:30,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:35:30,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-11-23 12:35:30,185 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 19 [2018-11-23 12:35:30,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:35:30,185 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-23 12:35:30,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:35:30,185 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 12:35:30,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:35:30,186 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:35:30,187 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, 1] [2018-11-23 12:35:30,187 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:35:30,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:35:30,187 INFO L82 PathProgramCache]: Analyzing trace with hash -100218697, now seen corresponding path program 1 times [2018-11-23 12:35:30,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:35:30,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:35:30,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:30,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:35:30,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:30,196 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:35:30,196 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:35:30,196 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:35:30,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:35:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:30,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:30,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:35:30,384 INFO L256 TraceCheckUtils]: 0: Hoare triple {541#true} call ULTIMATE.init(); {541#true} is VALID [2018-11-23 12:35:30,385 INFO L273 TraceCheckUtils]: 1: Hoare triple {541#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {541#true} is VALID [2018-11-23 12:35:30,385 INFO L273 TraceCheckUtils]: 2: Hoare triple {541#true} assume true; {541#true} is VALID [2018-11-23 12:35:30,385 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {541#true} {541#true} #99#return; {541#true} is VALID [2018-11-23 12:35:30,386 INFO L256 TraceCheckUtils]: 4: Hoare triple {541#true} call #t~ret8 := main(); {541#true} is VALID [2018-11-23 12:35:30,386 INFO L273 TraceCheckUtils]: 5: Hoare triple {541#true} havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := 1000;~m~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);~i~0 := 0; {561#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:30,387 INFO L273 TraceCheckUtils]: 6: Hoare triple {561#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0; {565#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:35:30,389 INFO L273 TraceCheckUtils]: 7: Hoare triple {565#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet2; {565#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:35:30,394 INFO L273 TraceCheckUtils]: 8: Hoare triple {565#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {572#(and (<= main_~j~0 1) (<= 1000 main_~n~0))} is VALID [2018-11-23 12:35:30,394 INFO L273 TraceCheckUtils]: 9: Hoare triple {572#(and (<= main_~j~0 1) (<= 1000 main_~n~0))} assume !(~j~0 < ~n~0); {542#false} is VALID [2018-11-23 12:35:30,395 INFO L273 TraceCheckUtils]: 10: Hoare triple {542#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {542#false} is VALID [2018-11-23 12:35:30,395 INFO L273 TraceCheckUtils]: 11: Hoare triple {542#false} assume !(~i~0 < ~n~0); {542#false} is VALID [2018-11-23 12:35:30,395 INFO L273 TraceCheckUtils]: 12: Hoare triple {542#false} ~i~0 := 0;~j~0 := 0; {542#false} is VALID [2018-11-23 12:35:30,395 INFO L273 TraceCheckUtils]: 13: Hoare triple {542#false} assume !(~i~0 < ~n~0); {542#false} is VALID [2018-11-23 12:35:30,396 INFO L273 TraceCheckUtils]: 14: Hoare triple {542#false} ~i~0 := 0; {542#false} is VALID [2018-11-23 12:35:30,396 INFO L273 TraceCheckUtils]: 15: Hoare triple {542#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {542#false} is VALID [2018-11-23 12:35:30,396 INFO L273 TraceCheckUtils]: 16: Hoare triple {542#false} assume !!(~j~0 < ~n~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~j~0 * (4 * ~n~0) + 4 * ~i~0, 4);call #t~mem7 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {542#false} is VALID [2018-11-23 12:35:30,396 INFO L256 TraceCheckUtils]: 17: Hoare triple {542#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {542#false} is VALID [2018-11-23 12:35:30,397 INFO L273 TraceCheckUtils]: 18: Hoare triple {542#false} ~cond := #in~cond; {542#false} is VALID [2018-11-23 12:35:30,397 INFO L273 TraceCheckUtils]: 19: Hoare triple {542#false} assume 0 == ~cond; {542#false} is VALID [2018-11-23 12:35:30,398 INFO L273 TraceCheckUtils]: 20: Hoare triple {542#false} assume !false; {542#false} is VALID [2018-11-23 12:35:30,399 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:35:30,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:35:30,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 12:35:30,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-23 12:35:30,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:35:30,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:35:30,462 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:30,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:35:30,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:35:30,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:35:30,463 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 5 states. [2018-11-23 12:35:30,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:30,786 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2018-11-23 12:35:30,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:35:30,786 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-23 12:35:30,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:35:30,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:35:30,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2018-11-23 12:35:30,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:35:30,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2018-11-23 12:35:30,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 81 transitions. [2018-11-23 12:35:30,932 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:30,935 INFO L225 Difference]: With dead ends: 69 [2018-11-23 12:35:30,935 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 12:35:30,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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:35:30,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 12:35:30,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2018-11-23 12:35:30,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:35:30,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 38 states. [2018-11-23 12:35:30,978 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 38 states. [2018-11-23 12:35:30,978 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 38 states. [2018-11-23 12:35:30,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:30,983 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2018-11-23 12:35:30,983 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2018-11-23 12:35:30,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:30,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:30,984 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 45 states. [2018-11-23 12:35:30,984 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 45 states. [2018-11-23 12:35:30,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:30,988 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2018-11-23 12:35:30,988 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2018-11-23 12:35:30,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:30,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:30,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:35:30,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:35:30,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:35:30,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2018-11-23 12:35:30,992 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 21 [2018-11-23 12:35:30,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:35:30,992 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2018-11-23 12:35:30,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:35:30,993 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2018-11-23 12:35:30,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:35:30,994 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:35:30,994 INFO L402 BasicCegarLoop]: trace histogram [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:35:30,994 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:35:30,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:35:30,995 INFO L82 PathProgramCache]: Analyzing trace with hash 828932377, now seen corresponding path program 2 times [2018-11-23 12:35:30,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:35:30,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:35:30,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:30,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:35:30,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:31,003 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:35:31,003 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:35:31,003 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:35:31,017 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:35:31,036 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 12:35:31,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:35:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:31,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:35:31,133 INFO L256 TraceCheckUtils]: 0: Hoare triple {859#true} call ULTIMATE.init(); {859#true} is VALID [2018-11-23 12:35:31,134 INFO L273 TraceCheckUtils]: 1: Hoare triple {859#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {859#true} is VALID [2018-11-23 12:35:31,134 INFO L273 TraceCheckUtils]: 2: Hoare triple {859#true} assume true; {859#true} is VALID [2018-11-23 12:35:31,135 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {859#true} {859#true} #99#return; {859#true} is VALID [2018-11-23 12:35:31,135 INFO L256 TraceCheckUtils]: 4: Hoare triple {859#true} call #t~ret8 := main(); {859#true} is VALID [2018-11-23 12:35:31,136 INFO L273 TraceCheckUtils]: 5: Hoare triple {859#true} havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := 1000;~m~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);~i~0 := 0; {879#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:31,138 INFO L273 TraceCheckUtils]: 6: Hoare triple {879#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0; {879#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:31,143 INFO L273 TraceCheckUtils]: 7: Hoare triple {879#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet2; {879#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:31,143 INFO L273 TraceCheckUtils]: 8: Hoare triple {879#(<= 1000 main_~n~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {879#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:31,144 INFO L273 TraceCheckUtils]: 9: Hoare triple {879#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet2; {879#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:31,144 INFO L273 TraceCheckUtils]: 10: Hoare triple {879#(<= 1000 main_~n~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {879#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:31,146 INFO L273 TraceCheckUtils]: 11: Hoare triple {879#(<= 1000 main_~n~0)} assume !(~j~0 < ~n~0); {879#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:31,146 INFO L273 TraceCheckUtils]: 12: Hoare triple {879#(<= 1000 main_~n~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {879#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:31,148 INFO L273 TraceCheckUtils]: 13: Hoare triple {879#(<= 1000 main_~n~0)} assume !(~i~0 < ~n~0); {879#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:31,148 INFO L273 TraceCheckUtils]: 14: Hoare triple {879#(<= 1000 main_~n~0)} ~i~0 := 0;~j~0 := 0; {907#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:31,149 INFO L273 TraceCheckUtils]: 15: Hoare triple {907#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !(~i~0 < ~n~0); {860#false} is VALID [2018-11-23 12:35:31,149 INFO L273 TraceCheckUtils]: 16: Hoare triple {860#false} ~i~0 := 0; {860#false} is VALID [2018-11-23 12:35:31,150 INFO L273 TraceCheckUtils]: 17: Hoare triple {860#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {860#false} is VALID [2018-11-23 12:35:31,150 INFO L273 TraceCheckUtils]: 18: Hoare triple {860#false} assume !!(~j~0 < ~n~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~j~0 * (4 * ~n~0) + 4 * ~i~0, 4);call #t~mem7 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {860#false} is VALID [2018-11-23 12:35:31,151 INFO L256 TraceCheckUtils]: 19: Hoare triple {860#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {860#false} is VALID [2018-11-23 12:35:31,151 INFO L273 TraceCheckUtils]: 20: Hoare triple {860#false} ~cond := #in~cond; {860#false} is VALID [2018-11-23 12:35:31,151 INFO L273 TraceCheckUtils]: 21: Hoare triple {860#false} assume 0 == ~cond; {860#false} is VALID [2018-11-23 12:35:31,152 INFO L273 TraceCheckUtils]: 22: Hoare triple {860#false} assume !false; {860#false} is VALID [2018-11-23 12:35:31,153 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 12:35:31,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:35:31,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:35:31,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-23 12:35:31,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:35:31,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:35:31,195 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:31,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:35:31,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:35:31,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:35:31,197 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand 4 states. [2018-11-23 12:35:31,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:31,518 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2018-11-23 12:35:31,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:35:31,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-23 12:35:31,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:35:31,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:35:31,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2018-11-23 12:35:31,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:35:31,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2018-11-23 12:35:31,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 64 transitions. [2018-11-23 12:35:31,602 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:31,605 INFO L225 Difference]: With dead ends: 78 [2018-11-23 12:35:31,605 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 12:35:31,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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:35:31,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 12:35:31,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 39. [2018-11-23 12:35:31,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:35:31,684 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 39 states. [2018-11-23 12:35:31,684 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 39 states. [2018-11-23 12:35:31,684 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 39 states. [2018-11-23 12:35:31,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:31,688 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2018-11-23 12:35:31,689 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2018-11-23 12:35:31,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:31,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:31,690 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 60 states. [2018-11-23 12:35:31,690 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 60 states. [2018-11-23 12:35:31,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:31,694 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2018-11-23 12:35:31,694 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2018-11-23 12:35:31,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:31,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:31,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:35:31,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:35:31,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:35:31,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2018-11-23 12:35:31,699 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 23 [2018-11-23 12:35:31,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:35:31,699 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2018-11-23 12:35:31,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:35:31,700 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2018-11-23 12:35:31,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:35:31,701 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:35:31,701 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 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:35:31,701 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:35:31,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:35:31,701 INFO L82 PathProgramCache]: Analyzing trace with hash -27094831, now seen corresponding path program 1 times [2018-11-23 12:35:31,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:35:31,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:35:31,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:31,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:35:31,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:31,710 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:35:31,710 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:35:31,710 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:35:31,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:35:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:31,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:35:31,896 INFO L256 TraceCheckUtils]: 0: Hoare triple {1229#true} call ULTIMATE.init(); {1229#true} is VALID [2018-11-23 12:35:31,897 INFO L273 TraceCheckUtils]: 1: Hoare triple {1229#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1229#true} is VALID [2018-11-23 12:35:31,897 INFO L273 TraceCheckUtils]: 2: Hoare triple {1229#true} assume true; {1229#true} is VALID [2018-11-23 12:35:31,897 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1229#true} {1229#true} #99#return; {1229#true} is VALID [2018-11-23 12:35:31,898 INFO L256 TraceCheckUtils]: 4: Hoare triple {1229#true} call #t~ret8 := main(); {1229#true} is VALID [2018-11-23 12:35:31,899 INFO L273 TraceCheckUtils]: 5: Hoare triple {1229#true} havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := 1000;~m~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);~i~0 := 0; {1249#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:31,899 INFO L273 TraceCheckUtils]: 6: Hoare triple {1249#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0; {1253#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:35:31,901 INFO L273 TraceCheckUtils]: 7: Hoare triple {1253#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet2; {1253#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:35:31,901 INFO L273 TraceCheckUtils]: 8: Hoare triple {1253#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1260#(and (<= main_~j~0 1) (<= 1000 main_~n~0))} is VALID [2018-11-23 12:35:31,903 INFO L273 TraceCheckUtils]: 9: Hoare triple {1260#(and (<= main_~j~0 1) (<= 1000 main_~n~0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet2; {1260#(and (<= main_~j~0 1) (<= 1000 main_~n~0))} is VALID [2018-11-23 12:35:31,904 INFO L273 TraceCheckUtils]: 10: Hoare triple {1260#(and (<= main_~j~0 1) (<= 1000 main_~n~0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1267#(and (<= 1000 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:35:31,905 INFO L273 TraceCheckUtils]: 11: Hoare triple {1267#(and (<= 1000 main_~n~0) (<= main_~j~0 2))} assume !(~j~0 < ~n~0); {1230#false} is VALID [2018-11-23 12:35:31,905 INFO L273 TraceCheckUtils]: 12: Hoare triple {1230#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1230#false} is VALID [2018-11-23 12:35:31,906 INFO L273 TraceCheckUtils]: 13: Hoare triple {1230#false} assume !(~i~0 < ~n~0); {1230#false} is VALID [2018-11-23 12:35:31,906 INFO L273 TraceCheckUtils]: 14: Hoare triple {1230#false} ~i~0 := 0;~j~0 := 0; {1230#false} is VALID [2018-11-23 12:35:31,907 INFO L273 TraceCheckUtils]: 15: Hoare triple {1230#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {1230#false} is VALID [2018-11-23 12:35:31,907 INFO L273 TraceCheckUtils]: 16: Hoare triple {1230#false} assume !!(~j~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem3, ~#C~0.base, ~#C~0.offset + ~j~0 * (4 * ~n~0) + 4 * ~i~0, 4);havoc #t~mem3;~j~0 := 1 + ~j~0; {1230#false} is VALID [2018-11-23 12:35:31,907 INFO L273 TraceCheckUtils]: 17: Hoare triple {1230#false} assume !!(~j~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem3, ~#C~0.base, ~#C~0.offset + ~j~0 * (4 * ~n~0) + 4 * ~i~0, 4);havoc #t~mem3;~j~0 := 1 + ~j~0; {1230#false} is VALID [2018-11-23 12:35:31,908 INFO L273 TraceCheckUtils]: 18: Hoare triple {1230#false} assume !(~j~0 < ~n~0); {1230#false} is VALID [2018-11-23 12:35:31,908 INFO L273 TraceCheckUtils]: 19: Hoare triple {1230#false} ~i~0 := 1 + ~i~0; {1230#false} is VALID [2018-11-23 12:35:31,909 INFO L273 TraceCheckUtils]: 20: Hoare triple {1230#false} assume !(~i~0 < ~n~0); {1230#false} is VALID [2018-11-23 12:35:31,909 INFO L273 TraceCheckUtils]: 21: Hoare triple {1230#false} ~i~0 := 0; {1230#false} is VALID [2018-11-23 12:35:31,909 INFO L273 TraceCheckUtils]: 22: Hoare triple {1230#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {1230#false} is VALID [2018-11-23 12:35:31,909 INFO L273 TraceCheckUtils]: 23: Hoare triple {1230#false} assume !!(~j~0 < ~n~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~j~0 * (4 * ~n~0) + 4 * ~i~0, 4);call #t~mem7 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {1230#false} is VALID [2018-11-23 12:35:31,909 INFO L256 TraceCheckUtils]: 24: Hoare triple {1230#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1230#false} is VALID [2018-11-23 12:35:31,910 INFO L273 TraceCheckUtils]: 25: Hoare triple {1230#false} ~cond := #in~cond; {1230#false} is VALID [2018-11-23 12:35:31,910 INFO L273 TraceCheckUtils]: 26: Hoare triple {1230#false} assume 0 == ~cond; {1230#false} is VALID [2018-11-23 12:35:31,910 INFO L273 TraceCheckUtils]: 27: Hoare triple {1230#false} assume !false; {1230#false} is VALID [2018-11-23 12:35:31,912 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:35:31,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:35:31,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-23 12:35:31,932 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-23 12:35:31,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:35:31,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:35:31,965 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:31,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:35:31,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:35:31,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:35:31,966 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 6 states. [2018-11-23 12:35:32,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:32,310 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2018-11-23 12:35:32,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:35:32,310 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-23 12:35:32,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:35:32,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:35:32,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2018-11-23 12:35:32,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:35:32,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2018-11-23 12:35:32,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 86 transitions. [2018-11-23 12:35:32,539 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:35:32,542 INFO L225 Difference]: With dead ends: 82 [2018-11-23 12:35:32,542 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 12:35:32,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 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:35:32,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 12:35:32,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2018-11-23 12:35:32,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:35:32,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 46 states. [2018-11-23 12:35:32,646 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 46 states. [2018-11-23 12:35:32,646 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 46 states. [2018-11-23 12:35:32,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:32,649 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2018-11-23 12:35:32,649 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2018-11-23 12:35:32,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:32,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:32,650 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 50 states. [2018-11-23 12:35:32,650 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 50 states. [2018-11-23 12:35:32,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:32,654 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2018-11-23 12:35:32,654 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2018-11-23 12:35:32,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:32,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:32,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:35:32,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:35:32,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:35:32,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-11-23 12:35:32,658 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 28 [2018-11-23 12:35:32,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:35:32,658 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-11-23 12:35:32,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:35:32,658 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-11-23 12:35:32,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:35:32,659 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:35:32,660 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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:35:32,660 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:35:32,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:35:32,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1170331446, now seen corresponding path program 2 times [2018-11-23 12:35:32,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:35:32,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:35:32,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:32,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:35:32,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:32,668 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:35:32,668 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:35:32,669 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:35:32,696 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:35:32,721 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:35:32,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:35:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:32,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:35:32,918 INFO L256 TraceCheckUtils]: 0: Hoare triple {1613#true} call ULTIMATE.init(); {1613#true} is VALID [2018-11-23 12:35:32,918 INFO L273 TraceCheckUtils]: 1: Hoare triple {1613#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1613#true} is VALID [2018-11-23 12:35:32,919 INFO L273 TraceCheckUtils]: 2: Hoare triple {1613#true} assume true; {1613#true} is VALID [2018-11-23 12:35:32,919 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1613#true} {1613#true} #99#return; {1613#true} is VALID [2018-11-23 12:35:32,920 INFO L256 TraceCheckUtils]: 4: Hoare triple {1613#true} call #t~ret8 := main(); {1613#true} is VALID [2018-11-23 12:35:32,921 INFO L273 TraceCheckUtils]: 5: Hoare triple {1613#true} havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := 1000;~m~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);~i~0 := 0; {1633#(<= 1000 main_~n~0)} is VALID [2018-11-23 12:35:32,922 INFO L273 TraceCheckUtils]: 6: Hoare triple {1633#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0; {1637#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:35:32,922 INFO L273 TraceCheckUtils]: 7: Hoare triple {1637#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet2; {1637#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:35:32,923 INFO L273 TraceCheckUtils]: 8: Hoare triple {1637#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1644#(and (<= main_~j~0 1) (<= 1000 main_~n~0))} is VALID [2018-11-23 12:35:32,924 INFO L273 TraceCheckUtils]: 9: Hoare triple {1644#(and (<= main_~j~0 1) (<= 1000 main_~n~0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet2; {1644#(and (<= main_~j~0 1) (<= 1000 main_~n~0))} is VALID [2018-11-23 12:35:32,927 INFO L273 TraceCheckUtils]: 10: Hoare triple {1644#(and (<= main_~j~0 1) (<= 1000 main_~n~0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1651#(and (<= 1000 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:35:32,928 INFO L273 TraceCheckUtils]: 11: Hoare triple {1651#(and (<= 1000 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet2; {1651#(and (<= 1000 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:35:32,929 INFO L273 TraceCheckUtils]: 12: Hoare triple {1651#(and (<= 1000 main_~n~0) (<= main_~j~0 2))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1658#(and (<= main_~j~0 3) (<= 1000 main_~n~0))} is VALID [2018-11-23 12:35:32,930 INFO L273 TraceCheckUtils]: 13: Hoare triple {1658#(and (<= main_~j~0 3) (<= 1000 main_~n~0))} assume !(~j~0 < ~n~0); {1614#false} is VALID [2018-11-23 12:35:32,930 INFO L273 TraceCheckUtils]: 14: Hoare triple {1614#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1614#false} is VALID [2018-11-23 12:35:32,930 INFO L273 TraceCheckUtils]: 15: Hoare triple {1614#false} assume !(~i~0 < ~n~0); {1614#false} is VALID [2018-11-23 12:35:32,931 INFO L273 TraceCheckUtils]: 16: Hoare triple {1614#false} ~i~0 := 0;~j~0 := 0; {1614#false} is VALID [2018-11-23 12:35:32,931 INFO L273 TraceCheckUtils]: 17: Hoare triple {1614#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {1614#false} is VALID [2018-11-23 12:35:32,931 INFO L273 TraceCheckUtils]: 18: Hoare triple {1614#false} assume !!(~j~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem3, ~#C~0.base, ~#C~0.offset + ~j~0 * (4 * ~n~0) + 4 * ~i~0, 4);havoc #t~mem3;~j~0 := 1 + ~j~0; {1614#false} is VALID [2018-11-23 12:35:32,932 INFO L273 TraceCheckUtils]: 19: Hoare triple {1614#false} assume !!(~j~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem3, ~#C~0.base, ~#C~0.offset + ~j~0 * (4 * ~n~0) + 4 * ~i~0, 4);havoc #t~mem3;~j~0 := 1 + ~j~0; {1614#false} is VALID [2018-11-23 12:35:32,932 INFO L273 TraceCheckUtils]: 20: Hoare triple {1614#false} assume !!(~j~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem3, ~#C~0.base, ~#C~0.offset + ~j~0 * (4 * ~n~0) + 4 * ~i~0, 4);havoc #t~mem3;~j~0 := 1 + ~j~0; {1614#false} is VALID [2018-11-23 12:35:32,932 INFO L273 TraceCheckUtils]: 21: Hoare triple {1614#false} assume !(~j~0 < ~n~0); {1614#false} is VALID [2018-11-23 12:35:32,933 INFO L273 TraceCheckUtils]: 22: Hoare triple {1614#false} ~i~0 := 1 + ~i~0; {1614#false} is VALID [2018-11-23 12:35:32,933 INFO L273 TraceCheckUtils]: 23: Hoare triple {1614#false} assume !(~i~0 < ~n~0); {1614#false} is VALID [2018-11-23 12:35:32,934 INFO L273 TraceCheckUtils]: 24: Hoare triple {1614#false} ~i~0 := 0; {1614#false} is VALID [2018-11-23 12:35:32,934 INFO L273 TraceCheckUtils]: 25: Hoare triple {1614#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {1614#false} is VALID [2018-11-23 12:35:32,934 INFO L273 TraceCheckUtils]: 26: Hoare triple {1614#false} assume !!(~j~0 < ~n~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~j~0 * (4 * ~n~0) + 4 * ~i~0, 4);call #t~mem7 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {1614#false} is VALID [2018-11-23 12:35:32,935 INFO L256 TraceCheckUtils]: 27: Hoare triple {1614#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1614#false} is VALID [2018-11-23 12:35:32,935 INFO L273 TraceCheckUtils]: 28: Hoare triple {1614#false} ~cond := #in~cond; {1614#false} is VALID [2018-11-23 12:35:32,935 INFO L273 TraceCheckUtils]: 29: Hoare triple {1614#false} assume 0 == ~cond; {1614#false} is VALID [2018-11-23 12:35:32,935 INFO L273 TraceCheckUtils]: 30: Hoare triple {1614#false} assume !false; {1614#false} is VALID [2018-11-23 12:35:32,938 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 12:35:32,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:35:32,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-23 12:35:32,965 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-11-23 12:35:32,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:35:32,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:35:33,002 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:35:33,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:35:33,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:35:33,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:35:33,003 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 7 states. [2018-11-23 12:35:33,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:33,469 INFO L93 Difference]: Finished difference Result 96 states and 115 transitions. [2018-11-23 12:35:33,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:35:33,469 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-11-23 12:35:33,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:35:33,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:35:33,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2018-11-23 12:35:33,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:35:33,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2018-11-23 12:35:33,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 94 transitions. [2018-11-23 12:35:33,624 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:33,626 INFO L225 Difference]: With dead ends: 96 [2018-11-23 12:35:33,627 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 12:35:33,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 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:35:33,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 12:35:33,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-11-23 12:35:33,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:35:33,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 53 states. [2018-11-23 12:35:33,705 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 53 states. [2018-11-23 12:35:33,705 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 53 states. [2018-11-23 12:35:33,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:33,708 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2018-11-23 12:35:33,709 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2018-11-23 12:35:33,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:33,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:33,710 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 57 states. [2018-11-23 12:35:33,710 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 57 states. [2018-11-23 12:35:33,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:33,713 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2018-11-23 12:35:33,713 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2018-11-23 12:35:33,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:33,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:33,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:35:33,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:35:33,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 12:35:33,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-11-23 12:35:33,717 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 31 [2018-11-23 12:35:33,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:35:33,718 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-11-23 12:35:33,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:35:33,718 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-11-23 12:35:33,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:35:33,719 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:35:33,719 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 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:35:33,719 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:35:33,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:35:33,720 INFO L82 PathProgramCache]: Analyzing trace with hash -195694611, now seen corresponding path program 3 times [2018-11-23 12:35:33,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:35:33,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:35:33,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:33,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:35:33,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:33,729 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:35:33,729 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:35:33,729 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:35:33,747 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:35:33,794 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 12:35:33,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:35:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:33,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:35:34,692 INFO L256 TraceCheckUtils]: 0: Hoare triple {2054#true} call ULTIMATE.init(); {2054#true} is VALID [2018-11-23 12:35:34,692 INFO L273 TraceCheckUtils]: 1: Hoare triple {2054#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2054#true} is VALID [2018-11-23 12:35:34,693 INFO L273 TraceCheckUtils]: 2: Hoare triple {2054#true} assume true; {2054#true} is VALID [2018-11-23 12:35:34,693 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2054#true} {2054#true} #99#return; {2054#true} is VALID [2018-11-23 12:35:34,693 INFO L256 TraceCheckUtils]: 4: Hoare triple {2054#true} call #t~ret8 := main(); {2054#true} is VALID [2018-11-23 12:35:34,694 INFO L273 TraceCheckUtils]: 5: Hoare triple {2054#true} havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := 1000;~m~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);~i~0 := 0; {2074#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:34,695 INFO L273 TraceCheckUtils]: 6: Hoare triple {2074#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !!(~i~0 < ~n~0);~j~0 := 0; {2074#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:34,695 INFO L273 TraceCheckUtils]: 7: Hoare triple {2074#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet2; {2074#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:34,696 INFO L273 TraceCheckUtils]: 8: Hoare triple {2074#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2074#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:34,696 INFO L273 TraceCheckUtils]: 9: Hoare triple {2074#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet2; {2074#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:34,697 INFO L273 TraceCheckUtils]: 10: Hoare triple {2074#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2074#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:34,698 INFO L273 TraceCheckUtils]: 11: Hoare triple {2074#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet2; {2074#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:34,699 INFO L273 TraceCheckUtils]: 12: Hoare triple {2074#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2074#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:34,700 INFO L273 TraceCheckUtils]: 13: Hoare triple {2074#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet2; {2074#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:34,700 INFO L273 TraceCheckUtils]: 14: Hoare triple {2074#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2074#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:34,701 INFO L273 TraceCheckUtils]: 15: Hoare triple {2074#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !(~j~0 < ~n~0); {2074#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:34,702 INFO L273 TraceCheckUtils]: 16: Hoare triple {2074#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2108#(and (<= 1000 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:35:34,703 INFO L273 TraceCheckUtils]: 17: Hoare triple {2108#(and (<= 1000 main_~n~0) (<= main_~i~0 1))} assume !(~i~0 < ~n~0); {2055#false} is VALID [2018-11-23 12:35:34,703 INFO L273 TraceCheckUtils]: 18: Hoare triple {2055#false} ~i~0 := 0;~j~0 := 0; {2055#false} is VALID [2018-11-23 12:35:34,704 INFO L273 TraceCheckUtils]: 19: Hoare triple {2055#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {2055#false} is VALID [2018-11-23 12:35:34,704 INFO L273 TraceCheckUtils]: 20: Hoare triple {2055#false} assume !!(~j~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem3, ~#C~0.base, ~#C~0.offset + ~j~0 * (4 * ~n~0) + 4 * ~i~0, 4);havoc #t~mem3;~j~0 := 1 + ~j~0; {2055#false} is VALID [2018-11-23 12:35:34,704 INFO L273 TraceCheckUtils]: 21: Hoare triple {2055#false} assume !!(~j~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem3, ~#C~0.base, ~#C~0.offset + ~j~0 * (4 * ~n~0) + 4 * ~i~0, 4);havoc #t~mem3;~j~0 := 1 + ~j~0; {2055#false} is VALID [2018-11-23 12:35:34,704 INFO L273 TraceCheckUtils]: 22: Hoare triple {2055#false} assume !!(~j~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem3, ~#C~0.base, ~#C~0.offset + ~j~0 * (4 * ~n~0) + 4 * ~i~0, 4);havoc #t~mem3;~j~0 := 1 + ~j~0; {2055#false} is VALID [2018-11-23 12:35:34,705 INFO L273 TraceCheckUtils]: 23: Hoare triple {2055#false} assume !!(~j~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem3, ~#C~0.base, ~#C~0.offset + ~j~0 * (4 * ~n~0) + 4 * ~i~0, 4);havoc #t~mem3;~j~0 := 1 + ~j~0; {2055#false} is VALID [2018-11-23 12:35:34,705 INFO L273 TraceCheckUtils]: 24: Hoare triple {2055#false} assume !(~j~0 < ~n~0); {2055#false} is VALID [2018-11-23 12:35:34,705 INFO L273 TraceCheckUtils]: 25: Hoare triple {2055#false} ~i~0 := 1 + ~i~0; {2055#false} is VALID [2018-11-23 12:35:34,706 INFO L273 TraceCheckUtils]: 26: Hoare triple {2055#false} assume !(~i~0 < ~n~0); {2055#false} is VALID [2018-11-23 12:35:34,706 INFO L273 TraceCheckUtils]: 27: Hoare triple {2055#false} ~i~0 := 0; {2055#false} is VALID [2018-11-23 12:35:34,706 INFO L273 TraceCheckUtils]: 28: Hoare triple {2055#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {2055#false} is VALID [2018-11-23 12:35:34,706 INFO L273 TraceCheckUtils]: 29: Hoare triple {2055#false} assume !!(~j~0 < ~n~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~j~0 * (4 * ~n~0) + 4 * ~i~0, 4);call #t~mem7 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {2055#false} is VALID [2018-11-23 12:35:34,707 INFO L256 TraceCheckUtils]: 30: Hoare triple {2055#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {2055#false} is VALID [2018-11-23 12:35:34,707 INFO L273 TraceCheckUtils]: 31: Hoare triple {2055#false} ~cond := #in~cond; {2055#false} is VALID [2018-11-23 12:35:34,707 INFO L273 TraceCheckUtils]: 32: Hoare triple {2055#false} assume 0 == ~cond; {2055#false} is VALID [2018-11-23 12:35:34,707 INFO L273 TraceCheckUtils]: 33: Hoare triple {2055#false} assume !false; {2055#false} is VALID [2018-11-23 12:35:34,709 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-23 12:35:34,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:35:34,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-11-23 12:35:34,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:35:34,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:35:34,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:35:34,752 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:35:34,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:35:34,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:35:34,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:35:34,754 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 4 states. [2018-11-23 12:35:35,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:35,381 INFO L93 Difference]: Finished difference Result 109 states and 126 transitions. [2018-11-23 12:35:35,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:35:35,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:35:35,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:35:35,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:35:35,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2018-11-23 12:35:35,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:35:35,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2018-11-23 12:35:35,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 63 transitions. [2018-11-23 12:35:35,473 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:35,476 INFO L225 Difference]: With dead ends: 109 [2018-11-23 12:35:35,476 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 12:35:35,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:35:35,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 12:35:35,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2018-11-23 12:35:35,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:35:35,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 64 states. [2018-11-23 12:35:35,545 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 64 states. [2018-11-23 12:35:35,545 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 64 states. [2018-11-23 12:35:35,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:35,548 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2018-11-23 12:35:35,549 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2018-11-23 12:35:35,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:35,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:35,549 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 74 states. [2018-11-23 12:35:35,549 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 74 states. [2018-11-23 12:35:35,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:35,552 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2018-11-23 12:35:35,552 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2018-11-23 12:35:35,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:35,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:35,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:35:35,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:35:35,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 12:35:35,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2018-11-23 12:35:35,556 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 34 [2018-11-23 12:35:35,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:35:35,556 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2018-11-23 12:35:35,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:35:35,557 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2018-11-23 12:35:35,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 12:35:35,557 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:35:35,558 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 4, 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:35:35,558 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:35:35,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:35:35,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1213445734, now seen corresponding path program 4 times [2018-11-23 12:35:35,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:35:35,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:35:35,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:35,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:35:35,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:35,566 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:35:35,566 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:35:35,566 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:35:35,579 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:35:35,596 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:35:35,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:35:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:35,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:35:35,838 INFO L256 TraceCheckUtils]: 0: Hoare triple {2573#true} call ULTIMATE.init(); {2573#true} is VALID [2018-11-23 12:35:35,838 INFO L273 TraceCheckUtils]: 1: Hoare triple {2573#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2573#true} is VALID [2018-11-23 12:35:35,838 INFO L273 TraceCheckUtils]: 2: Hoare triple {2573#true} assume true; {2573#true} is VALID [2018-11-23 12:35:35,838 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2573#true} {2573#true} #99#return; {2573#true} is VALID [2018-11-23 12:35:35,838 INFO L256 TraceCheckUtils]: 4: Hoare triple {2573#true} call #t~ret8 := main(); {2573#true} is VALID [2018-11-23 12:35:35,839 INFO L273 TraceCheckUtils]: 5: Hoare triple {2573#true} havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := 1000;~m~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);~i~0 := 0; {2573#true} is VALID [2018-11-23 12:35:35,839 INFO L273 TraceCheckUtils]: 6: Hoare triple {2573#true} assume !!(~i~0 < ~n~0);~j~0 := 0; {2573#true} is VALID [2018-11-23 12:35:35,839 INFO L273 TraceCheckUtils]: 7: Hoare triple {2573#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet2; {2573#true} is VALID [2018-11-23 12:35:35,839 INFO L273 TraceCheckUtils]: 8: Hoare triple {2573#true} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2573#true} is VALID [2018-11-23 12:35:35,839 INFO L273 TraceCheckUtils]: 9: Hoare triple {2573#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet2; {2573#true} is VALID [2018-11-23 12:35:35,839 INFO L273 TraceCheckUtils]: 10: Hoare triple {2573#true} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2573#true} is VALID [2018-11-23 12:35:35,840 INFO L273 TraceCheckUtils]: 11: Hoare triple {2573#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet2; {2573#true} is VALID [2018-11-23 12:35:35,840 INFO L273 TraceCheckUtils]: 12: Hoare triple {2573#true} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2573#true} is VALID [2018-11-23 12:35:35,840 INFO L273 TraceCheckUtils]: 13: Hoare triple {2573#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet2; {2573#true} is VALID [2018-11-23 12:35:35,840 INFO L273 TraceCheckUtils]: 14: Hoare triple {2573#true} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2573#true} is VALID [2018-11-23 12:35:35,840 INFO L273 TraceCheckUtils]: 15: Hoare triple {2573#true} assume !(~j~0 < ~n~0); {2573#true} is VALID [2018-11-23 12:35:35,841 INFO L273 TraceCheckUtils]: 16: Hoare triple {2573#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2573#true} is VALID [2018-11-23 12:35:35,841 INFO L273 TraceCheckUtils]: 17: Hoare triple {2573#true} assume !!(~i~0 < ~n~0);~j~0 := 0; {2573#true} is VALID [2018-11-23 12:35:35,841 INFO L273 TraceCheckUtils]: 18: Hoare triple {2573#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet2; {2573#true} is VALID [2018-11-23 12:35:35,841 INFO L273 TraceCheckUtils]: 19: Hoare triple {2573#true} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2573#true} is VALID [2018-11-23 12:35:35,842 INFO L273 TraceCheckUtils]: 20: Hoare triple {2573#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet2; {2573#true} is VALID [2018-11-23 12:35:35,842 INFO L273 TraceCheckUtils]: 21: Hoare triple {2573#true} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2573#true} is VALID [2018-11-23 12:35:35,842 INFO L273 TraceCheckUtils]: 22: Hoare triple {2573#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet2; {2573#true} is VALID [2018-11-23 12:35:35,842 INFO L273 TraceCheckUtils]: 23: Hoare triple {2573#true} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2573#true} is VALID [2018-11-23 12:35:35,843 INFO L273 TraceCheckUtils]: 24: Hoare triple {2573#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet2; {2573#true} is VALID [2018-11-23 12:35:35,843 INFO L273 TraceCheckUtils]: 25: Hoare triple {2573#true} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2573#true} is VALID [2018-11-23 12:35:35,843 INFO L273 TraceCheckUtils]: 26: Hoare triple {2573#true} assume !(~j~0 < ~n~0); {2573#true} is VALID [2018-11-23 12:35:35,843 INFO L273 TraceCheckUtils]: 27: Hoare triple {2573#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2573#true} is VALID [2018-11-23 12:35:35,843 INFO L273 TraceCheckUtils]: 28: Hoare triple {2573#true} assume !(~i~0 < ~n~0); {2573#true} is VALID [2018-11-23 12:35:35,846 INFO L273 TraceCheckUtils]: 29: Hoare triple {2573#true} ~i~0 := 0;~j~0 := 0; {2665#(<= main_~i~0 0)} is VALID [2018-11-23 12:35:35,846 INFO L273 TraceCheckUtils]: 30: Hoare triple {2665#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 0; {2669#(and (<= 0 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:35,847 INFO L273 TraceCheckUtils]: 31: Hoare triple {2669#(and (<= 0 main_~j~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem3, ~#C~0.base, ~#C~0.offset + ~j~0 * (4 * ~n~0) + 4 * ~i~0, 4);havoc #t~mem3;~j~0 := 1 + ~j~0; {2673#(and (<= 1 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:35,854 INFO L273 TraceCheckUtils]: 32: Hoare triple {2673#(and (<= 1 main_~j~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem3, ~#C~0.base, ~#C~0.offset + ~j~0 * (4 * ~n~0) + 4 * ~i~0, 4);havoc #t~mem3;~j~0 := 1 + ~j~0; {2677#(and (<= 2 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:35,855 INFO L273 TraceCheckUtils]: 33: Hoare triple {2677#(and (<= 2 main_~j~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem3, ~#C~0.base, ~#C~0.offset + ~j~0 * (4 * ~n~0) + 4 * ~i~0, 4);havoc #t~mem3;~j~0 := 1 + ~j~0; {2681#(and (<= 3 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:35,856 INFO L273 TraceCheckUtils]: 34: Hoare triple {2681#(and (<= 3 main_~j~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem3, ~#C~0.base, ~#C~0.offset + ~j~0 * (4 * ~n~0) + 4 * ~i~0, 4);havoc #t~mem3;~j~0 := 1 + ~j~0; {2685#(and (<= 4 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:35,857 INFO L273 TraceCheckUtils]: 35: Hoare triple {2685#(and (<= 4 main_~n~0) (<= main_~i~0 0))} assume !(~j~0 < ~n~0); {2685#(and (<= 4 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:35:35,858 INFO L273 TraceCheckUtils]: 36: Hoare triple {2685#(and (<= 4 main_~n~0) (<= main_~i~0 0))} ~i~0 := 1 + ~i~0; {2692#(and (<= main_~i~0 1) (<= 4 main_~n~0))} is VALID [2018-11-23 12:35:35,859 INFO L273 TraceCheckUtils]: 37: Hoare triple {2692#(and (<= main_~i~0 1) (<= 4 main_~n~0))} assume !(~i~0 < ~n~0); {2574#false} is VALID [2018-11-23 12:35:35,859 INFO L273 TraceCheckUtils]: 38: Hoare triple {2574#false} ~i~0 := 0; {2574#false} is VALID [2018-11-23 12:35:35,859 INFO L273 TraceCheckUtils]: 39: Hoare triple {2574#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {2574#false} is VALID [2018-11-23 12:35:35,860 INFO L273 TraceCheckUtils]: 40: Hoare triple {2574#false} assume !!(~j~0 < ~n~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~j~0 * (4 * ~n~0) + 4 * ~i~0, 4);call #t~mem7 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {2574#false} is VALID [2018-11-23 12:35:35,860 INFO L256 TraceCheckUtils]: 41: Hoare triple {2574#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {2574#false} is VALID [2018-11-23 12:35:35,860 INFO L273 TraceCheckUtils]: 42: Hoare triple {2574#false} ~cond := #in~cond; {2574#false} is VALID [2018-11-23 12:35:35,860 INFO L273 TraceCheckUtils]: 43: Hoare triple {2574#false} assume 0 == ~cond; {2574#false} is VALID [2018-11-23 12:35:35,861 INFO L273 TraceCheckUtils]: 44: Hoare triple {2574#false} assume !false; {2574#false} is VALID [2018-11-23 12:35:35,865 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-23 12:35:35,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:35:35,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-11-23 12:35:35,894 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-11-23 12:35:35,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:35:35,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:35:35,959 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:35,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:35:35,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:35:35,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:35:35,960 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand 9 states. [2018-11-23 12:35:36,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:36,744 INFO L93 Difference]: Finished difference Result 151 states and 178 transitions. [2018-11-23 12:35:36,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:35:36,745 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-11-23 12:35:36,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:35:36,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:35:36,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 107 transitions. [2018-11-23 12:35:36,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:35:36,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 107 transitions. [2018-11-23 12:35:36,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 107 transitions. [2018-11-23 12:35:36,879 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:35:36,882 INFO L225 Difference]: With dead ends: 151 [2018-11-23 12:35:36,882 INFO L226 Difference]: Without dead ends: 125 [2018-11-23 12:35:36,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:35:36,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-23 12:35:36,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 71. [2018-11-23 12:35:36,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:35:36,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 71 states. [2018-11-23 12:35:36,979 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 71 states. [2018-11-23 12:35:36,979 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 71 states. [2018-11-23 12:35:36,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:36,984 INFO L93 Difference]: Finished difference Result 125 states and 147 transitions. [2018-11-23 12:35:36,984 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 147 transitions. [2018-11-23 12:35:36,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:36,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:36,985 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 125 states. [2018-11-23 12:35:36,986 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 125 states. [2018-11-23 12:35:36,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:36,991 INFO L93 Difference]: Finished difference Result 125 states and 147 transitions. [2018-11-23 12:35:36,991 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 147 transitions. [2018-11-23 12:35:36,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:35:36,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:35:36,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:35:36,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:35:36,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 12:35:36,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2018-11-23 12:35:36,996 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 45 [2018-11-23 12:35:36,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:35:36,996 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2018-11-23 12:35:36,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:35:36,996 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2018-11-23 12:35:36,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 12:35:36,997 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:35:36,997 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 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:35:36,998 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:35:36,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:35:36,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1509397052, now seen corresponding path program 5 times [2018-11-23 12:35:36,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:35:36,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:35:36,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:36,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:35:37,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:37,005 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:35:37,006 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:35:37,006 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:35:37,023 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1