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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-multidimensional/diff-2-n-u_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:11:30,916 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:11:30,921 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:11:30,938 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:11:30,939 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:11:30,940 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:11:30,941 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:11:30,943 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:11:30,945 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:11:30,945 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:11:30,946 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:11:30,947 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:11:30,948 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:11:30,949 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:11:30,950 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:11:30,951 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:11:30,952 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:11:30,954 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:11:30,956 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:11:30,958 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:11:30,959 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:11:30,960 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:11:30,963 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:11:30,963 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:11:30,963 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:11:30,964 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:11:30,966 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:11:30,967 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:11:30,967 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:11:30,969 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:11:30,969 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:11:30,970 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:11:30,970 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:11:30,970 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:11:30,971 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:11:30,972 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:11:30,972 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-14 17:11:30,989 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:11:30,989 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:11:30,990 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:11:30,990 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:11:30,991 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:11:30,991 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:11:30,991 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:11:30,992 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:11:30,992 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:11:30,992 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:11:30,992 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:11:30,992 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:11:30,993 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:11:30,993 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:11:30,993 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:11:30,993 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:11:30,993 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:11:30,993 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:11:30,994 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:11:30,994 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:11:30,994 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:11:30,994 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:11:30,994 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:11:30,995 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:11:30,995 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:11:30,995 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:11:30,995 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:11:30,996 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:11:30,996 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:11:30,996 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:11:31,039 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:11:31,052 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:11:31,056 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:11:31,057 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:11:31,058 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:11:31,059 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-multidimensional/diff-2-n-u_true-unreach-call.i [2018-11-14 17:11:31,116 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7345cfdbf/454f0e72966546d6a9cee7a26e6281bf/FLAG1e812aeb9 [2018-11-14 17:11:31,575 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:11:31,575 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-multidimensional/diff-2-n-u_true-unreach-call.i [2018-11-14 17:11:31,583 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7345cfdbf/454f0e72966546d6a9cee7a26e6281bf/FLAG1e812aeb9 [2018-11-14 17:11:31,600 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7345cfdbf/454f0e72966546d6a9cee7a26e6281bf [2018-11-14 17:11:31,615 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:11:31,617 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:11:31,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:11:31,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:11:31,624 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:11:31,625 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:11:31" (1/1) ... [2018-11-14 17:11:31,629 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e9d245f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:11:31, skipping insertion in model container [2018-11-14 17:11:31,629 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:11:31" (1/1) ... [2018-11-14 17:11:31,640 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:11:31,673 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:11:31,948 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:11:31,957 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:11:32,017 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:11:32,041 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:11:32,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:11:32 WrapperNode [2018-11-14 17:11:32,042 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:11:32,042 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:11:32,042 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:11:32,043 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:11:32,059 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:11:32" (1/1) ... [2018-11-14 17:11:32,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:11:32" (1/1) ... [2018-11-14 17:11:32,070 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:11:32" (1/1) ... [2018-11-14 17:11:32,071 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:11:32" (1/1) ... [2018-11-14 17:11:32,089 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:11:32" (1/1) ... [2018-11-14 17:11:32,111 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:11:32" (1/1) ... [2018-11-14 17:11:32,113 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:11:32" (1/1) ... [2018-11-14 17:11:32,121 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:11:32,122 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:11:32,122 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:11:32,122 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:11:32,123 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:11:32" (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-14 17:11:32,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:11:32,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:11:32,260 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:11:32,261 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:11:32,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:11:32,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:11:32,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-11-14 17:11:32,261 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:11:32,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:11:32,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:11:32,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:11:32,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:11:32,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:11:32,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:11:32,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:11:33,213 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:11:33,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:11:33 BoogieIcfgContainer [2018-11-14 17:11:33,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:11:33,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:11:33,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:11:33,219 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:11:33,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:11:31" (1/3) ... [2018-11-14 17:11:33,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b2169c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:11:33, skipping insertion in model container [2018-11-14 17:11:33,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:11:32" (2/3) ... [2018-11-14 17:11:33,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b2169c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:11:33, skipping insertion in model container [2018-11-14 17:11:33,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:11:33" (3/3) ... [2018-11-14 17:11:33,223 INFO L112 eAbstractionObserver]: Analyzing ICFG diff-2-n-u_true-unreach-call.i [2018-11-14 17:11:33,233 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:11:33,242 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:11:33,260 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:11:33,294 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:11:33,295 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:11:33,295 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:11:33,295 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:11:33,296 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:11:33,296 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:11:33,296 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:11:33,296 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:11:33,297 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:11:33,317 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-14 17:11:33,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 17:11:33,325 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:11:33,326 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:11:33,328 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:11:33,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:11:33,335 INFO L82 PathProgramCache]: Analyzing trace with hash -834079483, now seen corresponding path program 1 times [2018-11-14 17:11:33,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:11:33,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:11:33,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:33,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:11:33,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:33,418 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:11:33,419 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:11:33,419 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-14 17:11:33,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:11:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:11:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:11:33,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:11:33,586 INFO L256 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {45#true} is VALID [2018-11-14 17:11:33,589 INFO L273 TraceCheckUtils]: 1: Hoare triple {45#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {45#true} is VALID [2018-11-14 17:11:33,590 INFO L273 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2018-11-14 17:11:33,590 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #133#return; {45#true} is VALID [2018-11-14 17:11:33,591 INFO L256 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret9 := main(); {45#true} is VALID [2018-11-14 17:11:33,591 INFO L273 TraceCheckUtils]: 5: Hoare triple {45#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);~i~0 := 0;~j~0 := 0; {45#true} is VALID [2018-11-14 17:11:33,596 INFO L273 TraceCheckUtils]: 6: Hoare triple {45#true} assume !true; {46#false} is VALID [2018-11-14 17:11:33,596 INFO L273 TraceCheckUtils]: 7: Hoare triple {46#false} ~i~0 := 0;~j~0 := 0; {46#false} is VALID [2018-11-14 17:11:33,596 INFO L273 TraceCheckUtils]: 8: Hoare triple {46#false} assume !true; {46#false} is VALID [2018-11-14 17:11:33,597 INFO L273 TraceCheckUtils]: 9: Hoare triple {46#false} ~i~0 := 0;~j~0 := 0; {46#false} is VALID [2018-11-14 17:11:33,597 INFO L273 TraceCheckUtils]: 10: Hoare triple {46#false} assume !true; {46#false} is VALID [2018-11-14 17:11:33,598 INFO L273 TraceCheckUtils]: 11: Hoare triple {46#false} ~i~0 := 0;~j~0 := 0; {46#false} is VALID [2018-11-14 17:11:33,598 INFO L273 TraceCheckUtils]: 12: Hoare triple {46#false} assume true; {46#false} is VALID [2018-11-14 17:11:33,598 INFO L273 TraceCheckUtils]: 13: Hoare triple {46#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {46#false} is VALID [2018-11-14 17:11:33,599 INFO L273 TraceCheckUtils]: 14: Hoare triple {46#false} assume true; {46#false} is VALID [2018-11-14 17:11:33,599 INFO L273 TraceCheckUtils]: 15: Hoare triple {46#false} assume !!(~j~0 < ~n~0);call #t~mem8 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem6 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem7 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {46#false} is VALID [2018-11-14 17:11:33,600 INFO L256 TraceCheckUtils]: 16: Hoare triple {46#false} call __VERIFIER_assert((if #t~mem8 % 4294967296 == (#t~mem6 - #t~mem7) % 4294967296 then 1 else 0)); {46#false} is VALID [2018-11-14 17:11:33,600 INFO L273 TraceCheckUtils]: 17: Hoare triple {46#false} ~cond := #in~cond; {46#false} is VALID [2018-11-14 17:11:33,600 INFO L273 TraceCheckUtils]: 18: Hoare triple {46#false} assume ~cond == 0; {46#false} is VALID [2018-11-14 17:11:33,601 INFO L273 TraceCheckUtils]: 19: Hoare triple {46#false} assume !false; {46#false} is VALID [2018-11-14 17:11:33,605 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-14 17:11:33,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:11:33,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:11:33,641 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-14 17:11:33,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:11:33,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:11:33,740 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:11:33,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:11:33,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:11:33,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:11:33,752 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-14 17:11:33,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:33,985 INFO L93 Difference]: Finished difference Result 78 states and 111 transitions. [2018-11-14 17:11:33,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:11:33,986 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-14 17:11:33,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:11:33,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:11:34,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 111 transitions. [2018-11-14 17:11:34,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:11:34,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 111 transitions. [2018-11-14 17:11:34,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 111 transitions. [2018-11-14 17:11:34,745 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:11:34,759 INFO L225 Difference]: With dead ends: 78 [2018-11-14 17:11:34,759 INFO L226 Difference]: Without dead ends: 37 [2018-11-14 17:11:34,763 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:11:34,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-14 17:11:34,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-14 17:11:34,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:11:34,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-14 17:11:34,979 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-14 17:11:34,980 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-14 17:11:34,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:34,985 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2018-11-14 17:11:34,985 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-14 17:11:34,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:11:34,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:11:34,987 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-14 17:11:34,987 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-14 17:11:34,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:34,992 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2018-11-14 17:11:34,992 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-14 17:11:34,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:11:34,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:11:34,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:11:34,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:11:34,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 17:11:34,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2018-11-14 17:11:35,003 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 20 [2018-11-14 17:11:35,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:11:35,003 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-11-14 17:11:35,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:11:35,004 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-14 17:11:35,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 17:11:35,005 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:11:35,005 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:11:35,005 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:11:35,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:11:35,007 INFO L82 PathProgramCache]: Analyzing trace with hash -976004392, now seen corresponding path program 1 times [2018-11-14 17:11:35,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:11:35,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:11:35,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:35,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:11:35,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:35,023 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:11:35,023 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:11:35,023 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-14 17:11:35,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:11:35,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:11:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:11:35,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:11:35,303 INFO L256 TraceCheckUtils]: 0: Hoare triple {333#true} call ULTIMATE.init(); {333#true} is VALID [2018-11-14 17:11:35,304 INFO L273 TraceCheckUtils]: 1: Hoare triple {333#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {333#true} is VALID [2018-11-14 17:11:35,304 INFO L273 TraceCheckUtils]: 2: Hoare triple {333#true} assume true; {333#true} is VALID [2018-11-14 17:11:35,304 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {333#true} {333#true} #133#return; {333#true} is VALID [2018-11-14 17:11:35,305 INFO L256 TraceCheckUtils]: 4: Hoare triple {333#true} call #t~ret9 := main(); {333#true} is VALID [2018-11-14 17:11:35,321 INFO L273 TraceCheckUtils]: 5: Hoare triple {333#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);~i~0 := 0;~j~0 := 0; {353#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:35,335 INFO L273 TraceCheckUtils]: 6: Hoare triple {353#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {353#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:35,352 INFO L273 TraceCheckUtils]: 7: Hoare triple {353#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {334#false} is VALID [2018-11-14 17:11:35,352 INFO L273 TraceCheckUtils]: 8: Hoare triple {334#false} ~i~0 := 0;~j~0 := 0; {334#false} is VALID [2018-11-14 17:11:35,353 INFO L273 TraceCheckUtils]: 9: Hoare triple {334#false} assume true; {334#false} is VALID [2018-11-14 17:11:35,353 INFO L273 TraceCheckUtils]: 10: Hoare triple {334#false} assume !(~i~0 < ~m~0); {334#false} is VALID [2018-11-14 17:11:35,354 INFO L273 TraceCheckUtils]: 11: Hoare triple {334#false} ~i~0 := 0;~j~0 := 0; {334#false} is VALID [2018-11-14 17:11:35,354 INFO L273 TraceCheckUtils]: 12: Hoare triple {334#false} assume true; {334#false} is VALID [2018-11-14 17:11:35,354 INFO L273 TraceCheckUtils]: 13: Hoare triple {334#false} assume !(~i~0 < ~m~0); {334#false} is VALID [2018-11-14 17:11:35,355 INFO L273 TraceCheckUtils]: 14: Hoare triple {334#false} ~i~0 := 0;~j~0 := 0; {334#false} is VALID [2018-11-14 17:11:35,355 INFO L273 TraceCheckUtils]: 15: Hoare triple {334#false} assume true; {334#false} is VALID [2018-11-14 17:11:35,355 INFO L273 TraceCheckUtils]: 16: Hoare triple {334#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {334#false} is VALID [2018-11-14 17:11:35,356 INFO L273 TraceCheckUtils]: 17: Hoare triple {334#false} assume true; {334#false} is VALID [2018-11-14 17:11:35,356 INFO L273 TraceCheckUtils]: 18: Hoare triple {334#false} assume !!(~j~0 < ~n~0);call #t~mem8 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem6 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem7 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {334#false} is VALID [2018-11-14 17:11:35,356 INFO L256 TraceCheckUtils]: 19: Hoare triple {334#false} call __VERIFIER_assert((if #t~mem8 % 4294967296 == (#t~mem6 - #t~mem7) % 4294967296 then 1 else 0)); {334#false} is VALID [2018-11-14 17:11:35,357 INFO L273 TraceCheckUtils]: 20: Hoare triple {334#false} ~cond := #in~cond; {334#false} is VALID [2018-11-14 17:11:35,357 INFO L273 TraceCheckUtils]: 21: Hoare triple {334#false} assume ~cond == 0; {334#false} is VALID [2018-11-14 17:11:35,357 INFO L273 TraceCheckUtils]: 22: Hoare triple {334#false} assume !false; {334#false} is VALID [2018-11-14 17:11:35,362 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-14 17:11:35,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:11:35,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:11:35,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-14 17:11:35,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:11:35,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:11:35,550 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:11:35,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:11:35,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:11:35,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:11:35,551 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 3 states. [2018-11-14 17:11:35,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:35,833 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2018-11-14 17:11:35,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:11:35,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-14 17:11:35,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:11:35,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:11:35,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2018-11-14 17:11:35,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:11:35,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2018-11-14 17:11:35,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 82 transitions. [2018-11-14 17:11:36,057 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:11:36,059 INFO L225 Difference]: With dead ends: 68 [2018-11-14 17:11:36,060 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 17:11:36,061 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-14 17:11:36,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 17:11:36,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2018-11-14 17:11:36,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:11:36,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 39 states. [2018-11-14 17:11:36,078 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 39 states. [2018-11-14 17:11:36,078 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 39 states. [2018-11-14 17:11:36,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:36,083 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2018-11-14 17:11:36,083 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-11-14 17:11:36,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:11:36,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:11:36,084 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 42 states. [2018-11-14 17:11:36,085 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 42 states. [2018-11-14 17:11:36,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:36,088 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2018-11-14 17:11:36,089 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-11-14 17:11:36,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:11:36,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:11:36,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:11:36,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:11:36,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-14 17:11:36,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-11-14 17:11:36,093 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 23 [2018-11-14 17:11:36,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:11:36,093 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-14 17:11:36,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:11:36,094 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2018-11-14 17:11:36,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 17:11:36,095 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:11:36,095 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:11:36,095 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:11:36,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:11:36,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1843194405, now seen corresponding path program 1 times [2018-11-14 17:11:36,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:11:36,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:11:36,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:36,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:11:36,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:36,105 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:11:36,105 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:11:36,106 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-14 17:11:36,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:11:36,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:11:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:11:36,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:11:36,245 INFO L256 TraceCheckUtils]: 0: Hoare triple {634#true} call ULTIMATE.init(); {634#true} is VALID [2018-11-14 17:11:36,245 INFO L273 TraceCheckUtils]: 1: Hoare triple {634#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {634#true} is VALID [2018-11-14 17:11:36,246 INFO L273 TraceCheckUtils]: 2: Hoare triple {634#true} assume true; {634#true} is VALID [2018-11-14 17:11:36,246 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {634#true} {634#true} #133#return; {634#true} is VALID [2018-11-14 17:11:36,246 INFO L256 TraceCheckUtils]: 4: Hoare triple {634#true} call #t~ret9 := main(); {634#true} is VALID [2018-11-14 17:11:36,247 INFO L273 TraceCheckUtils]: 5: Hoare triple {634#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);~i~0 := 0;~j~0 := 0; {654#(<= 1500 main_~n~0)} is VALID [2018-11-14 17:11:36,248 INFO L273 TraceCheckUtils]: 6: Hoare triple {654#(<= 1500 main_~n~0)} assume true; {654#(<= 1500 main_~n~0)} is VALID [2018-11-14 17:11:36,248 INFO L273 TraceCheckUtils]: 7: Hoare triple {654#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {661#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:11:36,253 INFO L273 TraceCheckUtils]: 8: Hoare triple {661#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {661#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:11:36,254 INFO L273 TraceCheckUtils]: 9: Hoare triple {661#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !(~j~0 < ~n~0); {635#false} is VALID [2018-11-14 17:11:36,254 INFO L273 TraceCheckUtils]: 10: Hoare triple {635#false} ~i~0 := ~i~0 + 1; {635#false} is VALID [2018-11-14 17:11:36,254 INFO L273 TraceCheckUtils]: 11: Hoare triple {635#false} assume true; {635#false} is VALID [2018-11-14 17:11:36,254 INFO L273 TraceCheckUtils]: 12: Hoare triple {635#false} assume !(~i~0 < ~m~0); {635#false} is VALID [2018-11-14 17:11:36,255 INFO L273 TraceCheckUtils]: 13: Hoare triple {635#false} ~i~0 := 0;~j~0 := 0; {635#false} is VALID [2018-11-14 17:11:36,255 INFO L273 TraceCheckUtils]: 14: Hoare triple {635#false} assume true; {635#false} is VALID [2018-11-14 17:11:36,255 INFO L273 TraceCheckUtils]: 15: Hoare triple {635#false} assume !(~i~0 < ~m~0); {635#false} is VALID [2018-11-14 17:11:36,256 INFO L273 TraceCheckUtils]: 16: Hoare triple {635#false} ~i~0 := 0;~j~0 := 0; {635#false} is VALID [2018-11-14 17:11:36,256 INFO L273 TraceCheckUtils]: 17: Hoare triple {635#false} assume true; {635#false} is VALID [2018-11-14 17:11:36,256 INFO L273 TraceCheckUtils]: 18: Hoare triple {635#false} assume !(~i~0 < ~m~0); {635#false} is VALID [2018-11-14 17:11:36,256 INFO L273 TraceCheckUtils]: 19: Hoare triple {635#false} ~i~0 := 0;~j~0 := 0; {635#false} is VALID [2018-11-14 17:11:36,257 INFO L273 TraceCheckUtils]: 20: Hoare triple {635#false} assume true; {635#false} is VALID [2018-11-14 17:11:36,257 INFO L273 TraceCheckUtils]: 21: Hoare triple {635#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {635#false} is VALID [2018-11-14 17:11:36,257 INFO L273 TraceCheckUtils]: 22: Hoare triple {635#false} assume true; {635#false} is VALID [2018-11-14 17:11:36,258 INFO L273 TraceCheckUtils]: 23: Hoare triple {635#false} assume !!(~j~0 < ~n~0);call #t~mem8 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem6 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem7 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {635#false} is VALID [2018-11-14 17:11:36,258 INFO L256 TraceCheckUtils]: 24: Hoare triple {635#false} call __VERIFIER_assert((if #t~mem8 % 4294967296 == (#t~mem6 - #t~mem7) % 4294967296 then 1 else 0)); {635#false} is VALID [2018-11-14 17:11:36,258 INFO L273 TraceCheckUtils]: 25: Hoare triple {635#false} ~cond := #in~cond; {635#false} is VALID [2018-11-14 17:11:36,259 INFO L273 TraceCheckUtils]: 26: Hoare triple {635#false} assume ~cond == 0; {635#false} is VALID [2018-11-14 17:11:36,259 INFO L273 TraceCheckUtils]: 27: Hoare triple {635#false} assume !false; {635#false} is VALID [2018-11-14 17:11:36,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:11:36,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:11:36,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:11:36,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-14 17:11:36,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:11:36,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:11:36,333 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-14 17:11:36,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:11:36,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:11:36,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:11:36,335 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand 4 states. [2018-11-14 17:11:36,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:36,652 INFO L93 Difference]: Finished difference Result 88 states and 109 transitions. [2018-11-14 17:11:36,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:11:36,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-14 17:11:36,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:11:36,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:11:36,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2018-11-14 17:11:36,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:11:36,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2018-11-14 17:11:36,662 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 109 transitions. [2018-11-14 17:11:36,871 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:11:36,875 INFO L225 Difference]: With dead ends: 88 [2018-11-14 17:11:36,875 INFO L226 Difference]: Without dead ends: 57 [2018-11-14 17:11:36,876 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 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-14 17:11:36,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-14 17:11:36,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 47. [2018-11-14 17:11:36,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:11:36,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 47 states. [2018-11-14 17:11:36,937 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 47 states. [2018-11-14 17:11:36,937 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 47 states. [2018-11-14 17:11:36,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:36,942 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2018-11-14 17:11:36,942 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2018-11-14 17:11:36,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:11:36,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:11:36,944 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 57 states. [2018-11-14 17:11:36,944 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 57 states. [2018-11-14 17:11:36,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:36,949 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2018-11-14 17:11:36,949 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2018-11-14 17:11:36,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:11:36,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:11:36,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:11:36,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:11:36,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 17:11:36,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2018-11-14 17:11:36,954 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 28 [2018-11-14 17:11:36,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:11:36,954 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-11-14 17:11:36,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:11:36,954 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-11-14 17:11:36,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 17:11:36,955 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:11:36,956 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:11:36,956 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:11:36,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:11:36,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1262025717, now seen corresponding path program 1 times [2018-11-14 17:11:36,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:11:36,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:11:36,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:36,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:11:36,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:36,965 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:11:36,965 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:11:36,965 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-14 17:11:36,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:11:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:11:37,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:11:37,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:11:37,199 INFO L256 TraceCheckUtils]: 0: Hoare triple {1022#true} call ULTIMATE.init(); {1022#true} is VALID [2018-11-14 17:11:37,199 INFO L273 TraceCheckUtils]: 1: Hoare triple {1022#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1022#true} is VALID [2018-11-14 17:11:37,200 INFO L273 TraceCheckUtils]: 2: Hoare triple {1022#true} assume true; {1022#true} is VALID [2018-11-14 17:11:37,201 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1022#true} {1022#true} #133#return; {1022#true} is VALID [2018-11-14 17:11:37,201 INFO L256 TraceCheckUtils]: 4: Hoare triple {1022#true} call #t~ret9 := main(); {1022#true} is VALID [2018-11-14 17:11:37,203 INFO L273 TraceCheckUtils]: 5: Hoare triple {1022#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);~i~0 := 0;~j~0 := 0; {1042#(<= 1500 main_~n~0)} is VALID [2018-11-14 17:11:37,203 INFO L273 TraceCheckUtils]: 6: Hoare triple {1042#(<= 1500 main_~n~0)} assume true; {1042#(<= 1500 main_~n~0)} is VALID [2018-11-14 17:11:37,204 INFO L273 TraceCheckUtils]: 7: Hoare triple {1042#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {1049#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:11:37,204 INFO L273 TraceCheckUtils]: 8: Hoare triple {1049#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {1049#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:11:37,205 INFO L273 TraceCheckUtils]: 9: Hoare triple {1049#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet1;~j~0 := ~j~0 + 1; {1056#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 17:11:37,206 INFO L273 TraceCheckUtils]: 10: Hoare triple {1056#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume true; {1056#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 17:11:37,207 INFO L273 TraceCheckUtils]: 11: Hoare triple {1056#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !(~j~0 < ~n~0); {1023#false} is VALID [2018-11-14 17:11:37,207 INFO L273 TraceCheckUtils]: 12: Hoare triple {1023#false} ~i~0 := ~i~0 + 1; {1023#false} is VALID [2018-11-14 17:11:37,207 INFO L273 TraceCheckUtils]: 13: Hoare triple {1023#false} assume true; {1023#false} is VALID [2018-11-14 17:11:37,208 INFO L273 TraceCheckUtils]: 14: Hoare triple {1023#false} assume !(~i~0 < ~m~0); {1023#false} is VALID [2018-11-14 17:11:37,208 INFO L273 TraceCheckUtils]: 15: Hoare triple {1023#false} ~i~0 := 0;~j~0 := 0; {1023#false} is VALID [2018-11-14 17:11:37,209 INFO L273 TraceCheckUtils]: 16: Hoare triple {1023#false} assume true; {1023#false} is VALID [2018-11-14 17:11:37,209 INFO L273 TraceCheckUtils]: 17: Hoare triple {1023#false} assume !(~i~0 < ~m~0); {1023#false} is VALID [2018-11-14 17:11:37,209 INFO L273 TraceCheckUtils]: 18: Hoare triple {1023#false} ~i~0 := 0;~j~0 := 0; {1023#false} is VALID [2018-11-14 17:11:37,210 INFO L273 TraceCheckUtils]: 19: Hoare triple {1023#false} assume true; {1023#false} is VALID [2018-11-14 17:11:37,210 INFO L273 TraceCheckUtils]: 20: Hoare triple {1023#false} assume !(~i~0 < ~m~0); {1023#false} is VALID [2018-11-14 17:11:37,211 INFO L273 TraceCheckUtils]: 21: Hoare triple {1023#false} ~i~0 := 0;~j~0 := 0; {1023#false} is VALID [2018-11-14 17:11:37,211 INFO L273 TraceCheckUtils]: 22: Hoare triple {1023#false} assume true; {1023#false} is VALID [2018-11-14 17:11:37,211 INFO L273 TraceCheckUtils]: 23: Hoare triple {1023#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {1023#false} is VALID [2018-11-14 17:11:37,212 INFO L273 TraceCheckUtils]: 24: Hoare triple {1023#false} assume true; {1023#false} is VALID [2018-11-14 17:11:37,212 INFO L273 TraceCheckUtils]: 25: Hoare triple {1023#false} assume !!(~j~0 < ~n~0);call #t~mem8 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem6 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem7 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {1023#false} is VALID [2018-11-14 17:11:37,212 INFO L256 TraceCheckUtils]: 26: Hoare triple {1023#false} call __VERIFIER_assert((if #t~mem8 % 4294967296 == (#t~mem6 - #t~mem7) % 4294967296 then 1 else 0)); {1023#false} is VALID [2018-11-14 17:11:37,213 INFO L273 TraceCheckUtils]: 27: Hoare triple {1023#false} ~cond := #in~cond; {1023#false} is VALID [2018-11-14 17:11:37,213 INFO L273 TraceCheckUtils]: 28: Hoare triple {1023#false} assume ~cond == 0; {1023#false} is VALID [2018-11-14 17:11:37,213 INFO L273 TraceCheckUtils]: 29: Hoare triple {1023#false} assume !false; {1023#false} is VALID [2018-11-14 17:11:37,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:11:37,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:11:37,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-14 17:11:37,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-14 17:11:37,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:11:37,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:11:37,357 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:11:37,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:11:37,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:11:37,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:11:37,359 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 5 states. [2018-11-14 17:11:37,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:37,703 INFO L93 Difference]: Finished difference Result 106 states and 128 transitions. [2018-11-14 17:11:37,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:11:37,703 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-14 17:11:37,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:11:37,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:11:37,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2018-11-14 17:11:37,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:11:37,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2018-11-14 17:11:37,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 120 transitions. [2018-11-14 17:11:37,896 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:11:37,899 INFO L225 Difference]: With dead ends: 106 [2018-11-14 17:11:37,900 INFO L226 Difference]: Without dead ends: 67 [2018-11-14 17:11:37,900 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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-14 17:11:37,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-14 17:11:37,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 57. [2018-11-14 17:11:37,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:11:37,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 57 states. [2018-11-14 17:11:37,949 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 57 states. [2018-11-14 17:11:37,950 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 57 states. [2018-11-14 17:11:37,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:37,954 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2018-11-14 17:11:37,954 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2018-11-14 17:11:37,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:11:37,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:11:37,955 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 67 states. [2018-11-14 17:11:37,956 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 67 states. [2018-11-14 17:11:37,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:37,960 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2018-11-14 17:11:37,960 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2018-11-14 17:11:37,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:11:37,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:11:37,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:11:37,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:11:37,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-14 17:11:37,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2018-11-14 17:11:37,965 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 30 [2018-11-14 17:11:37,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:11:37,965 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2018-11-14 17:11:37,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:11:37,966 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2018-11-14 17:11:37,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 17:11:37,966 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:11:37,967 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:11:37,967 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:11:37,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:11:37,967 INFO L82 PathProgramCache]: Analyzing trace with hash -376292239, now seen corresponding path program 2 times [2018-11-14 17:11:37,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:11:37,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:11:37,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:37,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:11:37,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:37,977 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:11:37,979 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:11:37,979 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-14 17:11:37,997 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:11:38,020 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 17:11:38,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:11:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:11:38,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:11:38,143 INFO L256 TraceCheckUtils]: 0: Hoare triple {1479#true} call ULTIMATE.init(); {1479#true} is VALID [2018-11-14 17:11:38,143 INFO L273 TraceCheckUtils]: 1: Hoare triple {1479#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1479#true} is VALID [2018-11-14 17:11:38,144 INFO L273 TraceCheckUtils]: 2: Hoare triple {1479#true} assume true; {1479#true} is VALID [2018-11-14 17:11:38,144 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1479#true} {1479#true} #133#return; {1479#true} is VALID [2018-11-14 17:11:38,144 INFO L256 TraceCheckUtils]: 4: Hoare triple {1479#true} call #t~ret9 := main(); {1479#true} is VALID [2018-11-14 17:11:38,150 INFO L273 TraceCheckUtils]: 5: Hoare triple {1479#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);~i~0 := 0;~j~0 := 0; {1499#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:38,151 INFO L273 TraceCheckUtils]: 6: Hoare triple {1499#(<= 1000 main_~m~0)} assume true; {1499#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:38,151 INFO L273 TraceCheckUtils]: 7: Hoare triple {1499#(<= 1000 main_~m~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {1499#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:38,152 INFO L273 TraceCheckUtils]: 8: Hoare triple {1499#(<= 1000 main_~m~0)} assume true; {1499#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:38,153 INFO L273 TraceCheckUtils]: 9: Hoare triple {1499#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet1;~j~0 := ~j~0 + 1; {1499#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:38,153 INFO L273 TraceCheckUtils]: 10: Hoare triple {1499#(<= 1000 main_~m~0)} assume true; {1499#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:38,154 INFO L273 TraceCheckUtils]: 11: Hoare triple {1499#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet1;~j~0 := ~j~0 + 1; {1499#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:38,154 INFO L273 TraceCheckUtils]: 12: Hoare triple {1499#(<= 1000 main_~m~0)} assume true; {1499#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:38,155 INFO L273 TraceCheckUtils]: 13: Hoare triple {1499#(<= 1000 main_~m~0)} assume !(~j~0 < ~n~0); {1499#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:38,156 INFO L273 TraceCheckUtils]: 14: Hoare triple {1499#(<= 1000 main_~m~0)} ~i~0 := ~i~0 + 1; {1499#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:38,157 INFO L273 TraceCheckUtils]: 15: Hoare triple {1499#(<= 1000 main_~m~0)} assume true; {1499#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:38,158 INFO L273 TraceCheckUtils]: 16: Hoare triple {1499#(<= 1000 main_~m~0)} assume !(~i~0 < ~m~0); {1499#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:38,159 INFO L273 TraceCheckUtils]: 17: Hoare triple {1499#(<= 1000 main_~m~0)} ~i~0 := 0;~j~0 := 0; {1536#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:38,160 INFO L273 TraceCheckUtils]: 18: Hoare triple {1536#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {1536#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:38,161 INFO L273 TraceCheckUtils]: 19: Hoare triple {1536#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {1480#false} is VALID [2018-11-14 17:11:38,161 INFO L273 TraceCheckUtils]: 20: Hoare triple {1480#false} ~i~0 := 0;~j~0 := 0; {1480#false} is VALID [2018-11-14 17:11:38,161 INFO L273 TraceCheckUtils]: 21: Hoare triple {1480#false} assume true; {1480#false} is VALID [2018-11-14 17:11:38,162 INFO L273 TraceCheckUtils]: 22: Hoare triple {1480#false} assume !(~i~0 < ~m~0); {1480#false} is VALID [2018-11-14 17:11:38,162 INFO L273 TraceCheckUtils]: 23: Hoare triple {1480#false} ~i~0 := 0;~j~0 := 0; {1480#false} is VALID [2018-11-14 17:11:38,163 INFO L273 TraceCheckUtils]: 24: Hoare triple {1480#false} assume true; {1480#false} is VALID [2018-11-14 17:11:38,164 INFO L273 TraceCheckUtils]: 25: Hoare triple {1480#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {1480#false} is VALID [2018-11-14 17:11:38,164 INFO L273 TraceCheckUtils]: 26: Hoare triple {1480#false} assume true; {1480#false} is VALID [2018-11-14 17:11:38,164 INFO L273 TraceCheckUtils]: 27: Hoare triple {1480#false} assume !!(~j~0 < ~n~0);call #t~mem8 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem6 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem7 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {1480#false} is VALID [2018-11-14 17:11:38,165 INFO L256 TraceCheckUtils]: 28: Hoare triple {1480#false} call __VERIFIER_assert((if #t~mem8 % 4294967296 == (#t~mem6 - #t~mem7) % 4294967296 then 1 else 0)); {1480#false} is VALID [2018-11-14 17:11:38,165 INFO L273 TraceCheckUtils]: 29: Hoare triple {1480#false} ~cond := #in~cond; {1480#false} is VALID [2018-11-14 17:11:38,165 INFO L273 TraceCheckUtils]: 30: Hoare triple {1480#false} assume ~cond == 0; {1480#false} is VALID [2018-11-14 17:11:38,166 INFO L273 TraceCheckUtils]: 31: Hoare triple {1480#false} assume !false; {1480#false} is VALID [2018-11-14 17:11:38,168 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-14 17:11:38,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:11:38,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:11:38,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-11-14 17:11:38,198 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:11:38,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:11:38,233 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-14 17:11:38,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:11:38,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:11:38,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:11:38,234 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand 4 states. [2018-11-14 17:11:38,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:38,592 INFO L93 Difference]: Finished difference Result 125 states and 145 transitions. [2018-11-14 17:11:38,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:11:38,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-11-14 17:11:38,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:11:38,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:11:38,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2018-11-14 17:11:38,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:11:38,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2018-11-14 17:11:38,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 96 transitions. [2018-11-14 17:11:38,849 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:11:38,852 INFO L225 Difference]: With dead ends: 125 [2018-11-14 17:11:38,852 INFO L226 Difference]: Without dead ends: 95 [2018-11-14 17:11:38,853 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 29 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-14 17:11:38,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-14 17:11:38,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 61. [2018-11-14 17:11:38,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:11:38,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 61 states. [2018-11-14 17:11:38,977 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 61 states. [2018-11-14 17:11:38,977 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 61 states. [2018-11-14 17:11:38,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:38,982 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2018-11-14 17:11:38,982 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2018-11-14 17:11:38,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:11:38,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:11:38,982 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 95 states. [2018-11-14 17:11:38,983 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 95 states. [2018-11-14 17:11:38,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:38,987 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2018-11-14 17:11:38,987 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2018-11-14 17:11:38,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:11:38,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:11:38,988 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:11:38,988 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:11:38,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-14 17:11:38,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2018-11-14 17:11:38,991 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 32 [2018-11-14 17:11:38,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:11:38,991 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2018-11-14 17:11:38,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:11:38,991 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2018-11-14 17:11:38,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-14 17:11:38,992 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:11:38,993 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:11:38,993 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:11:38,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:11:38,993 INFO L82 PathProgramCache]: Analyzing trace with hash -397927391, now seen corresponding path program 1 times [2018-11-14 17:11:38,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:11:38,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:11:38,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:38,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:11:38,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:39,002 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:11:39,003 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:11:39,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 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-14 17:11:39,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:11:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:11:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:11:39,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:11:39,272 INFO L256 TraceCheckUtils]: 0: Hoare triple {2032#true} call ULTIMATE.init(); {2032#true} is VALID [2018-11-14 17:11:39,273 INFO L273 TraceCheckUtils]: 1: Hoare triple {2032#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2032#true} is VALID [2018-11-14 17:11:39,273 INFO L273 TraceCheckUtils]: 2: Hoare triple {2032#true} assume true; {2032#true} is VALID [2018-11-14 17:11:39,273 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2032#true} {2032#true} #133#return; {2032#true} is VALID [2018-11-14 17:11:39,274 INFO L256 TraceCheckUtils]: 4: Hoare triple {2032#true} call #t~ret9 := main(); {2032#true} is VALID [2018-11-14 17:11:39,275 INFO L273 TraceCheckUtils]: 5: Hoare triple {2032#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);~i~0 := 0;~j~0 := 0; {2052#(<= 1500 main_~n~0)} is VALID [2018-11-14 17:11:39,275 INFO L273 TraceCheckUtils]: 6: Hoare triple {2052#(<= 1500 main_~n~0)} assume true; {2052#(<= 1500 main_~n~0)} is VALID [2018-11-14 17:11:39,276 INFO L273 TraceCheckUtils]: 7: Hoare triple {2052#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {2059#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:11:39,276 INFO L273 TraceCheckUtils]: 8: Hoare triple {2059#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {2059#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:11:39,277 INFO L273 TraceCheckUtils]: 9: Hoare triple {2059#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet1;~j~0 := ~j~0 + 1; {2066#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 17:11:39,278 INFO L273 TraceCheckUtils]: 10: Hoare triple {2066#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume true; {2066#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 17:11:39,279 INFO L273 TraceCheckUtils]: 11: Hoare triple {2066#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet1;~j~0 := ~j~0 + 1; {2073#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-14 17:11:39,280 INFO L273 TraceCheckUtils]: 12: Hoare triple {2073#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume true; {2073#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-14 17:11:39,281 INFO L273 TraceCheckUtils]: 13: Hoare triple {2073#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !(~j~0 < ~n~0); {2033#false} is VALID [2018-11-14 17:11:39,281 INFO L273 TraceCheckUtils]: 14: Hoare triple {2033#false} ~i~0 := ~i~0 + 1; {2033#false} is VALID [2018-11-14 17:11:39,282 INFO L273 TraceCheckUtils]: 15: Hoare triple {2033#false} assume true; {2033#false} is VALID [2018-11-14 17:11:39,282 INFO L273 TraceCheckUtils]: 16: Hoare triple {2033#false} assume !(~i~0 < ~m~0); {2033#false} is VALID [2018-11-14 17:11:39,282 INFO L273 TraceCheckUtils]: 17: Hoare triple {2033#false} ~i~0 := 0;~j~0 := 0; {2033#false} is VALID [2018-11-14 17:11:39,283 INFO L273 TraceCheckUtils]: 18: Hoare triple {2033#false} assume true; {2033#false} is VALID [2018-11-14 17:11:39,283 INFO L273 TraceCheckUtils]: 19: Hoare triple {2033#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {2033#false} is VALID [2018-11-14 17:11:39,283 INFO L273 TraceCheckUtils]: 20: Hoare triple {2033#false} assume true; {2033#false} is VALID [2018-11-14 17:11:39,284 INFO L273 TraceCheckUtils]: 21: Hoare triple {2033#false} assume !!(~j~0 < ~n~0);call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet2;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet3;~j~0 := ~j~0 + 1; {2033#false} is VALID [2018-11-14 17:11:39,284 INFO L273 TraceCheckUtils]: 22: Hoare triple {2033#false} assume true; {2033#false} is VALID [2018-11-14 17:11:39,285 INFO L273 TraceCheckUtils]: 23: Hoare triple {2033#false} assume !!(~j~0 < ~n~0);call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet2;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet3;~j~0 := ~j~0 + 1; {2033#false} is VALID [2018-11-14 17:11:39,285 INFO L273 TraceCheckUtils]: 24: Hoare triple {2033#false} assume true; {2033#false} is VALID [2018-11-14 17:11:39,285 INFO L273 TraceCheckUtils]: 25: Hoare triple {2033#false} assume !(~j~0 < ~n~0); {2033#false} is VALID [2018-11-14 17:11:39,286 INFO L273 TraceCheckUtils]: 26: Hoare triple {2033#false} ~i~0 := ~i~0 + 1; {2033#false} is VALID [2018-11-14 17:11:39,286 INFO L273 TraceCheckUtils]: 27: Hoare triple {2033#false} assume true; {2033#false} is VALID [2018-11-14 17:11:39,286 INFO L273 TraceCheckUtils]: 28: Hoare triple {2033#false} assume !(~i~0 < ~m~0); {2033#false} is VALID [2018-11-14 17:11:39,286 INFO L273 TraceCheckUtils]: 29: Hoare triple {2033#false} ~i~0 := 0;~j~0 := 0; {2033#false} is VALID [2018-11-14 17:11:39,287 INFO L273 TraceCheckUtils]: 30: Hoare triple {2033#false} assume true; {2033#false} is VALID [2018-11-14 17:11:39,287 INFO L273 TraceCheckUtils]: 31: Hoare triple {2033#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {2033#false} is VALID [2018-11-14 17:11:39,287 INFO L273 TraceCheckUtils]: 32: Hoare triple {2033#false} assume true; {2033#false} is VALID [2018-11-14 17:11:39,287 INFO L273 TraceCheckUtils]: 33: Hoare triple {2033#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call write~int(#t~mem4 - #t~mem5, ~#C~0.base, ~#C~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~mem4;havoc #t~mem5;~j~0 := ~j~0 + 1; {2033#false} is VALID [2018-11-14 17:11:39,288 INFO L273 TraceCheckUtils]: 34: Hoare triple {2033#false} assume true; {2033#false} is VALID [2018-11-14 17:11:39,288 INFO L273 TraceCheckUtils]: 35: Hoare triple {2033#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call write~int(#t~mem4 - #t~mem5, ~#C~0.base, ~#C~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~mem4;havoc #t~mem5;~j~0 := ~j~0 + 1; {2033#false} is VALID [2018-11-14 17:11:39,288 INFO L273 TraceCheckUtils]: 36: Hoare triple {2033#false} assume true; {2033#false} is VALID [2018-11-14 17:11:39,288 INFO L273 TraceCheckUtils]: 37: Hoare triple {2033#false} assume !(~j~0 < ~n~0); {2033#false} is VALID [2018-11-14 17:11:39,289 INFO L273 TraceCheckUtils]: 38: Hoare triple {2033#false} ~i~0 := ~i~0 + 1; {2033#false} is VALID [2018-11-14 17:11:39,289 INFO L273 TraceCheckUtils]: 39: Hoare triple {2033#false} assume true; {2033#false} is VALID [2018-11-14 17:11:39,289 INFO L273 TraceCheckUtils]: 40: Hoare triple {2033#false} assume !(~i~0 < ~m~0); {2033#false} is VALID [2018-11-14 17:11:39,290 INFO L273 TraceCheckUtils]: 41: Hoare triple {2033#false} ~i~0 := 0;~j~0 := 0; {2033#false} is VALID [2018-11-14 17:11:39,290 INFO L273 TraceCheckUtils]: 42: Hoare triple {2033#false} assume true; {2033#false} is VALID [2018-11-14 17:11:39,290 INFO L273 TraceCheckUtils]: 43: Hoare triple {2033#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {2033#false} is VALID [2018-11-14 17:11:39,290 INFO L273 TraceCheckUtils]: 44: Hoare triple {2033#false} assume true; {2033#false} is VALID [2018-11-14 17:11:39,291 INFO L273 TraceCheckUtils]: 45: Hoare triple {2033#false} assume !!(~j~0 < ~n~0);call #t~mem8 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem6 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem7 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {2033#false} is VALID [2018-11-14 17:11:39,291 INFO L256 TraceCheckUtils]: 46: Hoare triple {2033#false} call __VERIFIER_assert((if #t~mem8 % 4294967296 == (#t~mem6 - #t~mem7) % 4294967296 then 1 else 0)); {2033#false} is VALID [2018-11-14 17:11:39,291 INFO L273 TraceCheckUtils]: 47: Hoare triple {2033#false} ~cond := #in~cond; {2033#false} is VALID [2018-11-14 17:11:39,291 INFO L273 TraceCheckUtils]: 48: Hoare triple {2033#false} assume ~cond == 0; {2033#false} is VALID [2018-11-14 17:11:39,292 INFO L273 TraceCheckUtils]: 49: Hoare triple {2033#false} assume !false; {2033#false} is VALID [2018-11-14 17:11:39,296 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-14 17:11:39,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:11:39,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-14 17:11:39,318 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-11-14 17:11:39,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:11:39,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:11:39,367 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:11:39,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:11:39,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:11:39,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:11:39,368 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand 6 states. [2018-11-14 17:11:39,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:39,921 INFO L93 Difference]: Finished difference Result 128 states and 150 transitions. [2018-11-14 17:11:39,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:11:39,921 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-11-14 17:11:39,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:11:39,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:11:39,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2018-11-14 17:11:39,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:11:39,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2018-11-14 17:11:39,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 127 transitions. [2018-11-14 17:11:40,142 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:11:40,144 INFO L225 Difference]: With dead ends: 128 [2018-11-14 17:11:40,145 INFO L226 Difference]: Without dead ends: 75 [2018-11-14 17:11:40,146 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 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-14 17:11:40,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-14 17:11:40,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2018-11-14 17:11:40,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:11:40,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 71 states. [2018-11-14 17:11:40,294 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 71 states. [2018-11-14 17:11:40,295 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 71 states. [2018-11-14 17:11:40,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:40,298 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2018-11-14 17:11:40,299 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2018-11-14 17:11:40,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:11:40,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:11:40,299 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 75 states. [2018-11-14 17:11:40,299 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 75 states. [2018-11-14 17:11:40,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:40,302 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2018-11-14 17:11:40,302 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2018-11-14 17:11:40,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:11:40,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:11:40,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:11:40,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:11:40,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-14 17:11:40,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2018-11-14 17:11:40,306 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 50 [2018-11-14 17:11:40,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:11:40,307 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2018-11-14 17:11:40,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:11:40,307 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2018-11-14 17:11:40,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-14 17:11:40,308 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:11:40,308 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:11:40,309 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:11:40,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:11:40,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1283158227, now seen corresponding path program 2 times [2018-11-14 17:11:40,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:11:40,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:11:40,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:40,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:11:40,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:40,318 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:11:40,318 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:11:40,318 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-14 17:11:40,337 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:11:40,377 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:11:40,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:11:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:11:40,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:11:40,885 INFO L256 TraceCheckUtils]: 0: Hoare triple {2621#true} call ULTIMATE.init(); {2621#true} is VALID [2018-11-14 17:11:40,885 INFO L273 TraceCheckUtils]: 1: Hoare triple {2621#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2621#true} is VALID [2018-11-14 17:11:40,886 INFO L273 TraceCheckUtils]: 2: Hoare triple {2621#true} assume true; {2621#true} is VALID [2018-11-14 17:11:40,886 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2621#true} {2621#true} #133#return; {2621#true} is VALID [2018-11-14 17:11:40,886 INFO L256 TraceCheckUtils]: 4: Hoare triple {2621#true} call #t~ret9 := main(); {2621#true} is VALID [2018-11-14 17:11:40,888 INFO L273 TraceCheckUtils]: 5: Hoare triple {2621#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);~i~0 := 0;~j~0 := 0; {2641#(<= 1500 main_~n~0)} is VALID [2018-11-14 17:11:40,889 INFO L273 TraceCheckUtils]: 6: Hoare triple {2641#(<= 1500 main_~n~0)} assume true; {2641#(<= 1500 main_~n~0)} is VALID [2018-11-14 17:11:40,890 INFO L273 TraceCheckUtils]: 7: Hoare triple {2641#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {2648#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:11:40,890 INFO L273 TraceCheckUtils]: 8: Hoare triple {2648#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {2648#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:11:40,896 INFO L273 TraceCheckUtils]: 9: Hoare triple {2648#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet1;~j~0 := ~j~0 + 1; {2655#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 17:11:40,897 INFO L273 TraceCheckUtils]: 10: Hoare triple {2655#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume true; {2655#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 17:11:40,899 INFO L273 TraceCheckUtils]: 11: Hoare triple {2655#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet1;~j~0 := ~j~0 + 1; {2662#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-14 17:11:40,899 INFO L273 TraceCheckUtils]: 12: Hoare triple {2662#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume true; {2662#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-14 17:11:40,901 INFO L273 TraceCheckUtils]: 13: Hoare triple {2662#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet1;~j~0 := ~j~0 + 1; {2669#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-14 17:11:40,901 INFO L273 TraceCheckUtils]: 14: Hoare triple {2669#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume true; {2669#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-14 17:11:40,902 INFO L273 TraceCheckUtils]: 15: Hoare triple {2669#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !(~j~0 < ~n~0); {2622#false} is VALID [2018-11-14 17:11:40,903 INFO L273 TraceCheckUtils]: 16: Hoare triple {2622#false} ~i~0 := ~i~0 + 1; {2622#false} is VALID [2018-11-14 17:11:40,903 INFO L273 TraceCheckUtils]: 17: Hoare triple {2622#false} assume true; {2622#false} is VALID [2018-11-14 17:11:40,903 INFO L273 TraceCheckUtils]: 18: Hoare triple {2622#false} assume !(~i~0 < ~m~0); {2622#false} is VALID [2018-11-14 17:11:40,903 INFO L273 TraceCheckUtils]: 19: Hoare triple {2622#false} ~i~0 := 0;~j~0 := 0; {2622#false} is VALID [2018-11-14 17:11:40,904 INFO L273 TraceCheckUtils]: 20: Hoare triple {2622#false} assume true; {2622#false} is VALID [2018-11-14 17:11:40,904 INFO L273 TraceCheckUtils]: 21: Hoare triple {2622#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {2622#false} is VALID [2018-11-14 17:11:40,904 INFO L273 TraceCheckUtils]: 22: Hoare triple {2622#false} assume true; {2622#false} is VALID [2018-11-14 17:11:40,905 INFO L273 TraceCheckUtils]: 23: Hoare triple {2622#false} assume !!(~j~0 < ~n~0);call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet2;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet3;~j~0 := ~j~0 + 1; {2622#false} is VALID [2018-11-14 17:11:40,905 INFO L273 TraceCheckUtils]: 24: Hoare triple {2622#false} assume true; {2622#false} is VALID [2018-11-14 17:11:40,905 INFO L273 TraceCheckUtils]: 25: Hoare triple {2622#false} assume !!(~j~0 < ~n~0);call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet2;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet3;~j~0 := ~j~0 + 1; {2622#false} is VALID [2018-11-14 17:11:40,906 INFO L273 TraceCheckUtils]: 26: Hoare triple {2622#false} assume true; {2622#false} is VALID [2018-11-14 17:11:40,906 INFO L273 TraceCheckUtils]: 27: Hoare triple {2622#false} assume !!(~j~0 < ~n~0);call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet2;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet3;~j~0 := ~j~0 + 1; {2622#false} is VALID [2018-11-14 17:11:40,906 INFO L273 TraceCheckUtils]: 28: Hoare triple {2622#false} assume true; {2622#false} is VALID [2018-11-14 17:11:40,906 INFO L273 TraceCheckUtils]: 29: Hoare triple {2622#false} assume !(~j~0 < ~n~0); {2622#false} is VALID [2018-11-14 17:11:40,907 INFO L273 TraceCheckUtils]: 30: Hoare triple {2622#false} ~i~0 := ~i~0 + 1; {2622#false} is VALID [2018-11-14 17:11:40,907 INFO L273 TraceCheckUtils]: 31: Hoare triple {2622#false} assume true; {2622#false} is VALID [2018-11-14 17:11:40,907 INFO L273 TraceCheckUtils]: 32: Hoare triple {2622#false} assume !(~i~0 < ~m~0); {2622#false} is VALID [2018-11-14 17:11:40,907 INFO L273 TraceCheckUtils]: 33: Hoare triple {2622#false} ~i~0 := 0;~j~0 := 0; {2622#false} is VALID [2018-11-14 17:11:40,907 INFO L273 TraceCheckUtils]: 34: Hoare triple {2622#false} assume true; {2622#false} is VALID [2018-11-14 17:11:40,908 INFO L273 TraceCheckUtils]: 35: Hoare triple {2622#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {2622#false} is VALID [2018-11-14 17:11:40,908 INFO L273 TraceCheckUtils]: 36: Hoare triple {2622#false} assume true; {2622#false} is VALID [2018-11-14 17:11:40,908 INFO L273 TraceCheckUtils]: 37: Hoare triple {2622#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call write~int(#t~mem4 - #t~mem5, ~#C~0.base, ~#C~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~mem4;havoc #t~mem5;~j~0 := ~j~0 + 1; {2622#false} is VALID [2018-11-14 17:11:40,908 INFO L273 TraceCheckUtils]: 38: Hoare triple {2622#false} assume true; {2622#false} is VALID [2018-11-14 17:11:40,909 INFO L273 TraceCheckUtils]: 39: Hoare triple {2622#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call write~int(#t~mem4 - #t~mem5, ~#C~0.base, ~#C~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~mem4;havoc #t~mem5;~j~0 := ~j~0 + 1; {2622#false} is VALID [2018-11-14 17:11:40,909 INFO L273 TraceCheckUtils]: 40: Hoare triple {2622#false} assume true; {2622#false} is VALID [2018-11-14 17:11:40,909 INFO L273 TraceCheckUtils]: 41: Hoare triple {2622#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call write~int(#t~mem4 - #t~mem5, ~#C~0.base, ~#C~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~mem4;havoc #t~mem5;~j~0 := ~j~0 + 1; {2622#false} is VALID [2018-11-14 17:11:40,909 INFO L273 TraceCheckUtils]: 42: Hoare triple {2622#false} assume true; {2622#false} is VALID [2018-11-14 17:11:40,909 INFO L273 TraceCheckUtils]: 43: Hoare triple {2622#false} assume !(~j~0 < ~n~0); {2622#false} is VALID [2018-11-14 17:11:40,910 INFO L273 TraceCheckUtils]: 44: Hoare triple {2622#false} ~i~0 := ~i~0 + 1; {2622#false} is VALID [2018-11-14 17:11:40,910 INFO L273 TraceCheckUtils]: 45: Hoare triple {2622#false} assume true; {2622#false} is VALID [2018-11-14 17:11:40,910 INFO L273 TraceCheckUtils]: 46: Hoare triple {2622#false} assume !(~i~0 < ~m~0); {2622#false} is VALID [2018-11-14 17:11:40,910 INFO L273 TraceCheckUtils]: 47: Hoare triple {2622#false} ~i~0 := 0;~j~0 := 0; {2622#false} is VALID [2018-11-14 17:11:40,910 INFO L273 TraceCheckUtils]: 48: Hoare triple {2622#false} assume true; {2622#false} is VALID [2018-11-14 17:11:40,911 INFO L273 TraceCheckUtils]: 49: Hoare triple {2622#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {2622#false} is VALID [2018-11-14 17:11:40,911 INFO L273 TraceCheckUtils]: 50: Hoare triple {2622#false} assume true; {2622#false} is VALID [2018-11-14 17:11:40,911 INFO L273 TraceCheckUtils]: 51: Hoare triple {2622#false} assume !!(~j~0 < ~n~0);call #t~mem8 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem6 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem7 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {2622#false} is VALID [2018-11-14 17:11:40,911 INFO L256 TraceCheckUtils]: 52: Hoare triple {2622#false} call __VERIFIER_assert((if #t~mem8 % 4294967296 == (#t~mem6 - #t~mem7) % 4294967296 then 1 else 0)); {2622#false} is VALID [2018-11-14 17:11:40,912 INFO L273 TraceCheckUtils]: 53: Hoare triple {2622#false} ~cond := #in~cond; {2622#false} is VALID [2018-11-14 17:11:40,912 INFO L273 TraceCheckUtils]: 54: Hoare triple {2622#false} assume ~cond == 0; {2622#false} is VALID [2018-11-14 17:11:40,912 INFO L273 TraceCheckUtils]: 55: Hoare triple {2622#false} assume !false; {2622#false} is VALID [2018-11-14 17:11:40,915 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-14 17:11:40,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:11:40,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-14 17:11:40,945 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2018-11-14 17:11:40,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:11:40,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 17:11:41,047 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:11:41,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 17:11:41,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 17:11:41,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:11:41,048 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand 7 states. [2018-11-14 17:11:41,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:41,731 INFO L93 Difference]: Finished difference Result 148 states and 172 transitions. [2018-11-14 17:11:41,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:11:41,731 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2018-11-14 17:11:41,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:11:41,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:11:41,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2018-11-14 17:11:41,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:11:41,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2018-11-14 17:11:41,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 138 transitions. [2018-11-14 17:11:41,913 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:11:41,916 INFO L225 Difference]: With dead ends: 148 [2018-11-14 17:11:41,916 INFO L226 Difference]: Without dead ends: 85 [2018-11-14 17:11:41,917 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:11:41,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-14 17:11:42,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2018-11-14 17:11:42,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:11:42,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 81 states. [2018-11-14 17:11:42,215 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 81 states. [2018-11-14 17:11:42,215 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 81 states. [2018-11-14 17:11:42,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:42,219 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2018-11-14 17:11:42,220 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2018-11-14 17:11:42,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:11:42,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:11:42,221 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 85 states. [2018-11-14 17:11:42,221 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 85 states. [2018-11-14 17:11:42,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:42,225 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2018-11-14 17:11:42,225 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2018-11-14 17:11:42,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:11:42,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:11:42,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:11:42,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:11:42,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-14 17:11:42,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2018-11-14 17:11:42,229 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 56 [2018-11-14 17:11:42,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:11:42,230 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2018-11-14 17:11:42,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 17:11:42,230 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-11-14 17:11:42,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-14 17:11:42,231 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:11:42,231 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:11:42,231 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:11:42,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:11:42,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1189345285, now seen corresponding path program 3 times [2018-11-14 17:11:42,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:11:42,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:11:42,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:42,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:11:42,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:42,240 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:11:42,240 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:11:42,241 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-14 17:11:42,257 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:11:42,281 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 17:11:42,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:11:42,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:11:42,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:11:42,528 INFO L256 TraceCheckUtils]: 0: Hoare triple {3294#true} call ULTIMATE.init(); {3294#true} is VALID [2018-11-14 17:11:42,528 INFO L273 TraceCheckUtils]: 1: Hoare triple {3294#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3294#true} is VALID [2018-11-14 17:11:42,528 INFO L273 TraceCheckUtils]: 2: Hoare triple {3294#true} assume true; {3294#true} is VALID [2018-11-14 17:11:42,528 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3294#true} {3294#true} #133#return; {3294#true} is VALID [2018-11-14 17:11:42,529 INFO L256 TraceCheckUtils]: 4: Hoare triple {3294#true} call #t~ret9 := main(); {3294#true} is VALID [2018-11-14 17:11:42,529 INFO L273 TraceCheckUtils]: 5: Hoare triple {3294#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);~i~0 := 0;~j~0 := 0; {3314#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:42,530 INFO L273 TraceCheckUtils]: 6: Hoare triple {3314#(<= 1000 main_~m~0)} assume true; {3314#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:42,530 INFO L273 TraceCheckUtils]: 7: Hoare triple {3314#(<= 1000 main_~m~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {3314#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:42,531 INFO L273 TraceCheckUtils]: 8: Hoare triple {3314#(<= 1000 main_~m~0)} assume true; {3314#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:42,531 INFO L273 TraceCheckUtils]: 9: Hoare triple {3314#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet1;~j~0 := ~j~0 + 1; {3314#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:42,532 INFO L273 TraceCheckUtils]: 10: Hoare triple {3314#(<= 1000 main_~m~0)} assume true; {3314#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:42,532 INFO L273 TraceCheckUtils]: 11: Hoare triple {3314#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet1;~j~0 := ~j~0 + 1; {3314#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:42,533 INFO L273 TraceCheckUtils]: 12: Hoare triple {3314#(<= 1000 main_~m~0)} assume true; {3314#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:42,534 INFO L273 TraceCheckUtils]: 13: Hoare triple {3314#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet1;~j~0 := ~j~0 + 1; {3314#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:42,536 INFO L273 TraceCheckUtils]: 14: Hoare triple {3314#(<= 1000 main_~m~0)} assume true; {3314#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:42,539 INFO L273 TraceCheckUtils]: 15: Hoare triple {3314#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet1;~j~0 := ~j~0 + 1; {3314#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:42,543 INFO L273 TraceCheckUtils]: 16: Hoare triple {3314#(<= 1000 main_~m~0)} assume true; {3314#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:42,544 INFO L273 TraceCheckUtils]: 17: Hoare triple {3314#(<= 1000 main_~m~0)} assume !(~j~0 < ~n~0); {3314#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:42,545 INFO L273 TraceCheckUtils]: 18: Hoare triple {3314#(<= 1000 main_~m~0)} ~i~0 := ~i~0 + 1; {3314#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:42,547 INFO L273 TraceCheckUtils]: 19: Hoare triple {3314#(<= 1000 main_~m~0)} assume true; {3314#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:42,549 INFO L273 TraceCheckUtils]: 20: Hoare triple {3314#(<= 1000 main_~m~0)} assume !(~i~0 < ~m~0); {3314#(<= 1000 main_~m~0)} is VALID [2018-11-14 17:11:42,549 INFO L273 TraceCheckUtils]: 21: Hoare triple {3314#(<= 1000 main_~m~0)} ~i~0 := 0;~j~0 := 0; {3363#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:42,569 INFO L273 TraceCheckUtils]: 22: Hoare triple {3363#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {3363#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:42,569 INFO L273 TraceCheckUtils]: 23: Hoare triple {3363#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~i~0 < ~m~0);~j~0 := 0; {3363#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:42,570 INFO L273 TraceCheckUtils]: 24: Hoare triple {3363#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {3363#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:42,571 INFO L273 TraceCheckUtils]: 25: Hoare triple {3363#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet2;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet3;~j~0 := ~j~0 + 1; {3363#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:42,571 INFO L273 TraceCheckUtils]: 26: Hoare triple {3363#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {3363#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:42,572 INFO L273 TraceCheckUtils]: 27: Hoare triple {3363#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet2;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet3;~j~0 := ~j~0 + 1; {3363#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:42,573 INFO L273 TraceCheckUtils]: 28: Hoare triple {3363#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {3363#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:42,574 INFO L273 TraceCheckUtils]: 29: Hoare triple {3363#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet2;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet3;~j~0 := ~j~0 + 1; {3363#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:42,574 INFO L273 TraceCheckUtils]: 30: Hoare triple {3363#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {3363#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:42,575 INFO L273 TraceCheckUtils]: 31: Hoare triple {3363#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet2;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet3;~j~0 := ~j~0 + 1; {3363#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:42,576 INFO L273 TraceCheckUtils]: 32: Hoare triple {3363#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {3363#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:42,577 INFO L273 TraceCheckUtils]: 33: Hoare triple {3363#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~j~0 < ~n~0); {3363#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:42,578 INFO L273 TraceCheckUtils]: 34: Hoare triple {3363#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} ~i~0 := ~i~0 + 1; {3403#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:42,579 INFO L273 TraceCheckUtils]: 35: Hoare triple {3403#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {3403#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 17:11:42,579 INFO L273 TraceCheckUtils]: 36: Hoare triple {3403#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {3295#false} is VALID [2018-11-14 17:11:42,580 INFO L273 TraceCheckUtils]: 37: Hoare triple {3295#false} ~i~0 := 0;~j~0 := 0; {3295#false} is VALID [2018-11-14 17:11:42,580 INFO L273 TraceCheckUtils]: 38: Hoare triple {3295#false} assume true; {3295#false} is VALID [2018-11-14 17:11:42,580 INFO L273 TraceCheckUtils]: 39: Hoare triple {3295#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {3295#false} is VALID [2018-11-14 17:11:42,580 INFO L273 TraceCheckUtils]: 40: Hoare triple {3295#false} assume true; {3295#false} is VALID [2018-11-14 17:11:42,581 INFO L273 TraceCheckUtils]: 41: Hoare triple {3295#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call write~int(#t~mem4 - #t~mem5, ~#C~0.base, ~#C~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~mem4;havoc #t~mem5;~j~0 := ~j~0 + 1; {3295#false} is VALID [2018-11-14 17:11:42,581 INFO L273 TraceCheckUtils]: 42: Hoare triple {3295#false} assume true; {3295#false} is VALID [2018-11-14 17:11:42,581 INFO L273 TraceCheckUtils]: 43: Hoare triple {3295#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call write~int(#t~mem4 - #t~mem5, ~#C~0.base, ~#C~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~mem4;havoc #t~mem5;~j~0 := ~j~0 + 1; {3295#false} is VALID [2018-11-14 17:11:42,581 INFO L273 TraceCheckUtils]: 44: Hoare triple {3295#false} assume true; {3295#false} is VALID [2018-11-14 17:11:42,582 INFO L273 TraceCheckUtils]: 45: Hoare triple {3295#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call write~int(#t~mem4 - #t~mem5, ~#C~0.base, ~#C~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~mem4;havoc #t~mem5;~j~0 := ~j~0 + 1; {3295#false} is VALID [2018-11-14 17:11:42,582 INFO L273 TraceCheckUtils]: 46: Hoare triple {3295#false} assume true; {3295#false} is VALID [2018-11-14 17:11:42,582 INFO L273 TraceCheckUtils]: 47: Hoare triple {3295#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call write~int(#t~mem4 - #t~mem5, ~#C~0.base, ~#C~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~mem4;havoc #t~mem5;~j~0 := ~j~0 + 1; {3295#false} is VALID [2018-11-14 17:11:42,583 INFO L273 TraceCheckUtils]: 48: Hoare triple {3295#false} assume true; {3295#false} is VALID [2018-11-14 17:11:42,583 INFO L273 TraceCheckUtils]: 49: Hoare triple {3295#false} assume !(~j~0 < ~n~0); {3295#false} is VALID [2018-11-14 17:11:42,583 INFO L273 TraceCheckUtils]: 50: Hoare triple {3295#false} ~i~0 := ~i~0 + 1; {3295#false} is VALID [2018-11-14 17:11:42,584 INFO L273 TraceCheckUtils]: 51: Hoare triple {3295#false} assume true; {3295#false} is VALID [2018-11-14 17:11:42,584 INFO L273 TraceCheckUtils]: 52: Hoare triple {3295#false} assume !(~i~0 < ~m~0); {3295#false} is VALID [2018-11-14 17:11:42,584 INFO L273 TraceCheckUtils]: 53: Hoare triple {3295#false} ~i~0 := 0;~j~0 := 0; {3295#false} is VALID [2018-11-14 17:11:42,584 INFO L273 TraceCheckUtils]: 54: Hoare triple {3295#false} assume true; {3295#false} is VALID [2018-11-14 17:11:42,584 INFO L273 TraceCheckUtils]: 55: Hoare triple {3295#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {3295#false} is VALID [2018-11-14 17:11:42,585 INFO L273 TraceCheckUtils]: 56: Hoare triple {3295#false} assume true; {3295#false} is VALID [2018-11-14 17:11:42,585 INFO L273 TraceCheckUtils]: 57: Hoare triple {3295#false} assume !!(~j~0 < ~n~0);call #t~mem8 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem6 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem7 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {3295#false} is VALID [2018-11-14 17:11:42,585 INFO L256 TraceCheckUtils]: 58: Hoare triple {3295#false} call __VERIFIER_assert((if #t~mem8 % 4294967296 == (#t~mem6 - #t~mem7) % 4294967296 then 1 else 0)); {3295#false} is VALID [2018-11-14 17:11:42,585 INFO L273 TraceCheckUtils]: 59: Hoare triple {3295#false} ~cond := #in~cond; {3295#false} is VALID [2018-11-14 17:11:42,585 INFO L273 TraceCheckUtils]: 60: Hoare triple {3295#false} assume ~cond == 0; {3295#false} is VALID [2018-11-14 17:11:42,585 INFO L273 TraceCheckUtils]: 61: Hoare triple {3295#false} assume !false; {3295#false} is VALID [2018-11-14 17:11:42,588 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-14 17:11:42,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:11:42,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-14 17:11:42,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2018-11-14 17:11:42,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:11:42,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:11:42,649 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:11:42,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:11:42,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:11:42,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:11:42,650 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 5 states. [2018-11-14 17:11:43,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:43,373 INFO L93 Difference]: Finished difference Result 255 states and 292 transitions. [2018-11-14 17:11:43,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:11:43,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2018-11-14 17:11:43,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:11:43,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:11:43,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2018-11-14 17:11:43,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:11:43,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2018-11-14 17:11:43,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 132 transitions. [2018-11-14 17:11:43,535 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:11:43,539 INFO L225 Difference]: With dead ends: 255 [2018-11-14 17:11:43,540 INFO L226 Difference]: Without dead ends: 195 [2018-11-14 17:11:43,541 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 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-14 17:11:43,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-11-14 17:11:43,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 120. [2018-11-14 17:11:43,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:11:43,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 195 states. Second operand 120 states. [2018-11-14 17:11:43,850 INFO L74 IsIncluded]: Start isIncluded. First operand 195 states. Second operand 120 states. [2018-11-14 17:11:43,851 INFO L87 Difference]: Start difference. First operand 195 states. Second operand 120 states. [2018-11-14 17:11:43,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:43,860 INFO L93 Difference]: Finished difference Result 195 states and 221 transitions. [2018-11-14 17:11:43,860 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 221 transitions. [2018-11-14 17:11:43,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:11:43,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:11:43,861 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 195 states. [2018-11-14 17:11:43,861 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 195 states. [2018-11-14 17:11:43,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:11:43,869 INFO L93 Difference]: Finished difference Result 195 states and 221 transitions. [2018-11-14 17:11:43,869 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 221 transitions. [2018-11-14 17:11:43,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:11:43,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:11:43,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:11:43,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:11:43,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-14 17:11:43,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 133 transitions. [2018-11-14 17:11:43,875 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 133 transitions. Word has length 62 [2018-11-14 17:11:43,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:11:43,876 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 133 transitions. [2018-11-14 17:11:43,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:11:43,876 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 133 transitions. [2018-11-14 17:11:43,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-14 17:11:43,877 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:11:43,878 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:11:43,878 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:11:43,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:11:43,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1141625288, now seen corresponding path program 4 times [2018-11-14 17:11:43,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:11:43,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:11:43,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:43,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:11:43,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:11:43,888 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:11:43,888 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:11:43,888 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-14 17:11:43,908 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:12:40,388 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:12:40,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:12:40,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:12:40,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:12:40,664 INFO L256 TraceCheckUtils]: 0: Hoare triple {4417#true} call ULTIMATE.init(); {4417#true} is VALID [2018-11-14 17:12:40,665 INFO L273 TraceCheckUtils]: 1: Hoare triple {4417#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4417#true} is VALID [2018-11-14 17:12:40,665 INFO L273 TraceCheckUtils]: 2: Hoare triple {4417#true} assume true; {4417#true} is VALID [2018-11-14 17:12:40,665 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4417#true} {4417#true} #133#return; {4417#true} is VALID [2018-11-14 17:12:40,666 INFO L256 TraceCheckUtils]: 4: Hoare triple {4417#true} call #t~ret9 := main(); {4417#true} is VALID [2018-11-14 17:12:40,667 INFO L273 TraceCheckUtils]: 5: Hoare triple {4417#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);~i~0 := 0;~j~0 := 0; {4437#(<= 1500 main_~n~0)} is VALID [2018-11-14 17:12:40,668 INFO L273 TraceCheckUtils]: 6: Hoare triple {4437#(<= 1500 main_~n~0)} assume true; {4437#(<= 1500 main_~n~0)} is VALID [2018-11-14 17:12:40,669 INFO L273 TraceCheckUtils]: 7: Hoare triple {4437#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {4444#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:12:40,669 INFO L273 TraceCheckUtils]: 8: Hoare triple {4444#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {4444#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:12:40,670 INFO L273 TraceCheckUtils]: 9: Hoare triple {4444#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet1;~j~0 := ~j~0 + 1; {4451#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 17:12:40,671 INFO L273 TraceCheckUtils]: 10: Hoare triple {4451#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume true; {4451#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 17:12:40,672 INFO L273 TraceCheckUtils]: 11: Hoare triple {4451#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet1;~j~0 := ~j~0 + 1; {4458#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-14 17:12:40,673 INFO L273 TraceCheckUtils]: 12: Hoare triple {4458#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume true; {4458#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-14 17:12:40,674 INFO L273 TraceCheckUtils]: 13: Hoare triple {4458#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet1;~j~0 := ~j~0 + 1; {4465#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-14 17:12:40,675 INFO L273 TraceCheckUtils]: 14: Hoare triple {4465#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume true; {4465#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-14 17:12:40,676 INFO L273 TraceCheckUtils]: 15: Hoare triple {4465#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet1;~j~0 := ~j~0 + 1; {4472#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-14 17:12:40,677 INFO L273 TraceCheckUtils]: 16: Hoare triple {4472#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume true; {4472#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-14 17:12:40,678 INFO L273 TraceCheckUtils]: 17: Hoare triple {4472#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume !(~j~0 < ~n~0); {4418#false} is VALID [2018-11-14 17:12:40,678 INFO L273 TraceCheckUtils]: 18: Hoare triple {4418#false} ~i~0 := ~i~0 + 1; {4418#false} is VALID [2018-11-14 17:12:40,678 INFO L273 TraceCheckUtils]: 19: Hoare triple {4418#false} assume true; {4418#false} is VALID [2018-11-14 17:12:40,678 INFO L273 TraceCheckUtils]: 20: Hoare triple {4418#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {4418#false} is VALID [2018-11-14 17:12:40,679 INFO L273 TraceCheckUtils]: 21: Hoare triple {4418#false} assume true; {4418#false} is VALID [2018-11-14 17:12:40,679 INFO L273 TraceCheckUtils]: 22: Hoare triple {4418#false} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet1;~j~0 := ~j~0 + 1; {4418#false} is VALID [2018-11-14 17:12:40,679 INFO L273 TraceCheckUtils]: 23: Hoare triple {4418#false} assume true; {4418#false} is VALID [2018-11-14 17:12:40,679 INFO L273 TraceCheckUtils]: 24: Hoare triple {4418#false} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet1;~j~0 := ~j~0 + 1; {4418#false} is VALID [2018-11-14 17:12:40,680 INFO L273 TraceCheckUtils]: 25: Hoare triple {4418#false} assume true; {4418#false} is VALID [2018-11-14 17:12:40,680 INFO L273 TraceCheckUtils]: 26: Hoare triple {4418#false} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet1;~j~0 := ~j~0 + 1; {4418#false} is VALID [2018-11-14 17:12:40,680 INFO L273 TraceCheckUtils]: 27: Hoare triple {4418#false} assume true; {4418#false} is VALID [2018-11-14 17:12:40,680 INFO L273 TraceCheckUtils]: 28: Hoare triple {4418#false} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet1;~j~0 := ~j~0 + 1; {4418#false} is VALID [2018-11-14 17:12:40,681 INFO L273 TraceCheckUtils]: 29: Hoare triple {4418#false} assume true; {4418#false} is VALID [2018-11-14 17:12:40,681 INFO L273 TraceCheckUtils]: 30: Hoare triple {4418#false} assume !(~j~0 < ~n~0); {4418#false} is VALID [2018-11-14 17:12:40,681 INFO L273 TraceCheckUtils]: 31: Hoare triple {4418#false} ~i~0 := ~i~0 + 1; {4418#false} is VALID [2018-11-14 17:12:40,681 INFO L273 TraceCheckUtils]: 32: Hoare triple {4418#false} assume true; {4418#false} is VALID [2018-11-14 17:12:40,682 INFO L273 TraceCheckUtils]: 33: Hoare triple {4418#false} assume !(~i~0 < ~m~0); {4418#false} is VALID [2018-11-14 17:12:40,682 INFO L273 TraceCheckUtils]: 34: Hoare triple {4418#false} ~i~0 := 0;~j~0 := 0; {4418#false} is VALID [2018-11-14 17:12:40,682 INFO L273 TraceCheckUtils]: 35: Hoare triple {4418#false} assume true; {4418#false} is VALID [2018-11-14 17:12:40,682 INFO L273 TraceCheckUtils]: 36: Hoare triple {4418#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {4418#false} is VALID [2018-11-14 17:12:40,682 INFO L273 TraceCheckUtils]: 37: Hoare triple {4418#false} assume true; {4418#false} is VALID [2018-11-14 17:12:40,683 INFO L273 TraceCheckUtils]: 38: Hoare triple {4418#false} assume !!(~j~0 < ~n~0);call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet2;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet3;~j~0 := ~j~0 + 1; {4418#false} is VALID [2018-11-14 17:12:40,683 INFO L273 TraceCheckUtils]: 39: Hoare triple {4418#false} assume true; {4418#false} is VALID [2018-11-14 17:12:40,683 INFO L273 TraceCheckUtils]: 40: Hoare triple {4418#false} assume !!(~j~0 < ~n~0);call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet2;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet3;~j~0 := ~j~0 + 1; {4418#false} is VALID [2018-11-14 17:12:40,683 INFO L273 TraceCheckUtils]: 41: Hoare triple {4418#false} assume true; {4418#false} is VALID [2018-11-14 17:12:40,683 INFO L273 TraceCheckUtils]: 42: Hoare triple {4418#false} assume !!(~j~0 < ~n~0);call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet2;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet3;~j~0 := ~j~0 + 1; {4418#false} is VALID [2018-11-14 17:12:40,684 INFO L273 TraceCheckUtils]: 43: Hoare triple {4418#false} assume true; {4418#false} is VALID [2018-11-14 17:12:40,684 INFO L273 TraceCheckUtils]: 44: Hoare triple {4418#false} assume !!(~j~0 < ~n~0);call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet2;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet3;~j~0 := ~j~0 + 1; {4418#false} is VALID [2018-11-14 17:12:40,684 INFO L273 TraceCheckUtils]: 45: Hoare triple {4418#false} assume true; {4418#false} is VALID [2018-11-14 17:12:40,684 INFO L273 TraceCheckUtils]: 46: Hoare triple {4418#false} assume !(~j~0 < ~n~0); {4418#false} is VALID [2018-11-14 17:12:40,684 INFO L273 TraceCheckUtils]: 47: Hoare triple {4418#false} ~i~0 := ~i~0 + 1; {4418#false} is VALID [2018-11-14 17:12:40,685 INFO L273 TraceCheckUtils]: 48: Hoare triple {4418#false} assume true; {4418#false} is VALID [2018-11-14 17:12:40,685 INFO L273 TraceCheckUtils]: 49: Hoare triple {4418#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {4418#false} is VALID [2018-11-14 17:12:40,685 INFO L273 TraceCheckUtils]: 50: Hoare triple {4418#false} assume true; {4418#false} is VALID [2018-11-14 17:12:40,685 INFO L273 TraceCheckUtils]: 51: Hoare triple {4418#false} assume !!(~j~0 < ~n~0);call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet2;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet3;~j~0 := ~j~0 + 1; {4418#false} is VALID [2018-11-14 17:12:40,685 INFO L273 TraceCheckUtils]: 52: Hoare triple {4418#false} assume true; {4418#false} is VALID [2018-11-14 17:12:40,686 INFO L273 TraceCheckUtils]: 53: Hoare triple {4418#false} assume !!(~j~0 < ~n~0);call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet2;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet3;~j~0 := ~j~0 + 1; {4418#false} is VALID [2018-11-14 17:12:40,686 INFO L273 TraceCheckUtils]: 54: Hoare triple {4418#false} assume true; {4418#false} is VALID [2018-11-14 17:12:40,686 INFO L273 TraceCheckUtils]: 55: Hoare triple {4418#false} assume !!(~j~0 < ~n~0);call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet2;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet3;~j~0 := ~j~0 + 1; {4418#false} is VALID [2018-11-14 17:12:40,686 INFO L273 TraceCheckUtils]: 56: Hoare triple {4418#false} assume true; {4418#false} is VALID [2018-11-14 17:12:40,686 INFO L273 TraceCheckUtils]: 57: Hoare triple {4418#false} assume !!(~j~0 < ~n~0);call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet2;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet3;~j~0 := ~j~0 + 1; {4418#false} is VALID [2018-11-14 17:12:40,687 INFO L273 TraceCheckUtils]: 58: Hoare triple {4418#false} assume true; {4418#false} is VALID [2018-11-14 17:12:40,687 INFO L273 TraceCheckUtils]: 59: Hoare triple {4418#false} assume !(~j~0 < ~n~0); {4418#false} is VALID [2018-11-14 17:12:40,687 INFO L273 TraceCheckUtils]: 60: Hoare triple {4418#false} ~i~0 := ~i~0 + 1; {4418#false} is VALID [2018-11-14 17:12:40,687 INFO L273 TraceCheckUtils]: 61: Hoare triple {4418#false} assume true; {4418#false} is VALID [2018-11-14 17:12:40,687 INFO L273 TraceCheckUtils]: 62: Hoare triple {4418#false} assume !(~i~0 < ~m~0); {4418#false} is VALID [2018-11-14 17:12:40,688 INFO L273 TraceCheckUtils]: 63: Hoare triple {4418#false} ~i~0 := 0;~j~0 := 0; {4418#false} is VALID [2018-11-14 17:12:40,688 INFO L273 TraceCheckUtils]: 64: Hoare triple {4418#false} assume true; {4418#false} is VALID [2018-11-14 17:12:40,688 INFO L273 TraceCheckUtils]: 65: Hoare triple {4418#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {4418#false} is VALID [2018-11-14 17:12:40,688 INFO L273 TraceCheckUtils]: 66: Hoare triple {4418#false} assume true; {4418#false} is VALID [2018-11-14 17:12:40,688 INFO L273 TraceCheckUtils]: 67: Hoare triple {4418#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call write~int(#t~mem4 - #t~mem5, ~#C~0.base, ~#C~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~mem4;havoc #t~mem5;~j~0 := ~j~0 + 1; {4418#false} is VALID [2018-11-14 17:12:40,689 INFO L273 TraceCheckUtils]: 68: Hoare triple {4418#false} assume true; {4418#false} is VALID [2018-11-14 17:12:40,689 INFO L273 TraceCheckUtils]: 69: Hoare triple {4418#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call write~int(#t~mem4 - #t~mem5, ~#C~0.base, ~#C~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~mem4;havoc #t~mem5;~j~0 := ~j~0 + 1; {4418#false} is VALID [2018-11-14 17:12:40,689 INFO L273 TraceCheckUtils]: 70: Hoare triple {4418#false} assume true; {4418#false} is VALID [2018-11-14 17:12:40,689 INFO L273 TraceCheckUtils]: 71: Hoare triple {4418#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call write~int(#t~mem4 - #t~mem5, ~#C~0.base, ~#C~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~mem4;havoc #t~mem5;~j~0 := ~j~0 + 1; {4418#false} is VALID [2018-11-14 17:12:40,689 INFO L273 TraceCheckUtils]: 72: Hoare triple {4418#false} assume true; {4418#false} is VALID [2018-11-14 17:12:40,690 INFO L273 TraceCheckUtils]: 73: Hoare triple {4418#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call write~int(#t~mem4 - #t~mem5, ~#C~0.base, ~#C~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~mem4;havoc #t~mem5;~j~0 := ~j~0 + 1; {4418#false} is VALID [2018-11-14 17:12:40,690 INFO L273 TraceCheckUtils]: 74: Hoare triple {4418#false} assume true; {4418#false} is VALID [2018-11-14 17:12:40,690 INFO L273 TraceCheckUtils]: 75: Hoare triple {4418#false} assume !(~j~0 < ~n~0); {4418#false} is VALID [2018-11-14 17:12:40,690 INFO L273 TraceCheckUtils]: 76: Hoare triple {4418#false} ~i~0 := ~i~0 + 1; {4418#false} is VALID [2018-11-14 17:12:40,690 INFO L273 TraceCheckUtils]: 77: Hoare triple {4418#false} assume true; {4418#false} is VALID [2018-11-14 17:12:40,691 INFO L273 TraceCheckUtils]: 78: Hoare triple {4418#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {4418#false} is VALID [2018-11-14 17:12:40,691 INFO L273 TraceCheckUtils]: 79: Hoare triple {4418#false} assume true; {4418#false} is VALID [2018-11-14 17:12:40,691 INFO L273 TraceCheckUtils]: 80: Hoare triple {4418#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call write~int(#t~mem4 - #t~mem5, ~#C~0.base, ~#C~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~mem4;havoc #t~mem5;~j~0 := ~j~0 + 1; {4418#false} is VALID [2018-11-14 17:12:40,691 INFO L273 TraceCheckUtils]: 81: Hoare triple {4418#false} assume true; {4418#false} is VALID [2018-11-14 17:12:40,691 INFO L273 TraceCheckUtils]: 82: Hoare triple {4418#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call write~int(#t~mem4 - #t~mem5, ~#C~0.base, ~#C~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~mem4;havoc #t~mem5;~j~0 := ~j~0 + 1; {4418#false} is VALID [2018-11-14 17:12:40,692 INFO L273 TraceCheckUtils]: 83: Hoare triple {4418#false} assume true; {4418#false} is VALID [2018-11-14 17:12:40,692 INFO L273 TraceCheckUtils]: 84: Hoare triple {4418#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call write~int(#t~mem4 - #t~mem5, ~#C~0.base, ~#C~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~mem4;havoc #t~mem5;~j~0 := ~j~0 + 1; {4418#false} is VALID [2018-11-14 17:12:40,692 INFO L273 TraceCheckUtils]: 85: Hoare triple {4418#false} assume true; {4418#false} is VALID [2018-11-14 17:12:40,692 INFO L273 TraceCheckUtils]: 86: Hoare triple {4418#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call write~int(#t~mem4 - #t~mem5, ~#C~0.base, ~#C~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~mem4;havoc #t~mem5;~j~0 := ~j~0 + 1; {4418#false} is VALID [2018-11-14 17:12:40,692 INFO L273 TraceCheckUtils]: 87: Hoare triple {4418#false} assume true; {4418#false} is VALID [2018-11-14 17:12:40,693 INFO L273 TraceCheckUtils]: 88: Hoare triple {4418#false} assume !(~j~0 < ~n~0); {4418#false} is VALID [2018-11-14 17:12:40,693 INFO L273 TraceCheckUtils]: 89: Hoare triple {4418#false} ~i~0 := ~i~0 + 1; {4418#false} is VALID [2018-11-14 17:12:40,693 INFO L273 TraceCheckUtils]: 90: Hoare triple {4418#false} assume true; {4418#false} is VALID [2018-11-14 17:12:40,693 INFO L273 TraceCheckUtils]: 91: Hoare triple {4418#false} assume !(~i~0 < ~m~0); {4418#false} is VALID [2018-11-14 17:12:40,693 INFO L273 TraceCheckUtils]: 92: Hoare triple {4418#false} ~i~0 := 0;~j~0 := 0; {4418#false} is VALID [2018-11-14 17:12:40,693 INFO L273 TraceCheckUtils]: 93: Hoare triple {4418#false} assume true; {4418#false} is VALID [2018-11-14 17:12:40,694 INFO L273 TraceCheckUtils]: 94: Hoare triple {4418#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {4418#false} is VALID [2018-11-14 17:12:40,694 INFO L273 TraceCheckUtils]: 95: Hoare triple {4418#false} assume true; {4418#false} is VALID [2018-11-14 17:12:40,694 INFO L273 TraceCheckUtils]: 96: Hoare triple {4418#false} assume !!(~j~0 < ~n~0);call #t~mem8 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem6 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem7 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {4418#false} is VALID [2018-11-14 17:12:40,694 INFO L256 TraceCheckUtils]: 97: Hoare triple {4418#false} call __VERIFIER_assert((if #t~mem8 % 4294967296 == (#t~mem6 - #t~mem7) % 4294967296 then 1 else 0)); {4418#false} is VALID [2018-11-14 17:12:40,694 INFO L273 TraceCheckUtils]: 98: Hoare triple {4418#false} ~cond := #in~cond; {4418#false} is VALID [2018-11-14 17:12:40,695 INFO L273 TraceCheckUtils]: 99: Hoare triple {4418#false} assume ~cond == 0; {4418#false} is VALID [2018-11-14 17:12:40,695 INFO L273 TraceCheckUtils]: 100: Hoare triple {4418#false} assume !false; {4418#false} is VALID [2018-11-14 17:12:40,700 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 54 proven. 20 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-11-14 17:12:40,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:12:40,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-14 17:12:40,729 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2018-11-14 17:12:40,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:12:40,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 17:12:40,782 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:12:40,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 17:12:40,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 17:12:40,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:12:40,783 INFO L87 Difference]: Start difference. First operand 120 states and 133 transitions. Second operand 8 states. [2018-11-14 17:12:41,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:12:41,589 INFO L93 Difference]: Finished difference Result 242 states and 276 transitions. [2018-11-14 17:12:41,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:12:41,589 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2018-11-14 17:12:41,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:12:41,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:12:41,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2018-11-14 17:12:41,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:12:41,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2018-11-14 17:12:41,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 149 transitions. [2018-11-14 17:12:41,777 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:12:41,780 INFO L225 Difference]: With dead ends: 242 [2018-11-14 17:12:41,780 INFO L226 Difference]: Without dead ends: 140 [2018-11-14 17:12:41,781 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:12:41,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-14 17:12:42,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 136. [2018-11-14 17:12:42,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:12:42,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand 136 states. [2018-11-14 17:12:42,147 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 136 states. [2018-11-14 17:12:42,147 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 136 states. [2018-11-14 17:12:42,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:12:42,153 INFO L93 Difference]: Finished difference Result 140 states and 155 transitions. [2018-11-14 17:12:42,153 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 155 transitions. [2018-11-14 17:12:42,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:12:42,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:12:42,154 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 140 states. [2018-11-14 17:12:42,154 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 140 states. [2018-11-14 17:12:42,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:12:42,160 INFO L93 Difference]: Finished difference Result 140 states and 155 transitions. [2018-11-14 17:12:42,160 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 155 transitions. [2018-11-14 17:12:42,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:12:42,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:12:42,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:12:42,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:12:42,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-14 17:12:42,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 150 transitions. [2018-11-14 17:12:42,166 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 150 transitions. Word has length 101 [2018-11-14 17:12:42,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:12:42,166 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 150 transitions. [2018-11-14 17:12:42,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 17:12:42,166 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 150 transitions. [2018-11-14 17:12:42,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-14 17:12:42,168 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:12:42,168 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:12:42,168 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:12:42,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:12:42,169 INFO L82 PathProgramCache]: Analyzing trace with hash -2128325832, now seen corresponding path program 5 times [2018-11-14 17:12:42,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:12:42,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:12:42,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:12:42,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:12:42,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:12:42,177 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:12:42,177 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:12:42,177 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:12:42,195 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1