java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-industry-pattern/array_mul_init_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:11:21,512 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:11:21,515 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:11:21,530 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:11:21,531 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:11:21,532 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:11:21,533 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:11:21,535 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:11:21,536 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:11:21,537 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:11:21,538 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:11:21,538 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:11:21,539 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:11:21,540 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:11:21,542 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:11:21,542 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:11:21,543 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:11:21,545 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:11:21,547 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:11:21,549 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:11:21,550 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:11:21,551 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:11:21,554 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:11:21,554 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:11:21,554 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:11:21,555 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:11:21,556 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:11:21,557 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:11:21,558 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:11:21,562 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:11:21,562 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:11:21,564 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:11:21,564 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:11:21,565 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:11:21,569 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:11:21,570 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:11:21,570 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:11:21,586 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:11:21,587 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:11:21,587 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:11:21,588 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:11:21,588 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:11:21,588 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:11:21,589 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:11:21,589 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:11:21,589 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:11:21,589 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:11:21,589 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:11:21,590 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:11:21,590 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:11:21,590 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:11:21,590 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:11:21,590 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:11:21,591 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:11:21,591 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:11:21,591 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:11:21,591 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:11:21,591 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:11:21,592 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:11:21,592 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:11:21,592 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:11:21,592 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:11:21,592 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:11:21,593 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:11:21,593 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:11:21,593 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:11:21,593 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:11:21,593 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:11:21,644 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:11:21,657 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:11:21,661 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:11:21,662 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:11:21,663 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:11:21,663 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-industry-pattern/array_mul_init_true-unreach-call_true-termination.i [2018-11-23 12:11:21,722 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b2c56357/9f0021451f4a48f0a892b2d4706c7621/FLAGef5444e70 [2018-11-23 12:11:22,191 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:11:22,192 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/array_mul_init_true-unreach-call_true-termination.i [2018-11-23 12:11:22,198 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b2c56357/9f0021451f4a48f0a892b2d4706c7621/FLAGef5444e70 [2018-11-23 12:11:22,567 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b2c56357/9f0021451f4a48f0a892b2d4706c7621 [2018-11-23 12:11:22,578 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:11:22,580 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:11:22,581 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:11:22,581 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:11:22,585 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:11:22,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:11:22" (1/1) ... [2018-11-23 12:11:22,591 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38a0f65c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:11:22, skipping insertion in model container [2018-11-23 12:11:22,591 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:11:22" (1/1) ... [2018-11-23 12:11:22,602 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:11:22,629 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:11:22,870 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:11:22,877 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:11:22,920 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:11:22,958 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:11:22,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:11:22 WrapperNode [2018-11-23 12:11:22,959 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:11:22,960 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:11:22,960 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:11:22,960 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:11:22,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:11:22" (1/1) ... [2018-11-23 12:11:22,984 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:11:22" (1/1) ... [2018-11-23 12:11:22,994 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:11:22,995 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:11:22,995 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:11:22,995 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:11:23,007 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:11:22" (1/1) ... [2018-11-23 12:11:23,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:11:22" (1/1) ... [2018-11-23 12:11:23,011 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:11:22" (1/1) ... [2018-11-23 12:11:23,012 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:11:22" (1/1) ... [2018-11-23 12:11:23,034 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:11:22" (1/1) ... [2018-11-23 12:11:23,047 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:11:22" (1/1) ... [2018-11-23 12:11:23,050 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:11:22" (1/1) ... [2018-11-23 12:11:23,053 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:11:23,054 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:11:23,054 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:11:23,054 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:11:23,058 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:11:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:11:23,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:11:23,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:11:23,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:11:23,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:11:23,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:11:23,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:11:23,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:11:23,199 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:11:23,199 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:11:23,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:11:23,199 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:11:23,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:11:23,862 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:11:23,863 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:11:23,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:11:23 BoogieIcfgContainer [2018-11-23 12:11:23,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:11:23,865 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:11:23,865 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:11:23,869 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:11:23,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:11:22" (1/3) ... [2018-11-23 12:11:23,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24439f6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:11:23, skipping insertion in model container [2018-11-23 12:11:23,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:11:22" (2/3) ... [2018-11-23 12:11:23,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24439f6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:11:23, skipping insertion in model container [2018-11-23 12:11:23,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:11:23" (3/3) ... [2018-11-23 12:11:23,873 INFO L112 eAbstractionObserver]: Analyzing ICFG array_mul_init_true-unreach-call_true-termination.i [2018-11-23 12:11:23,882 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:11:23,891 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:11:23,908 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:11:23,944 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:11:23,945 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:11:23,945 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:11:23,945 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:11:23,946 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:11:23,946 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:11:23,946 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:11:23,946 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:11:23,946 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:11:23,966 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-23 12:11:23,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:11:23,972 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:23,973 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:23,976 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:23,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:23,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1583089931, now seen corresponding path program 1 times [2018-11-23 12:11:23,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:23,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:24,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:24,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:11:24,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:24,178 INFO L256 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2018-11-23 12:11:24,182 INFO L273 TraceCheckUtils]: 1: Hoare triple {32#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32#true} is VALID [2018-11-23 12:11:24,182 INFO L273 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-23 12:11:24,183 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #74#return; {32#true} is VALID [2018-11-23 12:11:24,183 INFO L256 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret11 := main(); {32#true} is VALID [2018-11-23 12:11:24,183 INFO L273 TraceCheckUtils]: 5: Hoare triple {32#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);havoc ~k~0;havoc ~i~0;~i~0 := 0; {32#true} is VALID [2018-11-23 12:11:24,185 INFO L273 TraceCheckUtils]: 6: Hoare triple {32#true} assume !true; {33#false} is VALID [2018-11-23 12:11:24,185 INFO L273 TraceCheckUtils]: 7: Hoare triple {33#false} ~i~0 := 0; {33#false} is VALID [2018-11-23 12:11:24,186 INFO L273 TraceCheckUtils]: 8: Hoare triple {33#false} assume !true; {33#false} is VALID [2018-11-23 12:11:24,186 INFO L273 TraceCheckUtils]: 9: Hoare triple {33#false} ~i~0 := 0; {33#false} is VALID [2018-11-23 12:11:24,186 INFO L273 TraceCheckUtils]: 10: Hoare triple {33#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem5 == #t~mem6; {33#false} is VALID [2018-11-23 12:11:24,187 INFO L273 TraceCheckUtils]: 11: Hoare triple {33#false} assume #t~short10; {33#false} is VALID [2018-11-23 12:11:24,187 INFO L256 TraceCheckUtils]: 12: Hoare triple {33#false} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {33#false} is VALID [2018-11-23 12:11:24,187 INFO L273 TraceCheckUtils]: 13: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2018-11-23 12:11:24,188 INFO L273 TraceCheckUtils]: 14: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2018-11-23 12:11:24,188 INFO L273 TraceCheckUtils]: 15: Hoare triple {33#false} assume !false; {33#false} is VALID [2018-11-23 12:11:24,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:11:24,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:11:24,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:11:24,200 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-23 12:11:24,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:24,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:11:24,381 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:24,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:11:24,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:11:24,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:11:24,393 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-11-23 12:11:24,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:24,718 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2018-11-23 12:11:24,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:11:24,718 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-23 12:11:24,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:24,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:11:24,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 65 transitions. [2018-11-23 12:11:24,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:11:24,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 65 transitions. [2018-11-23 12:11:24,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 65 transitions. [2018-11-23 12:11:25,007 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:25,018 INFO L225 Difference]: With dead ends: 50 [2018-11-23 12:11:25,018 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 12:11:25,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-23 12:11:25,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 12:11:25,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 12:11:25,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:25,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-23 12:11:25,067 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 12:11:25,067 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 12:11:25,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:25,072 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-23 12:11:25,072 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 12:11:25,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:25,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:25,073 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 12:11:25,073 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 12:11:25,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:25,078 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-23 12:11:25,078 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 12:11:25,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:25,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:25,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:25,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:25,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:11:25,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-11-23 12:11:25,084 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 16 [2018-11-23 12:11:25,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:25,085 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-23 12:11:25,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:11:25,085 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 12:11:25,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:11:25,086 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:25,087 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:25,087 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:25,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:25,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1899913894, now seen corresponding path program 1 times [2018-11-23 12:11:25,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:25,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:25,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:25,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:11:25,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:25,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:25,178 INFO L256 TraceCheckUtils]: 0: Hoare triple {180#true} call ULTIMATE.init(); {180#true} is VALID [2018-11-23 12:11:25,179 INFO L273 TraceCheckUtils]: 1: Hoare triple {180#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {180#true} is VALID [2018-11-23 12:11:25,179 INFO L273 TraceCheckUtils]: 2: Hoare triple {180#true} assume true; {180#true} is VALID [2018-11-23 12:11:25,180 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {180#true} {180#true} #74#return; {180#true} is VALID [2018-11-23 12:11:25,180 INFO L256 TraceCheckUtils]: 4: Hoare triple {180#true} call #t~ret11 := main(); {180#true} is VALID [2018-11-23 12:11:25,181 INFO L273 TraceCheckUtils]: 5: Hoare triple {180#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);havoc ~k~0;havoc ~i~0;~i~0 := 0; {182#(= main_~i~0 0)} is VALID [2018-11-23 12:11:25,185 INFO L273 TraceCheckUtils]: 6: Hoare triple {182#(= main_~i~0 0)} assume !(~i~0 < 100000); {181#false} is VALID [2018-11-23 12:11:25,185 INFO L273 TraceCheckUtils]: 7: Hoare triple {181#false} ~i~0 := 0; {181#false} is VALID [2018-11-23 12:11:25,185 INFO L273 TraceCheckUtils]: 8: Hoare triple {181#false} assume !(~i~0 < 100000); {181#false} is VALID [2018-11-23 12:11:25,186 INFO L273 TraceCheckUtils]: 9: Hoare triple {181#false} ~i~0 := 0; {181#false} is VALID [2018-11-23 12:11:25,186 INFO L273 TraceCheckUtils]: 10: Hoare triple {181#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem5 == #t~mem6; {181#false} is VALID [2018-11-23 12:11:25,186 INFO L273 TraceCheckUtils]: 11: Hoare triple {181#false} assume #t~short10; {181#false} is VALID [2018-11-23 12:11:25,187 INFO L256 TraceCheckUtils]: 12: Hoare triple {181#false} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {181#false} is VALID [2018-11-23 12:11:25,187 INFO L273 TraceCheckUtils]: 13: Hoare triple {181#false} ~cond := #in~cond; {181#false} is VALID [2018-11-23 12:11:25,187 INFO L273 TraceCheckUtils]: 14: Hoare triple {181#false} assume 0 == ~cond; {181#false} is VALID [2018-11-23 12:11:25,187 INFO L273 TraceCheckUtils]: 15: Hoare triple {181#false} assume !false; {181#false} is VALID [2018-11-23 12:11:25,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:11:25,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:11:25,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:11:25,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:11:25,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:25,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:11:25,239 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:25,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:11:25,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:11:25,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:11:25,240 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 3 states. [2018-11-23 12:11:25,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:25,634 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2018-11-23 12:11:25,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:11:25,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:11:25,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:25,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:11:25,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-23 12:11:25,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:11:25,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-23 12:11:25,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2018-11-23 12:11:26,045 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:26,047 INFO L225 Difference]: With dead ends: 50 [2018-11-23 12:11:26,047 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:11:26,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:11:26,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:11:26,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2018-11-23 12:11:26,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:26,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 26 states. [2018-11-23 12:11:26,066 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 26 states. [2018-11-23 12:11:26,066 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 26 states. [2018-11-23 12:11:26,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:26,071 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2018-11-23 12:11:26,071 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2018-11-23 12:11:26,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:26,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:26,072 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 34 states. [2018-11-23 12:11:26,072 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 34 states. [2018-11-23 12:11:26,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:26,077 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2018-11-23 12:11:26,077 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2018-11-23 12:11:26,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:26,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:26,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:26,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:26,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:11:26,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-23 12:11:26,081 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 16 [2018-11-23 12:11:26,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:26,081 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-23 12:11:26,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:11:26,082 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:11:26,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:11:26,082 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:26,083 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:26,083 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:26,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:26,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1536301701, now seen corresponding path program 1 times [2018-11-23 12:11:26,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:26,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:26,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:26,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:11:26,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:26,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:26,254 INFO L256 TraceCheckUtils]: 0: Hoare triple {357#true} call ULTIMATE.init(); {357#true} is VALID [2018-11-23 12:11:26,254 INFO L273 TraceCheckUtils]: 1: Hoare triple {357#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {357#true} is VALID [2018-11-23 12:11:26,255 INFO L273 TraceCheckUtils]: 2: Hoare triple {357#true} assume true; {357#true} is VALID [2018-11-23 12:11:26,255 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {357#true} {357#true} #74#return; {357#true} is VALID [2018-11-23 12:11:26,255 INFO L256 TraceCheckUtils]: 4: Hoare triple {357#true} call #t~ret11 := main(); {357#true} is VALID [2018-11-23 12:11:26,255 INFO L273 TraceCheckUtils]: 5: Hoare triple {357#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);havoc ~k~0;havoc ~i~0;~i~0 := 0; {357#true} is VALID [2018-11-23 12:11:26,256 INFO L273 TraceCheckUtils]: 6: Hoare triple {357#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {357#true} is VALID [2018-11-23 12:11:26,256 INFO L273 TraceCheckUtils]: 7: Hoare triple {357#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {357#true} is VALID [2018-11-23 12:11:26,256 INFO L273 TraceCheckUtils]: 8: Hoare triple {357#true} assume !(~i~0 < 100000); {357#true} is VALID [2018-11-23 12:11:26,256 INFO L273 TraceCheckUtils]: 9: Hoare triple {357#true} ~i~0 := 0; {357#true} is VALID [2018-11-23 12:11:26,257 INFO L273 TraceCheckUtils]: 10: Hoare triple {357#true} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {357#true} is VALID [2018-11-23 12:11:26,257 INFO L273 TraceCheckUtils]: 11: Hoare triple {357#true} assume !(0 != #t~nondet2);havoc #t~nondet2; {357#true} is VALID [2018-11-23 12:11:26,257 INFO L273 TraceCheckUtils]: 12: Hoare triple {357#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {357#true} is VALID [2018-11-23 12:11:26,258 INFO L273 TraceCheckUtils]: 13: Hoare triple {357#true} assume !(~i~0 < 100000); {357#true} is VALID [2018-11-23 12:11:26,258 INFO L273 TraceCheckUtils]: 14: Hoare triple {357#true} ~i~0 := 0; {357#true} is VALID [2018-11-23 12:11:26,258 INFO L273 TraceCheckUtils]: 15: Hoare triple {357#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem5 == #t~mem6; {357#true} is VALID [2018-11-23 12:11:26,259 INFO L273 TraceCheckUtils]: 16: Hoare triple {357#true} assume #t~short10; {359#|main_#t~short10|} is VALID [2018-11-23 12:11:26,264 INFO L256 TraceCheckUtils]: 17: Hoare triple {359#|main_#t~short10|} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {360#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:11:26,265 INFO L273 TraceCheckUtils]: 18: Hoare triple {360#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {361#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 12:11:26,269 INFO L273 TraceCheckUtils]: 19: Hoare triple {361#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {358#false} is VALID [2018-11-23 12:11:26,269 INFO L273 TraceCheckUtils]: 20: Hoare triple {358#false} assume !false; {358#false} is VALID [2018-11-23 12:11:26,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 12:11:26,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:11:26,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:11:26,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-23 12:11:26,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:26,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:11:26,370 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:26,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:11:26,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:11:26,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:11:26,371 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 5 states. [2018-11-23 12:11:26,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:26,617 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:11:26,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:11:26,617 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-23 12:11:26,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:26,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:11:26,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2018-11-23 12:11:26,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:11:26,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2018-11-23 12:11:26,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2018-11-23 12:11:26,704 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:26,707 INFO L225 Difference]: With dead ends: 34 [2018-11-23 12:11:26,707 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 12:11:26,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:11:26,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 12:11:26,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-23 12:11:26,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:26,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-23 12:11:26,742 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-23 12:11:26,742 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-23 12:11:26,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:26,745 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:11:26,745 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:11:26,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:26,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:26,746 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-23 12:11:26,746 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-23 12:11:26,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:26,751 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:11:26,751 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:11:26,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:26,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:26,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:26,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:26,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:11:26,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-23 12:11:26,757 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 21 [2018-11-23 12:11:26,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:26,757 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-23 12:11:26,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:11:26,758 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 12:11:26,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:11:26,759 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:26,759 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:26,760 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:26,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:26,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1534454659, now seen corresponding path program 1 times [2018-11-23 12:11:26,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:26,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:26,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:26,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:11:26,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:26,795 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:11:26,795 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:11:26,795 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:11:26,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:11:26,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:26,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:11:27,110 INFO L256 TraceCheckUtils]: 0: Hoare triple {521#true} call ULTIMATE.init(); {521#true} is VALID [2018-11-23 12:11:27,110 INFO L273 TraceCheckUtils]: 1: Hoare triple {521#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {521#true} is VALID [2018-11-23 12:11:27,111 INFO L273 TraceCheckUtils]: 2: Hoare triple {521#true} assume true; {521#true} is VALID [2018-11-23 12:11:27,111 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {521#true} {521#true} #74#return; {521#true} is VALID [2018-11-23 12:11:27,111 INFO L256 TraceCheckUtils]: 4: Hoare triple {521#true} call #t~ret11 := main(); {521#true} is VALID [2018-11-23 12:11:27,128 INFO L273 TraceCheckUtils]: 5: Hoare triple {521#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);havoc ~k~0;havoc ~i~0;~i~0 := 0; {541#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:27,144 INFO L273 TraceCheckUtils]: 6: Hoare triple {541#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {541#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:27,159 INFO L273 TraceCheckUtils]: 7: Hoare triple {541#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {548#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:27,168 INFO L273 TraceCheckUtils]: 8: Hoare triple {548#(<= main_~i~0 1)} assume !(~i~0 < 100000); {522#false} is VALID [2018-11-23 12:11:27,169 INFO L273 TraceCheckUtils]: 9: Hoare triple {522#false} ~i~0 := 0; {522#false} is VALID [2018-11-23 12:11:27,169 INFO L273 TraceCheckUtils]: 10: Hoare triple {522#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {522#false} is VALID [2018-11-23 12:11:27,172 INFO L273 TraceCheckUtils]: 11: Hoare triple {522#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {522#false} is VALID [2018-11-23 12:11:27,172 INFO L273 TraceCheckUtils]: 12: Hoare triple {522#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {522#false} is VALID [2018-11-23 12:11:27,173 INFO L273 TraceCheckUtils]: 13: Hoare triple {522#false} assume !(~i~0 < 100000); {522#false} is VALID [2018-11-23 12:11:27,173 INFO L273 TraceCheckUtils]: 14: Hoare triple {522#false} ~i~0 := 0; {522#false} is VALID [2018-11-23 12:11:27,173 INFO L273 TraceCheckUtils]: 15: Hoare triple {522#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem5 == #t~mem6; {522#false} is VALID [2018-11-23 12:11:27,174 INFO L273 TraceCheckUtils]: 16: Hoare triple {522#false} assume !#t~short10;call #t~mem9 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 == #t~mem7 * #t~mem8; {522#false} is VALID [2018-11-23 12:11:27,174 INFO L256 TraceCheckUtils]: 17: Hoare triple {522#false} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {522#false} is VALID [2018-11-23 12:11:27,174 INFO L273 TraceCheckUtils]: 18: Hoare triple {522#false} ~cond := #in~cond; {522#false} is VALID [2018-11-23 12:11:27,176 INFO L273 TraceCheckUtils]: 19: Hoare triple {522#false} assume 0 == ~cond; {522#false} is VALID [2018-11-23 12:11:27,176 INFO L273 TraceCheckUtils]: 20: Hoare triple {522#false} assume !false; {522#false} is VALID [2018-11-23 12:11:27,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:11:27,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:11:27,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-11-23 12:11:27,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-23 12:11:27,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:27,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:11:27,281 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:27,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:11:27,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:11:27,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:11:27,282 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 4 states. [2018-11-23 12:11:27,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:27,671 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2018-11-23 12:11:27,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:11:27,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-23 12:11:27,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:27,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:11:27,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2018-11-23 12:11:27,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:11:27,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2018-11-23 12:11:27,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 75 transitions. [2018-11-23 12:11:27,801 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:27,804 INFO L225 Difference]: With dead ends: 73 [2018-11-23 12:11:27,804 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 12:11:27,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:11:27,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 12:11:27,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2018-11-23 12:11:27,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:27,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 36 states. [2018-11-23 12:11:27,848 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 36 states. [2018-11-23 12:11:27,848 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 36 states. [2018-11-23 12:11:27,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:27,853 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2018-11-23 12:11:27,853 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2018-11-23 12:11:27,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:27,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:27,855 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 51 states. [2018-11-23 12:11:27,855 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 51 states. [2018-11-23 12:11:27,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:27,860 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2018-11-23 12:11:27,860 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2018-11-23 12:11:27,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:27,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:27,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:27,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:27,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:11:27,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-11-23 12:11:27,865 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 21 [2018-11-23 12:11:27,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:27,865 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-23 12:11:27,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:11:27,865 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-11-23 12:11:27,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:11:27,866 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:27,867 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:27,867 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:27,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:27,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1606017140, now seen corresponding path program 2 times [2018-11-23 12:11:27,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:27,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:27,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:27,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:11:27,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:27,886 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:11:27,886 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:11:27,886 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:11:27,904 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:11:27,934 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:11:27,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:11:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:27,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:11:28,076 INFO L256 TraceCheckUtils]: 0: Hoare triple {841#true} call ULTIMATE.init(); {841#true} is VALID [2018-11-23 12:11:28,077 INFO L273 TraceCheckUtils]: 1: Hoare triple {841#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {841#true} is VALID [2018-11-23 12:11:28,077 INFO L273 TraceCheckUtils]: 2: Hoare triple {841#true} assume true; {841#true} is VALID [2018-11-23 12:11:28,077 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {841#true} {841#true} #74#return; {841#true} is VALID [2018-11-23 12:11:28,078 INFO L256 TraceCheckUtils]: 4: Hoare triple {841#true} call #t~ret11 := main(); {841#true} is VALID [2018-11-23 12:11:28,087 INFO L273 TraceCheckUtils]: 5: Hoare triple {841#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);havoc ~k~0;havoc ~i~0;~i~0 := 0; {861#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:28,088 INFO L273 TraceCheckUtils]: 6: Hoare triple {861#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {861#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:28,088 INFO L273 TraceCheckUtils]: 7: Hoare triple {861#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {868#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:28,090 INFO L273 TraceCheckUtils]: 8: Hoare triple {868#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {868#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:28,090 INFO L273 TraceCheckUtils]: 9: Hoare triple {868#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {875#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:28,091 INFO L273 TraceCheckUtils]: 10: Hoare triple {875#(<= main_~i~0 2)} assume !(~i~0 < 100000); {842#false} is VALID [2018-11-23 12:11:28,091 INFO L273 TraceCheckUtils]: 11: Hoare triple {842#false} ~i~0 := 0; {842#false} is VALID [2018-11-23 12:11:28,092 INFO L273 TraceCheckUtils]: 12: Hoare triple {842#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {842#false} is VALID [2018-11-23 12:11:28,092 INFO L273 TraceCheckUtils]: 13: Hoare triple {842#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {842#false} is VALID [2018-11-23 12:11:28,093 INFO L273 TraceCheckUtils]: 14: Hoare triple {842#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {842#false} is VALID [2018-11-23 12:11:28,093 INFO L273 TraceCheckUtils]: 15: Hoare triple {842#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {842#false} is VALID [2018-11-23 12:11:28,094 INFO L273 TraceCheckUtils]: 16: Hoare triple {842#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {842#false} is VALID [2018-11-23 12:11:28,094 INFO L273 TraceCheckUtils]: 17: Hoare triple {842#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {842#false} is VALID [2018-11-23 12:11:28,094 INFO L273 TraceCheckUtils]: 18: Hoare triple {842#false} assume !(~i~0 < 100000); {842#false} is VALID [2018-11-23 12:11:28,095 INFO L273 TraceCheckUtils]: 19: Hoare triple {842#false} ~i~0 := 0; {842#false} is VALID [2018-11-23 12:11:28,095 INFO L273 TraceCheckUtils]: 20: Hoare triple {842#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem5 == #t~mem6; {842#false} is VALID [2018-11-23 12:11:28,095 INFO L273 TraceCheckUtils]: 21: Hoare triple {842#false} assume !#t~short10;call #t~mem9 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 == #t~mem7 * #t~mem8; {842#false} is VALID [2018-11-23 12:11:28,096 INFO L256 TraceCheckUtils]: 22: Hoare triple {842#false} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {842#false} is VALID [2018-11-23 12:11:28,096 INFO L273 TraceCheckUtils]: 23: Hoare triple {842#false} ~cond := #in~cond; {842#false} is VALID [2018-11-23 12:11:28,096 INFO L273 TraceCheckUtils]: 24: Hoare triple {842#false} assume 0 == ~cond; {842#false} is VALID [2018-11-23 12:11:28,096 INFO L273 TraceCheckUtils]: 25: Hoare triple {842#false} assume !false; {842#false} is VALID [2018-11-23 12:11:28,098 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 12:11:28,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:11:28,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 12:11:28,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-23 12:11:28,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:28,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:11:28,158 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:28,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:11:28,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:11:28,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:11:28,159 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 5 states. [2018-11-23 12:11:28,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:28,450 INFO L93 Difference]: Finished difference Result 87 states and 109 transitions. [2018-11-23 12:11:28,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:11:28,451 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-23 12:11:28,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:28,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:11:28,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2018-11-23 12:11:28,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:11:28,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2018-11-23 12:11:28,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 88 transitions. [2018-11-23 12:11:28,640 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:28,644 INFO L225 Difference]: With dead ends: 87 [2018-11-23 12:11:28,645 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 12:11:28,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:11:28,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 12:11:28,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 41. [2018-11-23 12:11:28,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:28,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 41 states. [2018-11-23 12:11:28,719 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 41 states. [2018-11-23 12:11:28,720 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 41 states. [2018-11-23 12:11:28,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:28,724 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2018-11-23 12:11:28,725 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2018-11-23 12:11:28,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:28,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:28,726 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 62 states. [2018-11-23 12:11:28,726 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 62 states. [2018-11-23 12:11:28,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:28,731 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2018-11-23 12:11:28,731 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2018-11-23 12:11:28,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:28,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:28,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:28,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:28,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:11:28,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-11-23 12:11:28,735 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 26 [2018-11-23 12:11:28,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:28,736 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-23 12:11:28,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:11:28,736 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-23 12:11:28,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:11:28,737 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:28,737 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:28,738 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:28,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:28,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1732161177, now seen corresponding path program 3 times [2018-11-23 12:11:28,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:28,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:28,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:28,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:11:28,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:28,758 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:11:28,758 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:11:28,758 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:11:28,781 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:11:28,813 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:11:28,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:11:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:28,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:11:28,953 INFO L256 TraceCheckUtils]: 0: Hoare triple {1226#true} call ULTIMATE.init(); {1226#true} is VALID [2018-11-23 12:11:28,954 INFO L273 TraceCheckUtils]: 1: Hoare triple {1226#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1226#true} is VALID [2018-11-23 12:11:28,955 INFO L273 TraceCheckUtils]: 2: Hoare triple {1226#true} assume true; {1226#true} is VALID [2018-11-23 12:11:28,955 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1226#true} {1226#true} #74#return; {1226#true} is VALID [2018-11-23 12:11:28,955 INFO L256 TraceCheckUtils]: 4: Hoare triple {1226#true} call #t~ret11 := main(); {1226#true} is VALID [2018-11-23 12:11:28,956 INFO L273 TraceCheckUtils]: 5: Hoare triple {1226#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);havoc ~k~0;havoc ~i~0;~i~0 := 0; {1226#true} is VALID [2018-11-23 12:11:28,956 INFO L273 TraceCheckUtils]: 6: Hoare triple {1226#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1226#true} is VALID [2018-11-23 12:11:28,956 INFO L273 TraceCheckUtils]: 7: Hoare triple {1226#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1226#true} is VALID [2018-11-23 12:11:28,957 INFO L273 TraceCheckUtils]: 8: Hoare triple {1226#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1226#true} is VALID [2018-11-23 12:11:28,957 INFO L273 TraceCheckUtils]: 9: Hoare triple {1226#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1226#true} is VALID [2018-11-23 12:11:28,957 INFO L273 TraceCheckUtils]: 10: Hoare triple {1226#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1226#true} is VALID [2018-11-23 12:11:28,958 INFO L273 TraceCheckUtils]: 11: Hoare triple {1226#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1226#true} is VALID [2018-11-23 12:11:28,958 INFO L273 TraceCheckUtils]: 12: Hoare triple {1226#true} assume !(~i~0 < 100000); {1226#true} is VALID [2018-11-23 12:11:28,963 INFO L273 TraceCheckUtils]: 13: Hoare triple {1226#true} ~i~0 := 0; {1270#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:28,964 INFO L273 TraceCheckUtils]: 14: Hoare triple {1270#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {1270#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:28,964 INFO L273 TraceCheckUtils]: 15: Hoare triple {1270#(<= main_~i~0 0)} assume !(0 != #t~nondet2);havoc #t~nondet2; {1270#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:28,966 INFO L273 TraceCheckUtils]: 16: Hoare triple {1270#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1280#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:28,966 INFO L273 TraceCheckUtils]: 17: Hoare triple {1280#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {1280#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:28,968 INFO L273 TraceCheckUtils]: 18: Hoare triple {1280#(<= main_~i~0 1)} assume !(0 != #t~nondet2);havoc #t~nondet2; {1280#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:28,969 INFO L273 TraceCheckUtils]: 19: Hoare triple {1280#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1290#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:28,970 INFO L273 TraceCheckUtils]: 20: Hoare triple {1290#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {1290#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:28,984 INFO L273 TraceCheckUtils]: 21: Hoare triple {1290#(<= main_~i~0 2)} assume !(0 != #t~nondet2);havoc #t~nondet2; {1290#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:28,986 INFO L273 TraceCheckUtils]: 22: Hoare triple {1290#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1300#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:28,988 INFO L273 TraceCheckUtils]: 23: Hoare triple {1300#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1227#false} is VALID [2018-11-23 12:11:28,988 INFO L273 TraceCheckUtils]: 24: Hoare triple {1227#false} ~i~0 := 0; {1227#false} is VALID [2018-11-23 12:11:28,988 INFO L273 TraceCheckUtils]: 25: Hoare triple {1227#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem5 == #t~mem6; {1227#false} is VALID [2018-11-23 12:11:28,989 INFO L273 TraceCheckUtils]: 26: Hoare triple {1227#false} assume !#t~short10;call #t~mem9 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 == #t~mem7 * #t~mem8; {1227#false} is VALID [2018-11-23 12:11:28,989 INFO L256 TraceCheckUtils]: 27: Hoare triple {1227#false} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {1227#false} is VALID [2018-11-23 12:11:28,989 INFO L273 TraceCheckUtils]: 28: Hoare triple {1227#false} ~cond := #in~cond; {1227#false} is VALID [2018-11-23 12:11:28,990 INFO L273 TraceCheckUtils]: 29: Hoare triple {1227#false} assume 0 == ~cond; {1227#false} is VALID [2018-11-23 12:11:28,990 INFO L273 TraceCheckUtils]: 30: Hoare triple {1227#false} assume !false; {1227#false} is VALID [2018-11-23 12:11:28,991 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 12:11:29,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:11:29,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-23 12:11:29,014 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-23 12:11:29,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:29,014 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:11:29,057 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:29,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:11:29,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:11:29,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:11:29,059 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 6 states. [2018-11-23 12:11:29,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:29,424 INFO L93 Difference]: Finished difference Result 101 states and 128 transitions. [2018-11-23 12:11:29,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:11:29,425 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-23 12:11:29,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:29,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:11:29,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2018-11-23 12:11:29,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:11:29,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2018-11-23 12:11:29,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 101 transitions. [2018-11-23 12:11:29,569 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:29,573 INFO L225 Difference]: With dead ends: 101 [2018-11-23 12:11:29,573 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 12:11:29,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:11:29,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 12:11:29,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 46. [2018-11-23 12:11:29,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:29,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 46 states. [2018-11-23 12:11:29,621 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 46 states. [2018-11-23 12:11:29,621 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 46 states. [2018-11-23 12:11:29,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:29,626 INFO L93 Difference]: Finished difference Result 73 states and 93 transitions. [2018-11-23 12:11:29,626 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2018-11-23 12:11:29,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:29,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:29,627 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 73 states. [2018-11-23 12:11:29,627 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 73 states. [2018-11-23 12:11:29,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:29,632 INFO L93 Difference]: Finished difference Result 73 states and 93 transitions. [2018-11-23 12:11:29,633 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2018-11-23 12:11:29,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:29,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:29,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:29,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:29,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:11:29,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-11-23 12:11:29,636 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 31 [2018-11-23 12:11:29,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:29,637 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-11-23 12:11:29,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:11:29,637 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-11-23 12:11:29,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 12:11:29,638 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:29,638 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:29,639 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:29,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:29,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1392382608, now seen corresponding path program 4 times [2018-11-23 12:11:29,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:29,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:29,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:29,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:11:29,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:29,660 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:11:29,661 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:11:29,661 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:11:29,677 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:11:29,701 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:11:29,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:11:29,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:29,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:11:29,913 INFO L256 TraceCheckUtils]: 0: Hoare triple {1676#true} call ULTIMATE.init(); {1676#true} is VALID [2018-11-23 12:11:29,914 INFO L273 TraceCheckUtils]: 1: Hoare triple {1676#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1676#true} is VALID [2018-11-23 12:11:29,914 INFO L273 TraceCheckUtils]: 2: Hoare triple {1676#true} assume true; {1676#true} is VALID [2018-11-23 12:11:29,914 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1676#true} {1676#true} #74#return; {1676#true} is VALID [2018-11-23 12:11:29,915 INFO L256 TraceCheckUtils]: 4: Hoare triple {1676#true} call #t~ret11 := main(); {1676#true} is VALID [2018-11-23 12:11:29,916 INFO L273 TraceCheckUtils]: 5: Hoare triple {1676#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);havoc ~k~0;havoc ~i~0;~i~0 := 0; {1696#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:29,917 INFO L273 TraceCheckUtils]: 6: Hoare triple {1696#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1696#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:29,917 INFO L273 TraceCheckUtils]: 7: Hoare triple {1696#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1703#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:29,918 INFO L273 TraceCheckUtils]: 8: Hoare triple {1703#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1703#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:29,918 INFO L273 TraceCheckUtils]: 9: Hoare triple {1703#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1710#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:29,919 INFO L273 TraceCheckUtils]: 10: Hoare triple {1710#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1710#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:29,920 INFO L273 TraceCheckUtils]: 11: Hoare triple {1710#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1717#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:29,921 INFO L273 TraceCheckUtils]: 12: Hoare triple {1717#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1717#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:29,922 INFO L273 TraceCheckUtils]: 13: Hoare triple {1717#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1724#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:29,923 INFO L273 TraceCheckUtils]: 14: Hoare triple {1724#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1677#false} is VALID [2018-11-23 12:11:29,924 INFO L273 TraceCheckUtils]: 15: Hoare triple {1677#false} ~i~0 := 0; {1677#false} is VALID [2018-11-23 12:11:29,924 INFO L273 TraceCheckUtils]: 16: Hoare triple {1677#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {1677#false} is VALID [2018-11-23 12:11:29,924 INFO L273 TraceCheckUtils]: 17: Hoare triple {1677#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {1677#false} is VALID [2018-11-23 12:11:29,925 INFO L273 TraceCheckUtils]: 18: Hoare triple {1677#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1677#false} is VALID [2018-11-23 12:11:29,925 INFO L273 TraceCheckUtils]: 19: Hoare triple {1677#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {1677#false} is VALID [2018-11-23 12:11:29,925 INFO L273 TraceCheckUtils]: 20: Hoare triple {1677#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {1677#false} is VALID [2018-11-23 12:11:29,926 INFO L273 TraceCheckUtils]: 21: Hoare triple {1677#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1677#false} is VALID [2018-11-23 12:11:29,926 INFO L273 TraceCheckUtils]: 22: Hoare triple {1677#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {1677#false} is VALID [2018-11-23 12:11:29,926 INFO L273 TraceCheckUtils]: 23: Hoare triple {1677#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {1677#false} is VALID [2018-11-23 12:11:29,927 INFO L273 TraceCheckUtils]: 24: Hoare triple {1677#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1677#false} is VALID [2018-11-23 12:11:29,927 INFO L273 TraceCheckUtils]: 25: Hoare triple {1677#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {1677#false} is VALID [2018-11-23 12:11:29,927 INFO L273 TraceCheckUtils]: 26: Hoare triple {1677#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {1677#false} is VALID [2018-11-23 12:11:29,928 INFO L273 TraceCheckUtils]: 27: Hoare triple {1677#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1677#false} is VALID [2018-11-23 12:11:29,928 INFO L273 TraceCheckUtils]: 28: Hoare triple {1677#false} assume !(~i~0 < 100000); {1677#false} is VALID [2018-11-23 12:11:29,928 INFO L273 TraceCheckUtils]: 29: Hoare triple {1677#false} ~i~0 := 0; {1677#false} is VALID [2018-11-23 12:11:29,928 INFO L273 TraceCheckUtils]: 30: Hoare triple {1677#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem5 == #t~mem6; {1677#false} is VALID [2018-11-23 12:11:29,929 INFO L273 TraceCheckUtils]: 31: Hoare triple {1677#false} assume !#t~short10;call #t~mem9 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 == #t~mem7 * #t~mem8; {1677#false} is VALID [2018-11-23 12:11:29,929 INFO L256 TraceCheckUtils]: 32: Hoare triple {1677#false} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {1677#false} is VALID [2018-11-23 12:11:29,929 INFO L273 TraceCheckUtils]: 33: Hoare triple {1677#false} ~cond := #in~cond; {1677#false} is VALID [2018-11-23 12:11:29,929 INFO L273 TraceCheckUtils]: 34: Hoare triple {1677#false} assume 0 == ~cond; {1677#false} is VALID [2018-11-23 12:11:29,929 INFO L273 TraceCheckUtils]: 35: Hoare triple {1677#false} assume !false; {1677#false} is VALID [2018-11-23 12:11:29,932 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-23 12:11:29,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:11:29,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-23 12:11:29,961 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-11-23 12:11:29,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:29,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:11:30,108 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:30,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:11:30,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:11:30,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:11:30,110 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 7 states. [2018-11-23 12:11:30,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:30,833 INFO L93 Difference]: Finished difference Result 115 states and 147 transitions. [2018-11-23 12:11:30,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:11:30,833 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-11-23 12:11:30,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:30,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:11:30,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2018-11-23 12:11:30,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:11:30,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2018-11-23 12:11:30,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 114 transitions. [2018-11-23 12:11:31,004 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:31,007 INFO L225 Difference]: With dead ends: 115 [2018-11-23 12:11:31,008 INFO L226 Difference]: Without dead ends: 84 [2018-11-23 12:11:31,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:11:31,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-23 12:11:31,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 51. [2018-11-23 12:11:31,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:31,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 51 states. [2018-11-23 12:11:31,052 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 51 states. [2018-11-23 12:11:31,053 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 51 states. [2018-11-23 12:11:31,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:31,058 INFO L93 Difference]: Finished difference Result 84 states and 108 transitions. [2018-11-23 12:11:31,058 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 108 transitions. [2018-11-23 12:11:31,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:31,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:31,059 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 84 states. [2018-11-23 12:11:31,059 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 84 states. [2018-11-23 12:11:31,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:31,064 INFO L93 Difference]: Finished difference Result 84 states and 108 transitions. [2018-11-23 12:11:31,064 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 108 transitions. [2018-11-23 12:11:31,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:31,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:31,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:31,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:31,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:11:31,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2018-11-23 12:11:31,068 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 36 [2018-11-23 12:11:31,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:31,068 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2018-11-23 12:11:31,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:11:31,068 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-11-23 12:11:31,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 12:11:31,069 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:31,070 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:31,070 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:31,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:31,070 INFO L82 PathProgramCache]: Analyzing trace with hash 267511989, now seen corresponding path program 5 times [2018-11-23 12:11:31,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:31,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:31,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:31,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:11:31,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:31,093 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:11:31,093 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:11:31,093 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:11:31,113 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:11:31,178 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 12:11:31,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:11:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:31,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:11:31,738 INFO L256 TraceCheckUtils]: 0: Hoare triple {2191#true} call ULTIMATE.init(); {2191#true} is VALID [2018-11-23 12:11:31,738 INFO L273 TraceCheckUtils]: 1: Hoare triple {2191#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2191#true} is VALID [2018-11-23 12:11:31,739 INFO L273 TraceCheckUtils]: 2: Hoare triple {2191#true} assume true; {2191#true} is VALID [2018-11-23 12:11:31,739 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2191#true} {2191#true} #74#return; {2191#true} is VALID [2018-11-23 12:11:31,739 INFO L256 TraceCheckUtils]: 4: Hoare triple {2191#true} call #t~ret11 := main(); {2191#true} is VALID [2018-11-23 12:11:31,740 INFO L273 TraceCheckUtils]: 5: Hoare triple {2191#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);havoc ~k~0;havoc ~i~0;~i~0 := 0; {2191#true} is VALID [2018-11-23 12:11:31,740 INFO L273 TraceCheckUtils]: 6: Hoare triple {2191#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2191#true} is VALID [2018-11-23 12:11:31,740 INFO L273 TraceCheckUtils]: 7: Hoare triple {2191#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2191#true} is VALID [2018-11-23 12:11:31,740 INFO L273 TraceCheckUtils]: 8: Hoare triple {2191#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2191#true} is VALID [2018-11-23 12:11:31,741 INFO L273 TraceCheckUtils]: 9: Hoare triple {2191#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2191#true} is VALID [2018-11-23 12:11:31,741 INFO L273 TraceCheckUtils]: 10: Hoare triple {2191#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2191#true} is VALID [2018-11-23 12:11:31,741 INFO L273 TraceCheckUtils]: 11: Hoare triple {2191#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2191#true} is VALID [2018-11-23 12:11:31,741 INFO L273 TraceCheckUtils]: 12: Hoare triple {2191#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2191#true} is VALID [2018-11-23 12:11:31,741 INFO L273 TraceCheckUtils]: 13: Hoare triple {2191#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2191#true} is VALID [2018-11-23 12:11:31,742 INFO L273 TraceCheckUtils]: 14: Hoare triple {2191#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2191#true} is VALID [2018-11-23 12:11:31,742 INFO L273 TraceCheckUtils]: 15: Hoare triple {2191#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2191#true} is VALID [2018-11-23 12:11:31,742 INFO L273 TraceCheckUtils]: 16: Hoare triple {2191#true} assume !(~i~0 < 100000); {2191#true} is VALID [2018-11-23 12:11:31,743 INFO L273 TraceCheckUtils]: 17: Hoare triple {2191#true} ~i~0 := 0; {2247#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:31,744 INFO L273 TraceCheckUtils]: 18: Hoare triple {2247#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {2247#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:31,756 INFO L273 TraceCheckUtils]: 19: Hoare triple {2247#(<= main_~i~0 0)} assume !(0 != #t~nondet2);havoc #t~nondet2; {2247#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:31,757 INFO L273 TraceCheckUtils]: 20: Hoare triple {2247#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2257#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:31,758 INFO L273 TraceCheckUtils]: 21: Hoare triple {2257#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {2257#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:31,758 INFO L273 TraceCheckUtils]: 22: Hoare triple {2257#(<= main_~i~0 1)} assume !(0 != #t~nondet2);havoc #t~nondet2; {2257#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:31,759 INFO L273 TraceCheckUtils]: 23: Hoare triple {2257#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2267#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:31,759 INFO L273 TraceCheckUtils]: 24: Hoare triple {2267#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {2267#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:31,765 INFO L273 TraceCheckUtils]: 25: Hoare triple {2267#(<= main_~i~0 2)} assume !(0 != #t~nondet2);havoc #t~nondet2; {2267#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:31,766 INFO L273 TraceCheckUtils]: 26: Hoare triple {2267#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2277#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:31,767 INFO L273 TraceCheckUtils]: 27: Hoare triple {2277#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {2277#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:31,767 INFO L273 TraceCheckUtils]: 28: Hoare triple {2277#(<= main_~i~0 3)} assume !(0 != #t~nondet2);havoc #t~nondet2; {2277#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:31,784 INFO L273 TraceCheckUtils]: 29: Hoare triple {2277#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2287#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:31,798 INFO L273 TraceCheckUtils]: 30: Hoare triple {2287#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {2287#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:31,814 INFO L273 TraceCheckUtils]: 31: Hoare triple {2287#(<= main_~i~0 4)} assume !(0 != #t~nondet2);havoc #t~nondet2; {2287#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:31,825 INFO L273 TraceCheckUtils]: 32: Hoare triple {2287#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2297#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:31,826 INFO L273 TraceCheckUtils]: 33: Hoare triple {2297#(<= main_~i~0 5)} assume !(~i~0 < 100000); {2192#false} is VALID [2018-11-23 12:11:31,826 INFO L273 TraceCheckUtils]: 34: Hoare triple {2192#false} ~i~0 := 0; {2192#false} is VALID [2018-11-23 12:11:31,826 INFO L273 TraceCheckUtils]: 35: Hoare triple {2192#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem5 == #t~mem6; {2192#false} is VALID [2018-11-23 12:11:31,827 INFO L273 TraceCheckUtils]: 36: Hoare triple {2192#false} assume !#t~short10;call #t~mem9 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 == #t~mem7 * #t~mem8; {2192#false} is VALID [2018-11-23 12:11:31,827 INFO L256 TraceCheckUtils]: 37: Hoare triple {2192#false} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {2192#false} is VALID [2018-11-23 12:11:31,827 INFO L273 TraceCheckUtils]: 38: Hoare triple {2192#false} ~cond := #in~cond; {2192#false} is VALID [2018-11-23 12:11:31,827 INFO L273 TraceCheckUtils]: 39: Hoare triple {2192#false} assume 0 == ~cond; {2192#false} is VALID [2018-11-23 12:11:31,827 INFO L273 TraceCheckUtils]: 40: Hoare triple {2192#false} assume !false; {2192#false} is VALID [2018-11-23 12:11:31,833 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 12:11:31,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:11:31,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-23 12:11:31,855 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-11-23 12:11:31,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:31,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:11:31,902 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:31,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:11:31,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:11:31,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:11:31,904 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 8 states. [2018-11-23 12:11:32,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:32,592 INFO L93 Difference]: Finished difference Result 129 states and 166 transitions. [2018-11-23 12:11:32,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:11:32,593 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-11-23 12:11:32,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:32,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:11:32,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2018-11-23 12:11:32,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:11:32,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2018-11-23 12:11:32,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 127 transitions. [2018-11-23 12:11:32,745 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-23 12:11:32,747 INFO L225 Difference]: With dead ends: 129 [2018-11-23 12:11:32,748 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 12:11:32,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:11:32,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 12:11:32,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 56. [2018-11-23 12:11:32,815 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:32,815 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 56 states. [2018-11-23 12:11:32,815 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 56 states. [2018-11-23 12:11:32,815 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 56 states. [2018-11-23 12:11:32,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:32,821 INFO L93 Difference]: Finished difference Result 95 states and 123 transitions. [2018-11-23 12:11:32,821 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions. [2018-11-23 12:11:32,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:32,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:32,822 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 95 states. [2018-11-23 12:11:32,823 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 95 states. [2018-11-23 12:11:32,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:32,827 INFO L93 Difference]: Finished difference Result 95 states and 123 transitions. [2018-11-23 12:11:32,827 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions. [2018-11-23 12:11:32,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:32,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:32,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:32,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:32,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 12:11:32,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2018-11-23 12:11:32,830 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 41 [2018-11-23 12:11:32,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:32,831 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2018-11-23 12:11:32,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:11:32,831 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2018-11-23 12:11:32,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 12:11:32,832 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:32,832 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:32,833 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:32,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:32,833 INFO L82 PathProgramCache]: Analyzing trace with hash 2052078420, now seen corresponding path program 6 times [2018-11-23 12:11:32,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:32,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:32,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:32,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:11:32,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:32,855 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:11:32,855 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:11:32,855 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:11:32,880 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:11:32,950 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 12:11:32,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:11:32,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:32,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:11:33,276 INFO L256 TraceCheckUtils]: 0: Hoare triple {2771#true} call ULTIMATE.init(); {2771#true} is VALID [2018-11-23 12:11:33,277 INFO L273 TraceCheckUtils]: 1: Hoare triple {2771#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2771#true} is VALID [2018-11-23 12:11:33,277 INFO L273 TraceCheckUtils]: 2: Hoare triple {2771#true} assume true; {2771#true} is VALID [2018-11-23 12:11:33,277 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2771#true} {2771#true} #74#return; {2771#true} is VALID [2018-11-23 12:11:33,278 INFO L256 TraceCheckUtils]: 4: Hoare triple {2771#true} call #t~ret11 := main(); {2771#true} is VALID [2018-11-23 12:11:33,278 INFO L273 TraceCheckUtils]: 5: Hoare triple {2771#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);havoc ~k~0;havoc ~i~0;~i~0 := 0; {2771#true} is VALID [2018-11-23 12:11:33,278 INFO L273 TraceCheckUtils]: 6: Hoare triple {2771#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2771#true} is VALID [2018-11-23 12:11:33,279 INFO L273 TraceCheckUtils]: 7: Hoare triple {2771#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2771#true} is VALID [2018-11-23 12:11:33,279 INFO L273 TraceCheckUtils]: 8: Hoare triple {2771#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2771#true} is VALID [2018-11-23 12:11:33,279 INFO L273 TraceCheckUtils]: 9: Hoare triple {2771#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2771#true} is VALID [2018-11-23 12:11:33,279 INFO L273 TraceCheckUtils]: 10: Hoare triple {2771#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2771#true} is VALID [2018-11-23 12:11:33,279 INFO L273 TraceCheckUtils]: 11: Hoare triple {2771#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2771#true} is VALID [2018-11-23 12:11:33,279 INFO L273 TraceCheckUtils]: 12: Hoare triple {2771#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2771#true} is VALID [2018-11-23 12:11:33,280 INFO L273 TraceCheckUtils]: 13: Hoare triple {2771#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2771#true} is VALID [2018-11-23 12:11:33,280 INFO L273 TraceCheckUtils]: 14: Hoare triple {2771#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2771#true} is VALID [2018-11-23 12:11:33,280 INFO L273 TraceCheckUtils]: 15: Hoare triple {2771#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2771#true} is VALID [2018-11-23 12:11:33,280 INFO L273 TraceCheckUtils]: 16: Hoare triple {2771#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2771#true} is VALID [2018-11-23 12:11:33,280 INFO L273 TraceCheckUtils]: 17: Hoare triple {2771#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2771#true} is VALID [2018-11-23 12:11:33,281 INFO L273 TraceCheckUtils]: 18: Hoare triple {2771#true} assume !(~i~0 < 100000); {2771#true} is VALID [2018-11-23 12:11:33,281 INFO L273 TraceCheckUtils]: 19: Hoare triple {2771#true} ~i~0 := 0; {2833#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:33,284 INFO L273 TraceCheckUtils]: 20: Hoare triple {2833#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {2833#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:33,302 INFO L273 TraceCheckUtils]: 21: Hoare triple {2833#(<= main_~i~0 0)} assume !(0 != #t~nondet2);havoc #t~nondet2; {2833#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:33,316 INFO L273 TraceCheckUtils]: 22: Hoare triple {2833#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2843#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:33,330 INFO L273 TraceCheckUtils]: 23: Hoare triple {2843#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {2843#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:33,339 INFO L273 TraceCheckUtils]: 24: Hoare triple {2843#(<= main_~i~0 1)} assume !(0 != #t~nondet2);havoc #t~nondet2; {2843#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:33,349 INFO L273 TraceCheckUtils]: 25: Hoare triple {2843#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2853#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:33,363 INFO L273 TraceCheckUtils]: 26: Hoare triple {2853#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {2853#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:33,377 INFO L273 TraceCheckUtils]: 27: Hoare triple {2853#(<= main_~i~0 2)} assume !(0 != #t~nondet2);havoc #t~nondet2; {2853#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:33,386 INFO L273 TraceCheckUtils]: 28: Hoare triple {2853#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2863#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:33,402 INFO L273 TraceCheckUtils]: 29: Hoare triple {2863#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {2863#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:33,411 INFO L273 TraceCheckUtils]: 30: Hoare triple {2863#(<= main_~i~0 3)} assume !(0 != #t~nondet2);havoc #t~nondet2; {2863#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:33,424 INFO L273 TraceCheckUtils]: 31: Hoare triple {2863#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2873#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:33,438 INFO L273 TraceCheckUtils]: 32: Hoare triple {2873#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {2873#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:33,447 INFO L273 TraceCheckUtils]: 33: Hoare triple {2873#(<= main_~i~0 4)} assume !(0 != #t~nondet2);havoc #t~nondet2; {2873#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:33,461 INFO L273 TraceCheckUtils]: 34: Hoare triple {2873#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2883#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:33,470 INFO L273 TraceCheckUtils]: 35: Hoare triple {2883#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {2883#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:33,483 INFO L273 TraceCheckUtils]: 36: Hoare triple {2883#(<= main_~i~0 5)} assume !(0 != #t~nondet2);havoc #t~nondet2; {2883#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:33,484 INFO L273 TraceCheckUtils]: 37: Hoare triple {2883#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2893#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:33,489 INFO L273 TraceCheckUtils]: 38: Hoare triple {2893#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2772#false} is VALID [2018-11-23 12:11:33,489 INFO L273 TraceCheckUtils]: 39: Hoare triple {2772#false} ~i~0 := 0; {2772#false} is VALID [2018-11-23 12:11:33,489 INFO L273 TraceCheckUtils]: 40: Hoare triple {2772#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem5 == #t~mem6; {2772#false} is VALID [2018-11-23 12:11:33,489 INFO L273 TraceCheckUtils]: 41: Hoare triple {2772#false} assume !#t~short10;call #t~mem9 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 == #t~mem7 * #t~mem8; {2772#false} is VALID [2018-11-23 12:11:33,489 INFO L256 TraceCheckUtils]: 42: Hoare triple {2772#false} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {2772#false} is VALID [2018-11-23 12:11:33,490 INFO L273 TraceCheckUtils]: 43: Hoare triple {2772#false} ~cond := #in~cond; {2772#false} is VALID [2018-11-23 12:11:33,490 INFO L273 TraceCheckUtils]: 44: Hoare triple {2772#false} assume 0 == ~cond; {2772#false} is VALID [2018-11-23 12:11:33,490 INFO L273 TraceCheckUtils]: 45: Hoare triple {2772#false} assume !false; {2772#false} is VALID [2018-11-23 12:11:33,493 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 12:11:33,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:11:33,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-11-23 12:11:33,524 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2018-11-23 12:11:33,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:33,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:11:33,565 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:33,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:11:33,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:11:33,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:11:33,566 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand 9 states. [2018-11-23 12:11:34,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:34,207 INFO L93 Difference]: Finished difference Result 143 states and 185 transitions. [2018-11-23 12:11:34,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:11:34,208 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2018-11-23 12:11:34,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:34,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:11:34,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2018-11-23 12:11:34,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:11:34,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2018-11-23 12:11:34,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 140 transitions. [2018-11-23 12:11:34,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:34,390 INFO L225 Difference]: With dead ends: 143 [2018-11-23 12:11:34,391 INFO L226 Difference]: Without dead ends: 106 [2018-11-23 12:11:34,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:11:34,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-23 12:11:34,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 61. [2018-11-23 12:11:34,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:34,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 61 states. [2018-11-23 12:11:34,469 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 61 states. [2018-11-23 12:11:34,469 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 61 states. [2018-11-23 12:11:34,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:34,474 INFO L93 Difference]: Finished difference Result 106 states and 138 transitions. [2018-11-23 12:11:34,474 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 138 transitions. [2018-11-23 12:11:34,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:34,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:34,475 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 106 states. [2018-11-23 12:11:34,475 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 106 states. [2018-11-23 12:11:34,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:34,480 INFO L93 Difference]: Finished difference Result 106 states and 138 transitions. [2018-11-23 12:11:34,480 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 138 transitions. [2018-11-23 12:11:34,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:34,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:34,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:34,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:34,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 12:11:34,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2018-11-23 12:11:34,484 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 46 [2018-11-23 12:11:34,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:34,484 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2018-11-23 12:11:34,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:11:34,484 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2018-11-23 12:11:34,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 12:11:34,485 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:34,486 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:34,486 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:34,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:34,486 INFO L82 PathProgramCache]: Analyzing trace with hash -90078511, now seen corresponding path program 7 times [2018-11-23 12:11:34,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:34,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:34,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:34,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:11:34,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:34,508 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:11:34,508 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:11:34,509 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:11:34,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:11:34,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:34,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:11:34,797 INFO L256 TraceCheckUtils]: 0: Hoare triple {3416#true} call ULTIMATE.init(); {3416#true} is VALID [2018-11-23 12:11:34,797 INFO L273 TraceCheckUtils]: 1: Hoare triple {3416#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3416#true} is VALID [2018-11-23 12:11:34,798 INFO L273 TraceCheckUtils]: 2: Hoare triple {3416#true} assume true; {3416#true} is VALID [2018-11-23 12:11:34,798 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3416#true} {3416#true} #74#return; {3416#true} is VALID [2018-11-23 12:11:34,798 INFO L256 TraceCheckUtils]: 4: Hoare triple {3416#true} call #t~ret11 := main(); {3416#true} is VALID [2018-11-23 12:11:34,802 INFO L273 TraceCheckUtils]: 5: Hoare triple {3416#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);havoc ~k~0;havoc ~i~0;~i~0 := 0; {3436#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:34,803 INFO L273 TraceCheckUtils]: 6: Hoare triple {3436#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3436#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:34,803 INFO L273 TraceCheckUtils]: 7: Hoare triple {3436#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3443#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:34,803 INFO L273 TraceCheckUtils]: 8: Hoare triple {3443#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3443#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:34,804 INFO L273 TraceCheckUtils]: 9: Hoare triple {3443#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3450#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:34,804 INFO L273 TraceCheckUtils]: 10: Hoare triple {3450#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3450#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:34,805 INFO L273 TraceCheckUtils]: 11: Hoare triple {3450#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3457#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:34,805 INFO L273 TraceCheckUtils]: 12: Hoare triple {3457#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3457#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:34,806 INFO L273 TraceCheckUtils]: 13: Hoare triple {3457#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3464#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:34,806 INFO L273 TraceCheckUtils]: 14: Hoare triple {3464#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3464#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:34,807 INFO L273 TraceCheckUtils]: 15: Hoare triple {3464#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3471#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:34,807 INFO L273 TraceCheckUtils]: 16: Hoare triple {3471#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3471#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:34,808 INFO L273 TraceCheckUtils]: 17: Hoare triple {3471#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3478#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:34,808 INFO L273 TraceCheckUtils]: 18: Hoare triple {3478#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {3478#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:34,809 INFO L273 TraceCheckUtils]: 19: Hoare triple {3478#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3485#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:34,810 INFO L273 TraceCheckUtils]: 20: Hoare triple {3485#(<= main_~i~0 7)} assume !(~i~0 < 100000); {3417#false} is VALID [2018-11-23 12:11:34,810 INFO L273 TraceCheckUtils]: 21: Hoare triple {3417#false} ~i~0 := 0; {3417#false} is VALID [2018-11-23 12:11:34,811 INFO L273 TraceCheckUtils]: 22: Hoare triple {3417#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {3417#false} is VALID [2018-11-23 12:11:34,811 INFO L273 TraceCheckUtils]: 23: Hoare triple {3417#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {3417#false} is VALID [2018-11-23 12:11:34,811 INFO L273 TraceCheckUtils]: 24: Hoare triple {3417#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3417#false} is VALID [2018-11-23 12:11:34,811 INFO L273 TraceCheckUtils]: 25: Hoare triple {3417#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {3417#false} is VALID [2018-11-23 12:11:34,812 INFO L273 TraceCheckUtils]: 26: Hoare triple {3417#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {3417#false} is VALID [2018-11-23 12:11:34,812 INFO L273 TraceCheckUtils]: 27: Hoare triple {3417#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3417#false} is VALID [2018-11-23 12:11:34,812 INFO L273 TraceCheckUtils]: 28: Hoare triple {3417#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {3417#false} is VALID [2018-11-23 12:11:34,813 INFO L273 TraceCheckUtils]: 29: Hoare triple {3417#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {3417#false} is VALID [2018-11-23 12:11:34,813 INFO L273 TraceCheckUtils]: 30: Hoare triple {3417#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3417#false} is VALID [2018-11-23 12:11:34,813 INFO L273 TraceCheckUtils]: 31: Hoare triple {3417#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {3417#false} is VALID [2018-11-23 12:11:34,814 INFO L273 TraceCheckUtils]: 32: Hoare triple {3417#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {3417#false} is VALID [2018-11-23 12:11:34,814 INFO L273 TraceCheckUtils]: 33: Hoare triple {3417#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3417#false} is VALID [2018-11-23 12:11:34,814 INFO L273 TraceCheckUtils]: 34: Hoare triple {3417#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {3417#false} is VALID [2018-11-23 12:11:34,814 INFO L273 TraceCheckUtils]: 35: Hoare triple {3417#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {3417#false} is VALID [2018-11-23 12:11:34,814 INFO L273 TraceCheckUtils]: 36: Hoare triple {3417#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3417#false} is VALID [2018-11-23 12:11:34,814 INFO L273 TraceCheckUtils]: 37: Hoare triple {3417#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {3417#false} is VALID [2018-11-23 12:11:34,815 INFO L273 TraceCheckUtils]: 38: Hoare triple {3417#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {3417#false} is VALID [2018-11-23 12:11:34,815 INFO L273 TraceCheckUtils]: 39: Hoare triple {3417#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3417#false} is VALID [2018-11-23 12:11:34,815 INFO L273 TraceCheckUtils]: 40: Hoare triple {3417#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {3417#false} is VALID [2018-11-23 12:11:34,815 INFO L273 TraceCheckUtils]: 41: Hoare triple {3417#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {3417#false} is VALID [2018-11-23 12:11:34,815 INFO L273 TraceCheckUtils]: 42: Hoare triple {3417#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3417#false} is VALID [2018-11-23 12:11:34,816 INFO L273 TraceCheckUtils]: 43: Hoare triple {3417#false} assume !(~i~0 < 100000); {3417#false} is VALID [2018-11-23 12:11:34,816 INFO L273 TraceCheckUtils]: 44: Hoare triple {3417#false} ~i~0 := 0; {3417#false} is VALID [2018-11-23 12:11:34,816 INFO L273 TraceCheckUtils]: 45: Hoare triple {3417#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem5 == #t~mem6; {3417#false} is VALID [2018-11-23 12:11:34,816 INFO L273 TraceCheckUtils]: 46: Hoare triple {3417#false} assume !#t~short10;call #t~mem9 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 == #t~mem7 * #t~mem8; {3417#false} is VALID [2018-11-23 12:11:34,816 INFO L256 TraceCheckUtils]: 47: Hoare triple {3417#false} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {3417#false} is VALID [2018-11-23 12:11:34,817 INFO L273 TraceCheckUtils]: 48: Hoare triple {3417#false} ~cond := #in~cond; {3417#false} is VALID [2018-11-23 12:11:34,817 INFO L273 TraceCheckUtils]: 49: Hoare triple {3417#false} assume 0 == ~cond; {3417#false} is VALID [2018-11-23 12:11:34,817 INFO L273 TraceCheckUtils]: 50: Hoare triple {3417#false} assume !false; {3417#false} is VALID [2018-11-23 12:11:34,819 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-23 12:11:34,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:11:34,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-11-23 12:11:34,841 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2018-11-23 12:11:34,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:34,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:11:34,950 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:34,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:11:34,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:11:34,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:11:34,952 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 10 states. [2018-11-23 12:11:35,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:35,561 INFO L93 Difference]: Finished difference Result 157 states and 204 transitions. [2018-11-23 12:11:35,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:11:35,561 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2018-11-23 12:11:35,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:35,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:11:35,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 153 transitions. [2018-11-23 12:11:35,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:11:35,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 153 transitions. [2018-11-23 12:11:35,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 153 transitions. [2018-11-23 12:11:35,904 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:35,907 INFO L225 Difference]: With dead ends: 157 [2018-11-23 12:11:35,908 INFO L226 Difference]: Without dead ends: 117 [2018-11-23 12:11:35,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:11:35,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-23 12:11:36,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 66. [2018-11-23 12:11:36,546 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:36,546 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 66 states. [2018-11-23 12:11:36,546 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 66 states. [2018-11-23 12:11:36,547 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 66 states. [2018-11-23 12:11:36,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:36,550 INFO L93 Difference]: Finished difference Result 117 states and 153 transitions. [2018-11-23 12:11:36,550 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 153 transitions. [2018-11-23 12:11:36,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:36,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:36,551 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 117 states. [2018-11-23 12:11:36,552 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 117 states. [2018-11-23 12:11:36,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:36,555 INFO L93 Difference]: Finished difference Result 117 states and 153 transitions. [2018-11-23 12:11:36,555 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 153 transitions. [2018-11-23 12:11:36,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:36,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:36,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:36,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:36,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 12:11:36,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2018-11-23 12:11:36,558 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 51 [2018-11-23 12:11:36,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:36,558 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2018-11-23 12:11:36,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:11:36,559 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2018-11-23 12:11:36,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 12:11:36,559 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:36,559 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:36,560 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:36,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:36,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1181960504, now seen corresponding path program 8 times [2018-11-23 12:11:36,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:36,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:36,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:36,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:11:36,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:36,582 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:11:36,582 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:11:36,582 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:11:36,619 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:11:36,650 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:11:36,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:11:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:36,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:11:37,218 INFO L256 TraceCheckUtils]: 0: Hoare triple {4126#true} call ULTIMATE.init(); {4126#true} is VALID [2018-11-23 12:11:37,219 INFO L273 TraceCheckUtils]: 1: Hoare triple {4126#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4126#true} is VALID [2018-11-23 12:11:37,219 INFO L273 TraceCheckUtils]: 2: Hoare triple {4126#true} assume true; {4126#true} is VALID [2018-11-23 12:11:37,220 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4126#true} {4126#true} #74#return; {4126#true} is VALID [2018-11-23 12:11:37,220 INFO L256 TraceCheckUtils]: 4: Hoare triple {4126#true} call #t~ret11 := main(); {4126#true} is VALID [2018-11-23 12:11:37,222 INFO L273 TraceCheckUtils]: 5: Hoare triple {4126#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);havoc ~k~0;havoc ~i~0;~i~0 := 0; {4146#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:37,222 INFO L273 TraceCheckUtils]: 6: Hoare triple {4146#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4146#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:37,223 INFO L273 TraceCheckUtils]: 7: Hoare triple {4146#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4153#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:37,223 INFO L273 TraceCheckUtils]: 8: Hoare triple {4153#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4153#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:37,223 INFO L273 TraceCheckUtils]: 9: Hoare triple {4153#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4160#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:37,224 INFO L273 TraceCheckUtils]: 10: Hoare triple {4160#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4160#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:37,224 INFO L273 TraceCheckUtils]: 11: Hoare triple {4160#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4167#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:37,225 INFO L273 TraceCheckUtils]: 12: Hoare triple {4167#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4167#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:37,226 INFO L273 TraceCheckUtils]: 13: Hoare triple {4167#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4174#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:37,226 INFO L273 TraceCheckUtils]: 14: Hoare triple {4174#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4174#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:37,227 INFO L273 TraceCheckUtils]: 15: Hoare triple {4174#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4181#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:37,228 INFO L273 TraceCheckUtils]: 16: Hoare triple {4181#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4181#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:37,229 INFO L273 TraceCheckUtils]: 17: Hoare triple {4181#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4188#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:37,229 INFO L273 TraceCheckUtils]: 18: Hoare triple {4188#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4188#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:37,230 INFO L273 TraceCheckUtils]: 19: Hoare triple {4188#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4195#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:37,231 INFO L273 TraceCheckUtils]: 20: Hoare triple {4195#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4195#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:37,231 INFO L273 TraceCheckUtils]: 21: Hoare triple {4195#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4202#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:37,232 INFO L273 TraceCheckUtils]: 22: Hoare triple {4202#(<= main_~i~0 8)} assume !(~i~0 < 100000); {4127#false} is VALID [2018-11-23 12:11:37,232 INFO L273 TraceCheckUtils]: 23: Hoare triple {4127#false} ~i~0 := 0; {4127#false} is VALID [2018-11-23 12:11:37,233 INFO L273 TraceCheckUtils]: 24: Hoare triple {4127#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {4127#false} is VALID [2018-11-23 12:11:37,233 INFO L273 TraceCheckUtils]: 25: Hoare triple {4127#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {4127#false} is VALID [2018-11-23 12:11:37,233 INFO L273 TraceCheckUtils]: 26: Hoare triple {4127#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4127#false} is VALID [2018-11-23 12:11:37,234 INFO L273 TraceCheckUtils]: 27: Hoare triple {4127#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {4127#false} is VALID [2018-11-23 12:11:37,234 INFO L273 TraceCheckUtils]: 28: Hoare triple {4127#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {4127#false} is VALID [2018-11-23 12:11:37,234 INFO L273 TraceCheckUtils]: 29: Hoare triple {4127#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4127#false} is VALID [2018-11-23 12:11:37,234 INFO L273 TraceCheckUtils]: 30: Hoare triple {4127#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {4127#false} is VALID [2018-11-23 12:11:37,235 INFO L273 TraceCheckUtils]: 31: Hoare triple {4127#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {4127#false} is VALID [2018-11-23 12:11:37,235 INFO L273 TraceCheckUtils]: 32: Hoare triple {4127#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4127#false} is VALID [2018-11-23 12:11:37,235 INFO L273 TraceCheckUtils]: 33: Hoare triple {4127#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {4127#false} is VALID [2018-11-23 12:11:37,235 INFO L273 TraceCheckUtils]: 34: Hoare triple {4127#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {4127#false} is VALID [2018-11-23 12:11:37,236 INFO L273 TraceCheckUtils]: 35: Hoare triple {4127#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4127#false} is VALID [2018-11-23 12:11:37,236 INFO L273 TraceCheckUtils]: 36: Hoare triple {4127#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {4127#false} is VALID [2018-11-23 12:11:37,236 INFO L273 TraceCheckUtils]: 37: Hoare triple {4127#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {4127#false} is VALID [2018-11-23 12:11:37,237 INFO L273 TraceCheckUtils]: 38: Hoare triple {4127#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4127#false} is VALID [2018-11-23 12:11:37,237 INFO L273 TraceCheckUtils]: 39: Hoare triple {4127#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {4127#false} is VALID [2018-11-23 12:11:37,238 INFO L273 TraceCheckUtils]: 40: Hoare triple {4127#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {4127#false} is VALID [2018-11-23 12:11:37,238 INFO L273 TraceCheckUtils]: 41: Hoare triple {4127#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4127#false} is VALID [2018-11-23 12:11:37,238 INFO L273 TraceCheckUtils]: 42: Hoare triple {4127#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {4127#false} is VALID [2018-11-23 12:11:37,238 INFO L273 TraceCheckUtils]: 43: Hoare triple {4127#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {4127#false} is VALID [2018-11-23 12:11:37,238 INFO L273 TraceCheckUtils]: 44: Hoare triple {4127#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4127#false} is VALID [2018-11-23 12:11:37,239 INFO L273 TraceCheckUtils]: 45: Hoare triple {4127#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {4127#false} is VALID [2018-11-23 12:11:37,239 INFO L273 TraceCheckUtils]: 46: Hoare triple {4127#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {4127#false} is VALID [2018-11-23 12:11:37,239 INFO L273 TraceCheckUtils]: 47: Hoare triple {4127#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4127#false} is VALID [2018-11-23 12:11:37,239 INFO L273 TraceCheckUtils]: 48: Hoare triple {4127#false} assume !(~i~0 < 100000); {4127#false} is VALID [2018-11-23 12:11:37,239 INFO L273 TraceCheckUtils]: 49: Hoare triple {4127#false} ~i~0 := 0; {4127#false} is VALID [2018-11-23 12:11:37,240 INFO L273 TraceCheckUtils]: 50: Hoare triple {4127#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem5 == #t~mem6; {4127#false} is VALID [2018-11-23 12:11:37,240 INFO L273 TraceCheckUtils]: 51: Hoare triple {4127#false} assume !#t~short10;call #t~mem9 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 == #t~mem7 * #t~mem8; {4127#false} is VALID [2018-11-23 12:11:37,240 INFO L256 TraceCheckUtils]: 52: Hoare triple {4127#false} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {4127#false} is VALID [2018-11-23 12:11:37,240 INFO L273 TraceCheckUtils]: 53: Hoare triple {4127#false} ~cond := #in~cond; {4127#false} is VALID [2018-11-23 12:11:37,240 INFO L273 TraceCheckUtils]: 54: Hoare triple {4127#false} assume 0 == ~cond; {4127#false} is VALID [2018-11-23 12:11:37,241 INFO L273 TraceCheckUtils]: 55: Hoare triple {4127#false} assume !false; {4127#false} is VALID [2018-11-23 12:11:37,243 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-23 12:11:37,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:11:37,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-11-23 12:11:37,264 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-11-23 12:11:37,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:37,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:11:37,300 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:37,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:11:37,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:11:37,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:11:37,301 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand 11 states. [2018-11-23 12:11:38,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:38,058 INFO L93 Difference]: Finished difference Result 171 states and 223 transitions. [2018-11-23 12:11:38,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:11:38,058 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-11-23 12:11:38,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:38,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:11:38,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 166 transitions. [2018-11-23 12:11:38,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:11:38,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 166 transitions. [2018-11-23 12:11:38,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 166 transitions. [2018-11-23 12:11:38,257 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:38,261 INFO L225 Difference]: With dead ends: 171 [2018-11-23 12:11:38,261 INFO L226 Difference]: Without dead ends: 128 [2018-11-23 12:11:38,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:11:38,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-23 12:11:38,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 71. [2018-11-23 12:11:38,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:38,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 71 states. [2018-11-23 12:11:38,307 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 71 states. [2018-11-23 12:11:38,307 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 71 states. [2018-11-23 12:11:38,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:38,311 INFO L93 Difference]: Finished difference Result 128 states and 168 transitions. [2018-11-23 12:11:38,311 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 168 transitions. [2018-11-23 12:11:38,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:38,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:38,312 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 128 states. [2018-11-23 12:11:38,312 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 128 states. [2018-11-23 12:11:38,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:38,316 INFO L93 Difference]: Finished difference Result 128 states and 168 transitions. [2018-11-23 12:11:38,316 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 168 transitions. [2018-11-23 12:11:38,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:38,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:38,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:38,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:38,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 12:11:38,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2018-11-23 12:11:38,319 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 56 [2018-11-23 12:11:38,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:38,320 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2018-11-23 12:11:38,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:11:38,320 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2018-11-23 12:11:38,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 12:11:38,321 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:38,321 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:38,321 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:38,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:38,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1976253677, now seen corresponding path program 9 times [2018-11-23 12:11:38,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:38,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:38,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:38,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:11:38,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:38,342 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:11:38,342 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:11:38,342 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:11:38,364 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:11:38,512 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 12:11:38,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:11:38,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:38,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:11:38,721 INFO L256 TraceCheckUtils]: 0: Hoare triple {4901#true} call ULTIMATE.init(); {4901#true} is VALID [2018-11-23 12:11:38,722 INFO L273 TraceCheckUtils]: 1: Hoare triple {4901#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4901#true} is VALID [2018-11-23 12:11:38,722 INFO L273 TraceCheckUtils]: 2: Hoare triple {4901#true} assume true; {4901#true} is VALID [2018-11-23 12:11:38,723 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4901#true} {4901#true} #74#return; {4901#true} is VALID [2018-11-23 12:11:38,723 INFO L256 TraceCheckUtils]: 4: Hoare triple {4901#true} call #t~ret11 := main(); {4901#true} is VALID [2018-11-23 12:11:38,723 INFO L273 TraceCheckUtils]: 5: Hoare triple {4901#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);havoc ~k~0;havoc ~i~0;~i~0 := 0; {4901#true} is VALID [2018-11-23 12:11:38,724 INFO L273 TraceCheckUtils]: 6: Hoare triple {4901#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4901#true} is VALID [2018-11-23 12:11:38,724 INFO L273 TraceCheckUtils]: 7: Hoare triple {4901#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4901#true} is VALID [2018-11-23 12:11:38,724 INFO L273 TraceCheckUtils]: 8: Hoare triple {4901#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4901#true} is VALID [2018-11-23 12:11:38,725 INFO L273 TraceCheckUtils]: 9: Hoare triple {4901#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4901#true} is VALID [2018-11-23 12:11:38,725 INFO L273 TraceCheckUtils]: 10: Hoare triple {4901#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4901#true} is VALID [2018-11-23 12:11:38,725 INFO L273 TraceCheckUtils]: 11: Hoare triple {4901#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4901#true} is VALID [2018-11-23 12:11:38,726 INFO L273 TraceCheckUtils]: 12: Hoare triple {4901#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4901#true} is VALID [2018-11-23 12:11:38,726 INFO L273 TraceCheckUtils]: 13: Hoare triple {4901#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4901#true} is VALID [2018-11-23 12:11:38,726 INFO L273 TraceCheckUtils]: 14: Hoare triple {4901#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4901#true} is VALID [2018-11-23 12:11:38,726 INFO L273 TraceCheckUtils]: 15: Hoare triple {4901#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4901#true} is VALID [2018-11-23 12:11:38,726 INFO L273 TraceCheckUtils]: 16: Hoare triple {4901#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4901#true} is VALID [2018-11-23 12:11:38,727 INFO L273 TraceCheckUtils]: 17: Hoare triple {4901#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4901#true} is VALID [2018-11-23 12:11:38,727 INFO L273 TraceCheckUtils]: 18: Hoare triple {4901#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4901#true} is VALID [2018-11-23 12:11:38,727 INFO L273 TraceCheckUtils]: 19: Hoare triple {4901#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4901#true} is VALID [2018-11-23 12:11:38,727 INFO L273 TraceCheckUtils]: 20: Hoare triple {4901#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4901#true} is VALID [2018-11-23 12:11:38,728 INFO L273 TraceCheckUtils]: 21: Hoare triple {4901#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4901#true} is VALID [2018-11-23 12:11:38,728 INFO L273 TraceCheckUtils]: 22: Hoare triple {4901#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {4901#true} is VALID [2018-11-23 12:11:38,728 INFO L273 TraceCheckUtils]: 23: Hoare triple {4901#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4901#true} is VALID [2018-11-23 12:11:38,728 INFO L273 TraceCheckUtils]: 24: Hoare triple {4901#true} assume !(~i~0 < 100000); {4901#true} is VALID [2018-11-23 12:11:38,741 INFO L273 TraceCheckUtils]: 25: Hoare triple {4901#true} ~i~0 := 0; {4981#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:38,753 INFO L273 TraceCheckUtils]: 26: Hoare triple {4981#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {4981#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:38,754 INFO L273 TraceCheckUtils]: 27: Hoare triple {4981#(<= main_~i~0 0)} assume !(0 != #t~nondet2);havoc #t~nondet2; {4981#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:38,755 INFO L273 TraceCheckUtils]: 28: Hoare triple {4981#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4991#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:38,755 INFO L273 TraceCheckUtils]: 29: Hoare triple {4991#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {4991#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:38,757 INFO L273 TraceCheckUtils]: 30: Hoare triple {4991#(<= main_~i~0 1)} assume !(0 != #t~nondet2);havoc #t~nondet2; {4991#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:38,757 INFO L273 TraceCheckUtils]: 31: Hoare triple {4991#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5001#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:38,759 INFO L273 TraceCheckUtils]: 32: Hoare triple {5001#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {5001#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:38,759 INFO L273 TraceCheckUtils]: 33: Hoare triple {5001#(<= main_~i~0 2)} assume !(0 != #t~nondet2);havoc #t~nondet2; {5001#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:38,761 INFO L273 TraceCheckUtils]: 34: Hoare triple {5001#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5011#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:38,761 INFO L273 TraceCheckUtils]: 35: Hoare triple {5011#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {5011#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:38,763 INFO L273 TraceCheckUtils]: 36: Hoare triple {5011#(<= main_~i~0 3)} assume !(0 != #t~nondet2);havoc #t~nondet2; {5011#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:38,765 INFO L273 TraceCheckUtils]: 37: Hoare triple {5011#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5021#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:38,765 INFO L273 TraceCheckUtils]: 38: Hoare triple {5021#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {5021#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:38,767 INFO L273 TraceCheckUtils]: 39: Hoare triple {5021#(<= main_~i~0 4)} assume !(0 != #t~nondet2);havoc #t~nondet2; {5021#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:38,767 INFO L273 TraceCheckUtils]: 40: Hoare triple {5021#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5031#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:38,769 INFO L273 TraceCheckUtils]: 41: Hoare triple {5031#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {5031#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:38,769 INFO L273 TraceCheckUtils]: 42: Hoare triple {5031#(<= main_~i~0 5)} assume !(0 != #t~nondet2);havoc #t~nondet2; {5031#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:38,770 INFO L273 TraceCheckUtils]: 43: Hoare triple {5031#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5041#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:38,771 INFO L273 TraceCheckUtils]: 44: Hoare triple {5041#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {5041#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:38,771 INFO L273 TraceCheckUtils]: 45: Hoare triple {5041#(<= main_~i~0 6)} assume !(0 != #t~nondet2);havoc #t~nondet2; {5041#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:38,772 INFO L273 TraceCheckUtils]: 46: Hoare triple {5041#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5051#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:38,777 INFO L273 TraceCheckUtils]: 47: Hoare triple {5051#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {5051#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:38,777 INFO L273 TraceCheckUtils]: 48: Hoare triple {5051#(<= main_~i~0 7)} assume !(0 != #t~nondet2);havoc #t~nondet2; {5051#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:38,778 INFO L273 TraceCheckUtils]: 49: Hoare triple {5051#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5061#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:38,778 INFO L273 TraceCheckUtils]: 50: Hoare triple {5061#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {5061#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:38,779 INFO L273 TraceCheckUtils]: 51: Hoare triple {5061#(<= main_~i~0 8)} assume !(0 != #t~nondet2);havoc #t~nondet2; {5061#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:38,779 INFO L273 TraceCheckUtils]: 52: Hoare triple {5061#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5071#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:38,780 INFO L273 TraceCheckUtils]: 53: Hoare triple {5071#(<= main_~i~0 9)} assume !(~i~0 < 100000); {4902#false} is VALID [2018-11-23 12:11:38,780 INFO L273 TraceCheckUtils]: 54: Hoare triple {4902#false} ~i~0 := 0; {4902#false} is VALID [2018-11-23 12:11:38,780 INFO L273 TraceCheckUtils]: 55: Hoare triple {4902#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem5 == #t~mem6; {4902#false} is VALID [2018-11-23 12:11:38,780 INFO L273 TraceCheckUtils]: 56: Hoare triple {4902#false} assume !#t~short10;call #t~mem9 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 == #t~mem7 * #t~mem8; {4902#false} is VALID [2018-11-23 12:11:38,781 INFO L256 TraceCheckUtils]: 57: Hoare triple {4902#false} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {4902#false} is VALID [2018-11-23 12:11:38,781 INFO L273 TraceCheckUtils]: 58: Hoare triple {4902#false} ~cond := #in~cond; {4902#false} is VALID [2018-11-23 12:11:38,781 INFO L273 TraceCheckUtils]: 59: Hoare triple {4902#false} assume 0 == ~cond; {4902#false} is VALID [2018-11-23 12:11:38,781 INFO L273 TraceCheckUtils]: 60: Hoare triple {4902#false} assume !false; {4902#false} is VALID [2018-11-23 12:11:38,785 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-23 12:11:38,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:11:38,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-11-23 12:11:38,805 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2018-11-23 12:11:38,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:38,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:11:38,853 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:38,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:11:38,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:11:38,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:11:38,855 INFO L87 Difference]: Start difference. First operand 71 states and 83 transitions. Second operand 12 states. [2018-11-23 12:11:40,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:40,335 INFO L93 Difference]: Finished difference Result 185 states and 242 transitions. [2018-11-23 12:11:40,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:11:40,336 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2018-11-23 12:11:40,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:40,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:11:40,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 179 transitions. [2018-11-23 12:11:40,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:11:40,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 179 transitions. [2018-11-23 12:11:40,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 179 transitions. [2018-11-23 12:11:40,914 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:40,917 INFO L225 Difference]: With dead ends: 185 [2018-11-23 12:11:40,918 INFO L226 Difference]: Without dead ends: 139 [2018-11-23 12:11:40,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:11:40,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-23 12:11:41,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 76. [2018-11-23 12:11:41,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:41,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand 76 states. [2018-11-23 12:11:41,067 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 76 states. [2018-11-23 12:11:41,067 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 76 states. [2018-11-23 12:11:41,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:41,072 INFO L93 Difference]: Finished difference Result 139 states and 183 transitions. [2018-11-23 12:11:41,072 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 183 transitions. [2018-11-23 12:11:41,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:41,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:41,074 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 139 states. [2018-11-23 12:11:41,074 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 139 states. [2018-11-23 12:11:41,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:41,079 INFO L93 Difference]: Finished difference Result 139 states and 183 transitions. [2018-11-23 12:11:41,079 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 183 transitions. [2018-11-23 12:11:41,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:41,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:41,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:41,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:41,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 12:11:41,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2018-11-23 12:11:41,083 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 61 [2018-11-23 12:11:41,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:41,083 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2018-11-23 12:11:41,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:11:41,084 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2018-11-23 12:11:41,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 12:11:41,084 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:41,085 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:41,085 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:41,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:41,085 INFO L82 PathProgramCache]: Analyzing trace with hash 254629660, now seen corresponding path program 10 times [2018-11-23 12:11:41,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:41,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:41,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:41,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:11:41,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:41,126 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:11:41,126 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:11:41,127 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:11:41,177 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:11:41,214 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:11:41,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:11:41,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:41,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:11:41,816 INFO L256 TraceCheckUtils]: 0: Hoare triple {5741#true} call ULTIMATE.init(); {5741#true} is VALID [2018-11-23 12:11:41,816 INFO L273 TraceCheckUtils]: 1: Hoare triple {5741#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5741#true} is VALID [2018-11-23 12:11:41,816 INFO L273 TraceCheckUtils]: 2: Hoare triple {5741#true} assume true; {5741#true} is VALID [2018-11-23 12:11:41,817 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5741#true} {5741#true} #74#return; {5741#true} is VALID [2018-11-23 12:11:41,817 INFO L256 TraceCheckUtils]: 4: Hoare triple {5741#true} call #t~ret11 := main(); {5741#true} is VALID [2018-11-23 12:11:41,818 INFO L273 TraceCheckUtils]: 5: Hoare triple {5741#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);havoc ~k~0;havoc ~i~0;~i~0 := 0; {5761#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:41,818 INFO L273 TraceCheckUtils]: 6: Hoare triple {5761#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5761#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:41,819 INFO L273 TraceCheckUtils]: 7: Hoare triple {5761#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5768#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:41,819 INFO L273 TraceCheckUtils]: 8: Hoare triple {5768#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5768#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:41,820 INFO L273 TraceCheckUtils]: 9: Hoare triple {5768#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5775#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:41,820 INFO L273 TraceCheckUtils]: 10: Hoare triple {5775#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5775#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:41,821 INFO L273 TraceCheckUtils]: 11: Hoare triple {5775#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5782#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:41,822 INFO L273 TraceCheckUtils]: 12: Hoare triple {5782#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5782#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:41,822 INFO L273 TraceCheckUtils]: 13: Hoare triple {5782#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5789#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:41,823 INFO L273 TraceCheckUtils]: 14: Hoare triple {5789#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5789#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:41,824 INFO L273 TraceCheckUtils]: 15: Hoare triple {5789#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5796#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:41,825 INFO L273 TraceCheckUtils]: 16: Hoare triple {5796#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5796#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:41,825 INFO L273 TraceCheckUtils]: 17: Hoare triple {5796#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5803#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:41,826 INFO L273 TraceCheckUtils]: 18: Hoare triple {5803#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5803#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:41,827 INFO L273 TraceCheckUtils]: 19: Hoare triple {5803#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5810#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:41,827 INFO L273 TraceCheckUtils]: 20: Hoare triple {5810#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5810#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:41,828 INFO L273 TraceCheckUtils]: 21: Hoare triple {5810#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5817#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:41,829 INFO L273 TraceCheckUtils]: 22: Hoare triple {5817#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5817#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:41,830 INFO L273 TraceCheckUtils]: 23: Hoare triple {5817#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5824#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:41,830 INFO L273 TraceCheckUtils]: 24: Hoare triple {5824#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {5824#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:41,831 INFO L273 TraceCheckUtils]: 25: Hoare triple {5824#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5831#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:41,832 INFO L273 TraceCheckUtils]: 26: Hoare triple {5831#(<= main_~i~0 10)} assume !(~i~0 < 100000); {5742#false} is VALID [2018-11-23 12:11:41,832 INFO L273 TraceCheckUtils]: 27: Hoare triple {5742#false} ~i~0 := 0; {5742#false} is VALID [2018-11-23 12:11:41,832 INFO L273 TraceCheckUtils]: 28: Hoare triple {5742#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {5742#false} is VALID [2018-11-23 12:11:41,833 INFO L273 TraceCheckUtils]: 29: Hoare triple {5742#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {5742#false} is VALID [2018-11-23 12:11:41,833 INFO L273 TraceCheckUtils]: 30: Hoare triple {5742#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5742#false} is VALID [2018-11-23 12:11:41,833 INFO L273 TraceCheckUtils]: 31: Hoare triple {5742#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {5742#false} is VALID [2018-11-23 12:11:41,833 INFO L273 TraceCheckUtils]: 32: Hoare triple {5742#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {5742#false} is VALID [2018-11-23 12:11:41,834 INFO L273 TraceCheckUtils]: 33: Hoare triple {5742#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5742#false} is VALID [2018-11-23 12:11:41,834 INFO L273 TraceCheckUtils]: 34: Hoare triple {5742#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {5742#false} is VALID [2018-11-23 12:11:41,834 INFO L273 TraceCheckUtils]: 35: Hoare triple {5742#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {5742#false} is VALID [2018-11-23 12:11:41,834 INFO L273 TraceCheckUtils]: 36: Hoare triple {5742#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5742#false} is VALID [2018-11-23 12:11:41,835 INFO L273 TraceCheckUtils]: 37: Hoare triple {5742#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {5742#false} is VALID [2018-11-23 12:11:41,835 INFO L273 TraceCheckUtils]: 38: Hoare triple {5742#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {5742#false} is VALID [2018-11-23 12:11:41,835 INFO L273 TraceCheckUtils]: 39: Hoare triple {5742#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5742#false} is VALID [2018-11-23 12:11:41,835 INFO L273 TraceCheckUtils]: 40: Hoare triple {5742#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {5742#false} is VALID [2018-11-23 12:11:41,835 INFO L273 TraceCheckUtils]: 41: Hoare triple {5742#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {5742#false} is VALID [2018-11-23 12:11:41,835 INFO L273 TraceCheckUtils]: 42: Hoare triple {5742#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5742#false} is VALID [2018-11-23 12:11:41,836 INFO L273 TraceCheckUtils]: 43: Hoare triple {5742#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {5742#false} is VALID [2018-11-23 12:11:41,836 INFO L273 TraceCheckUtils]: 44: Hoare triple {5742#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {5742#false} is VALID [2018-11-23 12:11:41,836 INFO L273 TraceCheckUtils]: 45: Hoare triple {5742#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5742#false} is VALID [2018-11-23 12:11:41,836 INFO L273 TraceCheckUtils]: 46: Hoare triple {5742#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {5742#false} is VALID [2018-11-23 12:11:41,836 INFO L273 TraceCheckUtils]: 47: Hoare triple {5742#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {5742#false} is VALID [2018-11-23 12:11:41,836 INFO L273 TraceCheckUtils]: 48: Hoare triple {5742#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5742#false} is VALID [2018-11-23 12:11:41,836 INFO L273 TraceCheckUtils]: 49: Hoare triple {5742#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {5742#false} is VALID [2018-11-23 12:11:41,837 INFO L273 TraceCheckUtils]: 50: Hoare triple {5742#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {5742#false} is VALID [2018-11-23 12:11:41,837 INFO L273 TraceCheckUtils]: 51: Hoare triple {5742#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5742#false} is VALID [2018-11-23 12:11:41,837 INFO L273 TraceCheckUtils]: 52: Hoare triple {5742#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {5742#false} is VALID [2018-11-23 12:11:41,837 INFO L273 TraceCheckUtils]: 53: Hoare triple {5742#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {5742#false} is VALID [2018-11-23 12:11:41,837 INFO L273 TraceCheckUtils]: 54: Hoare triple {5742#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5742#false} is VALID [2018-11-23 12:11:41,837 INFO L273 TraceCheckUtils]: 55: Hoare triple {5742#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {5742#false} is VALID [2018-11-23 12:11:41,837 INFO L273 TraceCheckUtils]: 56: Hoare triple {5742#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {5742#false} is VALID [2018-11-23 12:11:41,838 INFO L273 TraceCheckUtils]: 57: Hoare triple {5742#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5742#false} is VALID [2018-11-23 12:11:41,838 INFO L273 TraceCheckUtils]: 58: Hoare triple {5742#false} assume !(~i~0 < 100000); {5742#false} is VALID [2018-11-23 12:11:41,838 INFO L273 TraceCheckUtils]: 59: Hoare triple {5742#false} ~i~0 := 0; {5742#false} is VALID [2018-11-23 12:11:41,838 INFO L273 TraceCheckUtils]: 60: Hoare triple {5742#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem5 == #t~mem6; {5742#false} is VALID [2018-11-23 12:11:41,838 INFO L273 TraceCheckUtils]: 61: Hoare triple {5742#false} assume !#t~short10;call #t~mem9 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 == #t~mem7 * #t~mem8; {5742#false} is VALID [2018-11-23 12:11:41,838 INFO L256 TraceCheckUtils]: 62: Hoare triple {5742#false} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {5742#false} is VALID [2018-11-23 12:11:41,838 INFO L273 TraceCheckUtils]: 63: Hoare triple {5742#false} ~cond := #in~cond; {5742#false} is VALID [2018-11-23 12:11:41,838 INFO L273 TraceCheckUtils]: 64: Hoare triple {5742#false} assume 0 == ~cond; {5742#false} is VALID [2018-11-23 12:11:41,839 INFO L273 TraceCheckUtils]: 65: Hoare triple {5742#false} assume !false; {5742#false} is VALID [2018-11-23 12:11:41,841 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 12:11:41,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:11:41,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-11-23 12:11:41,861 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2018-11-23 12:11:41,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:41,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:11:41,901 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-23 12:11:41,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:11:41,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:11:41,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:11:41,903 INFO L87 Difference]: Start difference. First operand 76 states and 89 transitions. Second operand 13 states. [2018-11-23 12:11:42,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:42,828 INFO L93 Difference]: Finished difference Result 199 states and 261 transitions. [2018-11-23 12:11:42,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:11:42,828 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2018-11-23 12:11:42,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:42,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:11:42,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 192 transitions. [2018-11-23 12:11:42,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:11:42,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 192 transitions. [2018-11-23 12:11:42,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 192 transitions. [2018-11-23 12:11:43,691 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:43,695 INFO L225 Difference]: With dead ends: 199 [2018-11-23 12:11:43,696 INFO L226 Difference]: Without dead ends: 150 [2018-11-23 12:11:43,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:11:43,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-23 12:11:43,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 81. [2018-11-23 12:11:43,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:43,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand 81 states. [2018-11-23 12:11:43,889 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 81 states. [2018-11-23 12:11:43,889 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 81 states. [2018-11-23 12:11:43,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:43,894 INFO L93 Difference]: Finished difference Result 150 states and 198 transitions. [2018-11-23 12:11:43,894 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 198 transitions. [2018-11-23 12:11:43,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:43,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:43,895 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 150 states. [2018-11-23 12:11:43,896 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 150 states. [2018-11-23 12:11:43,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:43,901 INFO L93 Difference]: Finished difference Result 150 states and 198 transitions. [2018-11-23 12:11:43,901 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 198 transitions. [2018-11-23 12:11:43,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:43,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:43,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:43,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:43,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 12:11:43,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 95 transitions. [2018-11-23 12:11:43,905 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 95 transitions. Word has length 66 [2018-11-23 12:11:43,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:43,905 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 95 transitions. [2018-11-23 12:11:43,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:11:43,905 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2018-11-23 12:11:43,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 12:11:43,906 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:43,906 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:43,907 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:43,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:43,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1584191241, now seen corresponding path program 11 times [2018-11-23 12:11:43,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:43,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:43,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:43,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:11:43,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:43,929 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:11:43,929 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:11:43,929 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:11:43,955 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:11:44,570 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 12:11:44,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:11:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:44,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:11:45,307 INFO L256 TraceCheckUtils]: 0: Hoare triple {6646#true} call ULTIMATE.init(); {6646#true} is VALID [2018-11-23 12:11:45,308 INFO L273 TraceCheckUtils]: 1: Hoare triple {6646#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6646#true} is VALID [2018-11-23 12:11:45,308 INFO L273 TraceCheckUtils]: 2: Hoare triple {6646#true} assume true; {6646#true} is VALID [2018-11-23 12:11:45,308 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6646#true} {6646#true} #74#return; {6646#true} is VALID [2018-11-23 12:11:45,308 INFO L256 TraceCheckUtils]: 4: Hoare triple {6646#true} call #t~ret11 := main(); {6646#true} is VALID [2018-11-23 12:11:45,309 INFO L273 TraceCheckUtils]: 5: Hoare triple {6646#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);havoc ~k~0;havoc ~i~0;~i~0 := 0; {6666#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:45,310 INFO L273 TraceCheckUtils]: 6: Hoare triple {6666#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6666#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:45,310 INFO L273 TraceCheckUtils]: 7: Hoare triple {6666#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6673#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:45,311 INFO L273 TraceCheckUtils]: 8: Hoare triple {6673#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6673#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:45,311 INFO L273 TraceCheckUtils]: 9: Hoare triple {6673#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6680#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:45,312 INFO L273 TraceCheckUtils]: 10: Hoare triple {6680#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6680#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:45,313 INFO L273 TraceCheckUtils]: 11: Hoare triple {6680#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6687#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:45,313 INFO L273 TraceCheckUtils]: 12: Hoare triple {6687#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6687#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:45,314 INFO L273 TraceCheckUtils]: 13: Hoare triple {6687#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6694#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:45,315 INFO L273 TraceCheckUtils]: 14: Hoare triple {6694#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6694#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:45,315 INFO L273 TraceCheckUtils]: 15: Hoare triple {6694#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6701#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:45,316 INFO L273 TraceCheckUtils]: 16: Hoare triple {6701#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6701#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:45,317 INFO L273 TraceCheckUtils]: 17: Hoare triple {6701#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6708#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:45,317 INFO L273 TraceCheckUtils]: 18: Hoare triple {6708#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6708#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:45,318 INFO L273 TraceCheckUtils]: 19: Hoare triple {6708#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6715#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:45,319 INFO L273 TraceCheckUtils]: 20: Hoare triple {6715#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6715#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:45,320 INFO L273 TraceCheckUtils]: 21: Hoare triple {6715#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6722#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:45,320 INFO L273 TraceCheckUtils]: 22: Hoare triple {6722#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6722#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:45,321 INFO L273 TraceCheckUtils]: 23: Hoare triple {6722#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6729#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:45,338 INFO L273 TraceCheckUtils]: 24: Hoare triple {6729#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6729#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:45,339 INFO L273 TraceCheckUtils]: 25: Hoare triple {6729#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6736#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:45,340 INFO L273 TraceCheckUtils]: 26: Hoare triple {6736#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {6736#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:45,341 INFO L273 TraceCheckUtils]: 27: Hoare triple {6736#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6743#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:45,346 INFO L273 TraceCheckUtils]: 28: Hoare triple {6743#(<= main_~i~0 11)} assume !(~i~0 < 100000); {6647#false} is VALID [2018-11-23 12:11:45,346 INFO L273 TraceCheckUtils]: 29: Hoare triple {6647#false} ~i~0 := 0; {6647#false} is VALID [2018-11-23 12:11:45,346 INFO L273 TraceCheckUtils]: 30: Hoare triple {6647#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {6647#false} is VALID [2018-11-23 12:11:45,346 INFO L273 TraceCheckUtils]: 31: Hoare triple {6647#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {6647#false} is VALID [2018-11-23 12:11:45,346 INFO L273 TraceCheckUtils]: 32: Hoare triple {6647#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6647#false} is VALID [2018-11-23 12:11:45,346 INFO L273 TraceCheckUtils]: 33: Hoare triple {6647#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {6647#false} is VALID [2018-11-23 12:11:45,346 INFO L273 TraceCheckUtils]: 34: Hoare triple {6647#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {6647#false} is VALID [2018-11-23 12:11:45,347 INFO L273 TraceCheckUtils]: 35: Hoare triple {6647#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6647#false} is VALID [2018-11-23 12:11:45,347 INFO L273 TraceCheckUtils]: 36: Hoare triple {6647#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {6647#false} is VALID [2018-11-23 12:11:45,347 INFO L273 TraceCheckUtils]: 37: Hoare triple {6647#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {6647#false} is VALID [2018-11-23 12:11:45,347 INFO L273 TraceCheckUtils]: 38: Hoare triple {6647#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6647#false} is VALID [2018-11-23 12:11:45,347 INFO L273 TraceCheckUtils]: 39: Hoare triple {6647#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {6647#false} is VALID [2018-11-23 12:11:45,347 INFO L273 TraceCheckUtils]: 40: Hoare triple {6647#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {6647#false} is VALID [2018-11-23 12:11:45,347 INFO L273 TraceCheckUtils]: 41: Hoare triple {6647#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6647#false} is VALID [2018-11-23 12:11:45,348 INFO L273 TraceCheckUtils]: 42: Hoare triple {6647#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {6647#false} is VALID [2018-11-23 12:11:45,348 INFO L273 TraceCheckUtils]: 43: Hoare triple {6647#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {6647#false} is VALID [2018-11-23 12:11:45,348 INFO L273 TraceCheckUtils]: 44: Hoare triple {6647#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6647#false} is VALID [2018-11-23 12:11:45,348 INFO L273 TraceCheckUtils]: 45: Hoare triple {6647#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {6647#false} is VALID [2018-11-23 12:11:45,348 INFO L273 TraceCheckUtils]: 46: Hoare triple {6647#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {6647#false} is VALID [2018-11-23 12:11:45,348 INFO L273 TraceCheckUtils]: 47: Hoare triple {6647#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6647#false} is VALID [2018-11-23 12:11:45,349 INFO L273 TraceCheckUtils]: 48: Hoare triple {6647#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {6647#false} is VALID [2018-11-23 12:11:45,349 INFO L273 TraceCheckUtils]: 49: Hoare triple {6647#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {6647#false} is VALID [2018-11-23 12:11:45,349 INFO L273 TraceCheckUtils]: 50: Hoare triple {6647#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6647#false} is VALID [2018-11-23 12:11:45,349 INFO L273 TraceCheckUtils]: 51: Hoare triple {6647#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {6647#false} is VALID [2018-11-23 12:11:45,349 INFO L273 TraceCheckUtils]: 52: Hoare triple {6647#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {6647#false} is VALID [2018-11-23 12:11:45,350 INFO L273 TraceCheckUtils]: 53: Hoare triple {6647#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6647#false} is VALID [2018-11-23 12:11:45,350 INFO L273 TraceCheckUtils]: 54: Hoare triple {6647#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {6647#false} is VALID [2018-11-23 12:11:45,350 INFO L273 TraceCheckUtils]: 55: Hoare triple {6647#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {6647#false} is VALID [2018-11-23 12:11:45,350 INFO L273 TraceCheckUtils]: 56: Hoare triple {6647#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6647#false} is VALID [2018-11-23 12:11:45,350 INFO L273 TraceCheckUtils]: 57: Hoare triple {6647#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {6647#false} is VALID [2018-11-23 12:11:45,351 INFO L273 TraceCheckUtils]: 58: Hoare triple {6647#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {6647#false} is VALID [2018-11-23 12:11:45,351 INFO L273 TraceCheckUtils]: 59: Hoare triple {6647#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6647#false} is VALID [2018-11-23 12:11:45,351 INFO L273 TraceCheckUtils]: 60: Hoare triple {6647#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {6647#false} is VALID [2018-11-23 12:11:45,351 INFO L273 TraceCheckUtils]: 61: Hoare triple {6647#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {6647#false} is VALID [2018-11-23 12:11:45,351 INFO L273 TraceCheckUtils]: 62: Hoare triple {6647#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6647#false} is VALID [2018-11-23 12:11:45,351 INFO L273 TraceCheckUtils]: 63: Hoare triple {6647#false} assume !(~i~0 < 100000); {6647#false} is VALID [2018-11-23 12:11:45,352 INFO L273 TraceCheckUtils]: 64: Hoare triple {6647#false} ~i~0 := 0; {6647#false} is VALID [2018-11-23 12:11:45,352 INFO L273 TraceCheckUtils]: 65: Hoare triple {6647#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem5 == #t~mem6; {6647#false} is VALID [2018-11-23 12:11:45,352 INFO L273 TraceCheckUtils]: 66: Hoare triple {6647#false} assume !#t~short10;call #t~mem9 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 == #t~mem7 * #t~mem8; {6647#false} is VALID [2018-11-23 12:11:45,352 INFO L256 TraceCheckUtils]: 67: Hoare triple {6647#false} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {6647#false} is VALID [2018-11-23 12:11:45,352 INFO L273 TraceCheckUtils]: 68: Hoare triple {6647#false} ~cond := #in~cond; {6647#false} is VALID [2018-11-23 12:11:45,353 INFO L273 TraceCheckUtils]: 69: Hoare triple {6647#false} assume 0 == ~cond; {6647#false} is VALID [2018-11-23 12:11:45,353 INFO L273 TraceCheckUtils]: 70: Hoare triple {6647#false} assume !false; {6647#false} is VALID [2018-11-23 12:11:45,356 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-11-23 12:11:45,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:11:45,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-11-23 12:11:45,386 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-11-23 12:11:45,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:45,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:11:45,434 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:45,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:11:45,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:11:45,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:11:45,436 INFO L87 Difference]: Start difference. First operand 81 states and 95 transitions. Second operand 14 states. [2018-11-23 12:11:46,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:46,587 INFO L93 Difference]: Finished difference Result 213 states and 280 transitions. [2018-11-23 12:11:46,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:11:46,587 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-11-23 12:11:46,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:46,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:11:46,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 205 transitions. [2018-11-23 12:11:46,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:11:46,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 205 transitions. [2018-11-23 12:11:46,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 205 transitions. [2018-11-23 12:11:47,123 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:47,128 INFO L225 Difference]: With dead ends: 213 [2018-11-23 12:11:47,128 INFO L226 Difference]: Without dead ends: 161 [2018-11-23 12:11:47,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:11:47,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-23 12:11:47,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 86. [2018-11-23 12:11:47,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:47,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand 86 states. [2018-11-23 12:11:47,182 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand 86 states. [2018-11-23 12:11:47,182 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 86 states. [2018-11-23 12:11:47,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:47,189 INFO L93 Difference]: Finished difference Result 161 states and 213 transitions. [2018-11-23 12:11:47,189 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 213 transitions. [2018-11-23 12:11:47,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:47,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:47,191 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 161 states. [2018-11-23 12:11:47,191 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 161 states. [2018-11-23 12:11:47,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:47,198 INFO L93 Difference]: Finished difference Result 161 states and 213 transitions. [2018-11-23 12:11:47,198 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 213 transitions. [2018-11-23 12:11:47,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:47,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:47,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:47,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:47,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 12:11:47,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 101 transitions. [2018-11-23 12:11:47,202 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 101 transitions. Word has length 71 [2018-11-23 12:11:47,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:47,203 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 101 transitions. [2018-11-23 12:11:47,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:11:47,203 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 101 transitions. [2018-11-23 12:11:47,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 12:11:47,204 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:47,204 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:47,204 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:47,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:47,205 INFO L82 PathProgramCache]: Analyzing trace with hash -171924224, now seen corresponding path program 12 times [2018-11-23 12:11:47,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:47,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:47,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:47,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:11:47,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:47,227 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:11:47,228 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:11:47,228 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:11:47,252 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:11:49,090 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 12:11:49,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:11:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:49,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:11:49,345 INFO L256 TraceCheckUtils]: 0: Hoare triple {7616#true} call ULTIMATE.init(); {7616#true} is VALID [2018-11-23 12:11:49,345 INFO L273 TraceCheckUtils]: 1: Hoare triple {7616#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7616#true} is VALID [2018-11-23 12:11:49,346 INFO L273 TraceCheckUtils]: 2: Hoare triple {7616#true} assume true; {7616#true} is VALID [2018-11-23 12:11:49,346 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7616#true} {7616#true} #74#return; {7616#true} is VALID [2018-11-23 12:11:49,346 INFO L256 TraceCheckUtils]: 4: Hoare triple {7616#true} call #t~ret11 := main(); {7616#true} is VALID [2018-11-23 12:11:49,346 INFO L273 TraceCheckUtils]: 5: Hoare triple {7616#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);havoc ~k~0;havoc ~i~0;~i~0 := 0; {7616#true} is VALID [2018-11-23 12:11:49,346 INFO L273 TraceCheckUtils]: 6: Hoare triple {7616#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7616#true} is VALID [2018-11-23 12:11:49,346 INFO L273 TraceCheckUtils]: 7: Hoare triple {7616#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7616#true} is VALID [2018-11-23 12:11:49,347 INFO L273 TraceCheckUtils]: 8: Hoare triple {7616#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7616#true} is VALID [2018-11-23 12:11:49,347 INFO L273 TraceCheckUtils]: 9: Hoare triple {7616#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7616#true} is VALID [2018-11-23 12:11:49,347 INFO L273 TraceCheckUtils]: 10: Hoare triple {7616#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7616#true} is VALID [2018-11-23 12:11:49,347 INFO L273 TraceCheckUtils]: 11: Hoare triple {7616#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7616#true} is VALID [2018-11-23 12:11:49,347 INFO L273 TraceCheckUtils]: 12: Hoare triple {7616#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7616#true} is VALID [2018-11-23 12:11:49,348 INFO L273 TraceCheckUtils]: 13: Hoare triple {7616#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7616#true} is VALID [2018-11-23 12:11:49,348 INFO L273 TraceCheckUtils]: 14: Hoare triple {7616#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7616#true} is VALID [2018-11-23 12:11:49,348 INFO L273 TraceCheckUtils]: 15: Hoare triple {7616#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7616#true} is VALID [2018-11-23 12:11:49,348 INFO L273 TraceCheckUtils]: 16: Hoare triple {7616#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7616#true} is VALID [2018-11-23 12:11:49,348 INFO L273 TraceCheckUtils]: 17: Hoare triple {7616#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7616#true} is VALID [2018-11-23 12:11:49,349 INFO L273 TraceCheckUtils]: 18: Hoare triple {7616#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7616#true} is VALID [2018-11-23 12:11:49,349 INFO L273 TraceCheckUtils]: 19: Hoare triple {7616#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7616#true} is VALID [2018-11-23 12:11:49,349 INFO L273 TraceCheckUtils]: 20: Hoare triple {7616#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7616#true} is VALID [2018-11-23 12:11:49,349 INFO L273 TraceCheckUtils]: 21: Hoare triple {7616#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7616#true} is VALID [2018-11-23 12:11:49,349 INFO L273 TraceCheckUtils]: 22: Hoare triple {7616#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7616#true} is VALID [2018-11-23 12:11:49,349 INFO L273 TraceCheckUtils]: 23: Hoare triple {7616#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7616#true} is VALID [2018-11-23 12:11:49,349 INFO L273 TraceCheckUtils]: 24: Hoare triple {7616#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7616#true} is VALID [2018-11-23 12:11:49,349 INFO L273 TraceCheckUtils]: 25: Hoare triple {7616#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7616#true} is VALID [2018-11-23 12:11:49,350 INFO L273 TraceCheckUtils]: 26: Hoare triple {7616#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7616#true} is VALID [2018-11-23 12:11:49,350 INFO L273 TraceCheckUtils]: 27: Hoare triple {7616#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7616#true} is VALID [2018-11-23 12:11:49,350 INFO L273 TraceCheckUtils]: 28: Hoare triple {7616#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {7616#true} is VALID [2018-11-23 12:11:49,350 INFO L273 TraceCheckUtils]: 29: Hoare triple {7616#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7616#true} is VALID [2018-11-23 12:11:49,350 INFO L273 TraceCheckUtils]: 30: Hoare triple {7616#true} assume !(~i~0 < 100000); {7616#true} is VALID [2018-11-23 12:11:49,351 INFO L273 TraceCheckUtils]: 31: Hoare triple {7616#true} ~i~0 := 0; {7714#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:49,351 INFO L273 TraceCheckUtils]: 32: Hoare triple {7714#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {7714#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:49,351 INFO L273 TraceCheckUtils]: 33: Hoare triple {7714#(<= main_~i~0 0)} assume !(0 != #t~nondet2);havoc #t~nondet2; {7714#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:49,352 INFO L273 TraceCheckUtils]: 34: Hoare triple {7714#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7724#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:49,352 INFO L273 TraceCheckUtils]: 35: Hoare triple {7724#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {7724#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:49,353 INFO L273 TraceCheckUtils]: 36: Hoare triple {7724#(<= main_~i~0 1)} assume !(0 != #t~nondet2);havoc #t~nondet2; {7724#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:49,353 INFO L273 TraceCheckUtils]: 37: Hoare triple {7724#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7734#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:49,353 INFO L273 TraceCheckUtils]: 38: Hoare triple {7734#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {7734#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:49,365 INFO L273 TraceCheckUtils]: 39: Hoare triple {7734#(<= main_~i~0 2)} assume !(0 != #t~nondet2);havoc #t~nondet2; {7734#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:49,366 INFO L273 TraceCheckUtils]: 40: Hoare triple {7734#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7744#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:49,366 INFO L273 TraceCheckUtils]: 41: Hoare triple {7744#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {7744#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:49,366 INFO L273 TraceCheckUtils]: 42: Hoare triple {7744#(<= main_~i~0 3)} assume !(0 != #t~nondet2);havoc #t~nondet2; {7744#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:49,367 INFO L273 TraceCheckUtils]: 43: Hoare triple {7744#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7754#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:49,367 INFO L273 TraceCheckUtils]: 44: Hoare triple {7754#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {7754#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:49,368 INFO L273 TraceCheckUtils]: 45: Hoare triple {7754#(<= main_~i~0 4)} assume !(0 != #t~nondet2);havoc #t~nondet2; {7754#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:49,368 INFO L273 TraceCheckUtils]: 46: Hoare triple {7754#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7764#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:49,368 INFO L273 TraceCheckUtils]: 47: Hoare triple {7764#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {7764#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:49,369 INFO L273 TraceCheckUtils]: 48: Hoare triple {7764#(<= main_~i~0 5)} assume !(0 != #t~nondet2);havoc #t~nondet2; {7764#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:49,370 INFO L273 TraceCheckUtils]: 49: Hoare triple {7764#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7774#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:49,370 INFO L273 TraceCheckUtils]: 50: Hoare triple {7774#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {7774#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:49,371 INFO L273 TraceCheckUtils]: 51: Hoare triple {7774#(<= main_~i~0 6)} assume !(0 != #t~nondet2);havoc #t~nondet2; {7774#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:49,372 INFO L273 TraceCheckUtils]: 52: Hoare triple {7774#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7784#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:49,372 INFO L273 TraceCheckUtils]: 53: Hoare triple {7784#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {7784#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:49,373 INFO L273 TraceCheckUtils]: 54: Hoare triple {7784#(<= main_~i~0 7)} assume !(0 != #t~nondet2);havoc #t~nondet2; {7784#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:49,373 INFO L273 TraceCheckUtils]: 55: Hoare triple {7784#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7794#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:49,374 INFO L273 TraceCheckUtils]: 56: Hoare triple {7794#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {7794#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:49,376 INFO L273 TraceCheckUtils]: 57: Hoare triple {7794#(<= main_~i~0 8)} assume !(0 != #t~nondet2);havoc #t~nondet2; {7794#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:49,377 INFO L273 TraceCheckUtils]: 58: Hoare triple {7794#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7804#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:49,377 INFO L273 TraceCheckUtils]: 59: Hoare triple {7804#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {7804#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:49,378 INFO L273 TraceCheckUtils]: 60: Hoare triple {7804#(<= main_~i~0 9)} assume !(0 != #t~nondet2);havoc #t~nondet2; {7804#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:49,379 INFO L273 TraceCheckUtils]: 61: Hoare triple {7804#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7814#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:49,379 INFO L273 TraceCheckUtils]: 62: Hoare triple {7814#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {7814#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:49,379 INFO L273 TraceCheckUtils]: 63: Hoare triple {7814#(<= main_~i~0 10)} assume !(0 != #t~nondet2);havoc #t~nondet2; {7814#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:49,380 INFO L273 TraceCheckUtils]: 64: Hoare triple {7814#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7824#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:49,380 INFO L273 TraceCheckUtils]: 65: Hoare triple {7824#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {7824#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:49,380 INFO L273 TraceCheckUtils]: 66: Hoare triple {7824#(<= main_~i~0 11)} assume !(0 != #t~nondet2);havoc #t~nondet2; {7824#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:49,381 INFO L273 TraceCheckUtils]: 67: Hoare triple {7824#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7834#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:49,382 INFO L273 TraceCheckUtils]: 68: Hoare triple {7834#(<= main_~i~0 12)} assume !(~i~0 < 100000); {7617#false} is VALID [2018-11-23 12:11:49,382 INFO L273 TraceCheckUtils]: 69: Hoare triple {7617#false} ~i~0 := 0; {7617#false} is VALID [2018-11-23 12:11:49,382 INFO L273 TraceCheckUtils]: 70: Hoare triple {7617#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem5 == #t~mem6; {7617#false} is VALID [2018-11-23 12:11:49,383 INFO L273 TraceCheckUtils]: 71: Hoare triple {7617#false} assume !#t~short10;call #t~mem9 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 == #t~mem7 * #t~mem8; {7617#false} is VALID [2018-11-23 12:11:49,383 INFO L256 TraceCheckUtils]: 72: Hoare triple {7617#false} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {7617#false} is VALID [2018-11-23 12:11:49,383 INFO L273 TraceCheckUtils]: 73: Hoare triple {7617#false} ~cond := #in~cond; {7617#false} is VALID [2018-11-23 12:11:49,383 INFO L273 TraceCheckUtils]: 74: Hoare triple {7617#false} assume 0 == ~cond; {7617#false} is VALID [2018-11-23 12:11:49,384 INFO L273 TraceCheckUtils]: 75: Hoare triple {7617#false} assume !false; {7617#false} is VALID [2018-11-23 12:11:49,387 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-23 12:11:49,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:11:49,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-11-23 12:11:49,408 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 76 [2018-11-23 12:11:49,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:49,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:11:49,460 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:49,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:11:49,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:11:49,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:11:49,461 INFO L87 Difference]: Start difference. First operand 86 states and 101 transitions. Second operand 15 states. [2018-11-23 12:11:51,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:51,392 INFO L93 Difference]: Finished difference Result 227 states and 299 transitions. [2018-11-23 12:11:51,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:11:51,393 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 76 [2018-11-23 12:11:51,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:51,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:11:51,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 218 transitions. [2018-11-23 12:11:51,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:11:51,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 218 transitions. [2018-11-23 12:11:51,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 218 transitions. [2018-11-23 12:11:52,051 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:52,055 INFO L225 Difference]: With dead ends: 227 [2018-11-23 12:11:52,055 INFO L226 Difference]: Without dead ends: 172 [2018-11-23 12:11:52,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:11:52,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-23 12:11:52,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 91. [2018-11-23 12:11:52,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:52,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand 91 states. [2018-11-23 12:11:52,118 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand 91 states. [2018-11-23 12:11:52,118 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 91 states. [2018-11-23 12:11:52,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:52,126 INFO L93 Difference]: Finished difference Result 172 states and 228 transitions. [2018-11-23 12:11:52,126 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 228 transitions. [2018-11-23 12:11:52,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:52,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:52,128 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 172 states. [2018-11-23 12:11:52,128 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 172 states. [2018-11-23 12:11:52,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:52,135 INFO L93 Difference]: Finished difference Result 172 states and 228 transitions. [2018-11-23 12:11:52,135 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 228 transitions. [2018-11-23 12:11:52,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:52,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:52,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:52,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:52,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-23 12:11:52,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2018-11-23 12:11:52,139 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 76 [2018-11-23 12:11:52,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:52,140 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2018-11-23 12:11:52,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:11:52,140 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2018-11-23 12:11:52,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 12:11:52,141 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:52,141 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:52,141 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:52,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:52,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1140584155, now seen corresponding path program 13 times [2018-11-23 12:11:52,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:52,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:52,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:52,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:11:52,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:52,165 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:11:52,165 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:11:52,165 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:11:52,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:11:52,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:52,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:11:52,973 INFO L256 TraceCheckUtils]: 0: Hoare triple {8651#true} call ULTIMATE.init(); {8651#true} is VALID [2018-11-23 12:11:52,973 INFO L273 TraceCheckUtils]: 1: Hoare triple {8651#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8651#true} is VALID [2018-11-23 12:11:52,974 INFO L273 TraceCheckUtils]: 2: Hoare triple {8651#true} assume true; {8651#true} is VALID [2018-11-23 12:11:52,974 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8651#true} {8651#true} #74#return; {8651#true} is VALID [2018-11-23 12:11:52,974 INFO L256 TraceCheckUtils]: 4: Hoare triple {8651#true} call #t~ret11 := main(); {8651#true} is VALID [2018-11-23 12:11:52,976 INFO L273 TraceCheckUtils]: 5: Hoare triple {8651#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);havoc ~k~0;havoc ~i~0;~i~0 := 0; {8671#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:52,976 INFO L273 TraceCheckUtils]: 6: Hoare triple {8671#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8671#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:52,977 INFO L273 TraceCheckUtils]: 7: Hoare triple {8671#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8678#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:52,977 INFO L273 TraceCheckUtils]: 8: Hoare triple {8678#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8678#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:52,978 INFO L273 TraceCheckUtils]: 9: Hoare triple {8678#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8685#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:52,978 INFO L273 TraceCheckUtils]: 10: Hoare triple {8685#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8685#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:52,979 INFO L273 TraceCheckUtils]: 11: Hoare triple {8685#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8692#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:52,980 INFO L273 TraceCheckUtils]: 12: Hoare triple {8692#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8692#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:52,981 INFO L273 TraceCheckUtils]: 13: Hoare triple {8692#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8699#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:52,982 INFO L273 TraceCheckUtils]: 14: Hoare triple {8699#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8699#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:52,983 INFO L273 TraceCheckUtils]: 15: Hoare triple {8699#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8706#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:52,983 INFO L273 TraceCheckUtils]: 16: Hoare triple {8706#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8706#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:52,984 INFO L273 TraceCheckUtils]: 17: Hoare triple {8706#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8713#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:52,985 INFO L273 TraceCheckUtils]: 18: Hoare triple {8713#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8713#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:52,986 INFO L273 TraceCheckUtils]: 19: Hoare triple {8713#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8720#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:52,986 INFO L273 TraceCheckUtils]: 20: Hoare triple {8720#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8720#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:52,987 INFO L273 TraceCheckUtils]: 21: Hoare triple {8720#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8727#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:52,988 INFO L273 TraceCheckUtils]: 22: Hoare triple {8727#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8727#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:52,989 INFO L273 TraceCheckUtils]: 23: Hoare triple {8727#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8734#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:52,990 INFO L273 TraceCheckUtils]: 24: Hoare triple {8734#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8734#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:52,991 INFO L273 TraceCheckUtils]: 25: Hoare triple {8734#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8741#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:52,991 INFO L273 TraceCheckUtils]: 26: Hoare triple {8741#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8741#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:52,992 INFO L273 TraceCheckUtils]: 27: Hoare triple {8741#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8748#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:53,010 INFO L273 TraceCheckUtils]: 28: Hoare triple {8748#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8748#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:53,017 INFO L273 TraceCheckUtils]: 29: Hoare triple {8748#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8755#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:53,018 INFO L273 TraceCheckUtils]: 30: Hoare triple {8755#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {8755#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:53,018 INFO L273 TraceCheckUtils]: 31: Hoare triple {8755#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8762#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:53,019 INFO L273 TraceCheckUtils]: 32: Hoare triple {8762#(<= main_~i~0 13)} assume !(~i~0 < 100000); {8652#false} is VALID [2018-11-23 12:11:53,019 INFO L273 TraceCheckUtils]: 33: Hoare triple {8652#false} ~i~0 := 0; {8652#false} is VALID [2018-11-23 12:11:53,019 INFO L273 TraceCheckUtils]: 34: Hoare triple {8652#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {8652#false} is VALID [2018-11-23 12:11:53,019 INFO L273 TraceCheckUtils]: 35: Hoare triple {8652#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {8652#false} is VALID [2018-11-23 12:11:53,020 INFO L273 TraceCheckUtils]: 36: Hoare triple {8652#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8652#false} is VALID [2018-11-23 12:11:53,020 INFO L273 TraceCheckUtils]: 37: Hoare triple {8652#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {8652#false} is VALID [2018-11-23 12:11:53,020 INFO L273 TraceCheckUtils]: 38: Hoare triple {8652#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {8652#false} is VALID [2018-11-23 12:11:53,020 INFO L273 TraceCheckUtils]: 39: Hoare triple {8652#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8652#false} is VALID [2018-11-23 12:11:53,020 INFO L273 TraceCheckUtils]: 40: Hoare triple {8652#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {8652#false} is VALID [2018-11-23 12:11:53,021 INFO L273 TraceCheckUtils]: 41: Hoare triple {8652#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {8652#false} is VALID [2018-11-23 12:11:53,021 INFO L273 TraceCheckUtils]: 42: Hoare triple {8652#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8652#false} is VALID [2018-11-23 12:11:53,021 INFO L273 TraceCheckUtils]: 43: Hoare triple {8652#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {8652#false} is VALID [2018-11-23 12:11:53,021 INFO L273 TraceCheckUtils]: 44: Hoare triple {8652#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {8652#false} is VALID [2018-11-23 12:11:53,022 INFO L273 TraceCheckUtils]: 45: Hoare triple {8652#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8652#false} is VALID [2018-11-23 12:11:53,022 INFO L273 TraceCheckUtils]: 46: Hoare triple {8652#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {8652#false} is VALID [2018-11-23 12:11:53,022 INFO L273 TraceCheckUtils]: 47: Hoare triple {8652#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {8652#false} is VALID [2018-11-23 12:11:53,022 INFO L273 TraceCheckUtils]: 48: Hoare triple {8652#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8652#false} is VALID [2018-11-23 12:11:53,023 INFO L273 TraceCheckUtils]: 49: Hoare triple {8652#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {8652#false} is VALID [2018-11-23 12:11:53,023 INFO L273 TraceCheckUtils]: 50: Hoare triple {8652#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {8652#false} is VALID [2018-11-23 12:11:53,023 INFO L273 TraceCheckUtils]: 51: Hoare triple {8652#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8652#false} is VALID [2018-11-23 12:11:53,023 INFO L273 TraceCheckUtils]: 52: Hoare triple {8652#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {8652#false} is VALID [2018-11-23 12:11:53,024 INFO L273 TraceCheckUtils]: 53: Hoare triple {8652#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {8652#false} is VALID [2018-11-23 12:11:53,024 INFO L273 TraceCheckUtils]: 54: Hoare triple {8652#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8652#false} is VALID [2018-11-23 12:11:53,024 INFO L273 TraceCheckUtils]: 55: Hoare triple {8652#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {8652#false} is VALID [2018-11-23 12:11:53,024 INFO L273 TraceCheckUtils]: 56: Hoare triple {8652#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {8652#false} is VALID [2018-11-23 12:11:53,024 INFO L273 TraceCheckUtils]: 57: Hoare triple {8652#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8652#false} is VALID [2018-11-23 12:11:53,024 INFO L273 TraceCheckUtils]: 58: Hoare triple {8652#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {8652#false} is VALID [2018-11-23 12:11:53,025 INFO L273 TraceCheckUtils]: 59: Hoare triple {8652#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {8652#false} is VALID [2018-11-23 12:11:53,025 INFO L273 TraceCheckUtils]: 60: Hoare triple {8652#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8652#false} is VALID [2018-11-23 12:11:53,025 INFO L273 TraceCheckUtils]: 61: Hoare triple {8652#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {8652#false} is VALID [2018-11-23 12:11:53,025 INFO L273 TraceCheckUtils]: 62: Hoare triple {8652#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {8652#false} is VALID [2018-11-23 12:11:53,025 INFO L273 TraceCheckUtils]: 63: Hoare triple {8652#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8652#false} is VALID [2018-11-23 12:11:53,025 INFO L273 TraceCheckUtils]: 64: Hoare triple {8652#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {8652#false} is VALID [2018-11-23 12:11:53,025 INFO L273 TraceCheckUtils]: 65: Hoare triple {8652#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {8652#false} is VALID [2018-11-23 12:11:53,026 INFO L273 TraceCheckUtils]: 66: Hoare triple {8652#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8652#false} is VALID [2018-11-23 12:11:53,026 INFO L273 TraceCheckUtils]: 67: Hoare triple {8652#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {8652#false} is VALID [2018-11-23 12:11:53,026 INFO L273 TraceCheckUtils]: 68: Hoare triple {8652#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {8652#false} is VALID [2018-11-23 12:11:53,026 INFO L273 TraceCheckUtils]: 69: Hoare triple {8652#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8652#false} is VALID [2018-11-23 12:11:53,026 INFO L273 TraceCheckUtils]: 70: Hoare triple {8652#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {8652#false} is VALID [2018-11-23 12:11:53,026 INFO L273 TraceCheckUtils]: 71: Hoare triple {8652#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {8652#false} is VALID [2018-11-23 12:11:53,027 INFO L273 TraceCheckUtils]: 72: Hoare triple {8652#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8652#false} is VALID [2018-11-23 12:11:53,027 INFO L273 TraceCheckUtils]: 73: Hoare triple {8652#false} assume !(~i~0 < 100000); {8652#false} is VALID [2018-11-23 12:11:53,027 INFO L273 TraceCheckUtils]: 74: Hoare triple {8652#false} ~i~0 := 0; {8652#false} is VALID [2018-11-23 12:11:53,048 INFO L273 TraceCheckUtils]: 75: Hoare triple {8652#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem5 == #t~mem6; {8652#false} is VALID [2018-11-23 12:11:53,048 INFO L273 TraceCheckUtils]: 76: Hoare triple {8652#false} assume !#t~short10;call #t~mem9 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 == #t~mem7 * #t~mem8; {8652#false} is VALID [2018-11-23 12:11:53,048 INFO L256 TraceCheckUtils]: 77: Hoare triple {8652#false} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {8652#false} is VALID [2018-11-23 12:11:53,049 INFO L273 TraceCheckUtils]: 78: Hoare triple {8652#false} ~cond := #in~cond; {8652#false} is VALID [2018-11-23 12:11:53,049 INFO L273 TraceCheckUtils]: 79: Hoare triple {8652#false} assume 0 == ~cond; {8652#false} is VALID [2018-11-23 12:11:53,049 INFO L273 TraceCheckUtils]: 80: Hoare triple {8652#false} assume !false; {8652#false} is VALID [2018-11-23 12:11:53,054 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-11-23 12:11:53,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:11:53,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-11-23 12:11:53,073 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 81 [2018-11-23 12:11:53,074 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:53,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 12:11:53,128 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:53,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 12:11:53,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 12:11:53,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:11:53,129 INFO L87 Difference]: Start difference. First operand 91 states and 107 transitions. Second operand 16 states. [2018-11-23 12:11:54,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:54,329 INFO L93 Difference]: Finished difference Result 241 states and 318 transitions. [2018-11-23 12:11:54,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:11:54,329 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 81 [2018-11-23 12:11:54,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:54,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:11:54,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 231 transitions. [2018-11-23 12:11:54,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:11:54,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 231 transitions. [2018-11-23 12:11:54,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 231 transitions. [2018-11-23 12:11:54,691 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 231 edges. 231 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:54,696 INFO L225 Difference]: With dead ends: 241 [2018-11-23 12:11:54,697 INFO L226 Difference]: Without dead ends: 183 [2018-11-23 12:11:54,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:11:54,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-23 12:11:54,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 96. [2018-11-23 12:11:54,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:54,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand 96 states. [2018-11-23 12:11:54,777 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand 96 states. [2018-11-23 12:11:54,777 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 96 states. [2018-11-23 12:11:54,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:54,783 INFO L93 Difference]: Finished difference Result 183 states and 243 transitions. [2018-11-23 12:11:54,783 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 243 transitions. [2018-11-23 12:11:54,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:54,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:54,784 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 183 states. [2018-11-23 12:11:54,784 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 183 states. [2018-11-23 12:11:54,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:54,790 INFO L93 Difference]: Finished difference Result 183 states and 243 transitions. [2018-11-23 12:11:54,790 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 243 transitions. [2018-11-23 12:11:54,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:54,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:54,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:54,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:54,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 12:11:54,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 113 transitions. [2018-11-23 12:11:54,793 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 113 transitions. Word has length 81 [2018-11-23 12:11:54,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:54,794 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 113 transitions. [2018-11-23 12:11:54,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 12:11:54,794 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 113 transitions. [2018-11-23 12:11:54,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-23 12:11:54,795 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:54,795 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:54,795 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:54,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:54,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1561365788, now seen corresponding path program 14 times [2018-11-23 12:11:54,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:54,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:54,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:54,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:11:54,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:54,816 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:11:54,816 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:11:54,817 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:11:54,838 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:11:54,875 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:11:54,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:11:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:54,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:11:55,489 INFO L256 TraceCheckUtils]: 0: Hoare triple {9751#true} call ULTIMATE.init(); {9751#true} is VALID [2018-11-23 12:11:55,489 INFO L273 TraceCheckUtils]: 1: Hoare triple {9751#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9751#true} is VALID [2018-11-23 12:11:55,490 INFO L273 TraceCheckUtils]: 2: Hoare triple {9751#true} assume true; {9751#true} is VALID [2018-11-23 12:11:55,490 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9751#true} {9751#true} #74#return; {9751#true} is VALID [2018-11-23 12:11:55,490 INFO L256 TraceCheckUtils]: 4: Hoare triple {9751#true} call #t~ret11 := main(); {9751#true} is VALID [2018-11-23 12:11:55,490 INFO L273 TraceCheckUtils]: 5: Hoare triple {9751#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);havoc ~k~0;havoc ~i~0;~i~0 := 0; {9771#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:55,491 INFO L273 TraceCheckUtils]: 6: Hoare triple {9771#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9771#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:55,492 INFO L273 TraceCheckUtils]: 7: Hoare triple {9771#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9778#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:55,492 INFO L273 TraceCheckUtils]: 8: Hoare triple {9778#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9778#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:55,493 INFO L273 TraceCheckUtils]: 9: Hoare triple {9778#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9785#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:55,493 INFO L273 TraceCheckUtils]: 10: Hoare triple {9785#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9785#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:55,494 INFO L273 TraceCheckUtils]: 11: Hoare triple {9785#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9792#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:55,495 INFO L273 TraceCheckUtils]: 12: Hoare triple {9792#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9792#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:55,495 INFO L273 TraceCheckUtils]: 13: Hoare triple {9792#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9799#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:55,496 INFO L273 TraceCheckUtils]: 14: Hoare triple {9799#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9799#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:55,497 INFO L273 TraceCheckUtils]: 15: Hoare triple {9799#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9806#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:55,497 INFO L273 TraceCheckUtils]: 16: Hoare triple {9806#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9806#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:55,498 INFO L273 TraceCheckUtils]: 17: Hoare triple {9806#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9813#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:55,499 INFO L273 TraceCheckUtils]: 18: Hoare triple {9813#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9813#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:55,499 INFO L273 TraceCheckUtils]: 19: Hoare triple {9813#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9820#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:55,500 INFO L273 TraceCheckUtils]: 20: Hoare triple {9820#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9820#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:55,501 INFO L273 TraceCheckUtils]: 21: Hoare triple {9820#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9827#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:55,501 INFO L273 TraceCheckUtils]: 22: Hoare triple {9827#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9827#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:55,502 INFO L273 TraceCheckUtils]: 23: Hoare triple {9827#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9834#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:55,503 INFO L273 TraceCheckUtils]: 24: Hoare triple {9834#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9834#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:55,503 INFO L273 TraceCheckUtils]: 25: Hoare triple {9834#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9841#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:55,504 INFO L273 TraceCheckUtils]: 26: Hoare triple {9841#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9841#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:55,505 INFO L273 TraceCheckUtils]: 27: Hoare triple {9841#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9848#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:55,505 INFO L273 TraceCheckUtils]: 28: Hoare triple {9848#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9848#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:55,506 INFO L273 TraceCheckUtils]: 29: Hoare triple {9848#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9855#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:55,507 INFO L273 TraceCheckUtils]: 30: Hoare triple {9855#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9855#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:55,507 INFO L273 TraceCheckUtils]: 31: Hoare triple {9855#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9862#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:55,508 INFO L273 TraceCheckUtils]: 32: Hoare triple {9862#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {9862#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:55,509 INFO L273 TraceCheckUtils]: 33: Hoare triple {9862#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9869#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:55,509 INFO L273 TraceCheckUtils]: 34: Hoare triple {9869#(<= main_~i~0 14)} assume !(~i~0 < 100000); {9752#false} is VALID [2018-11-23 12:11:55,510 INFO L273 TraceCheckUtils]: 35: Hoare triple {9752#false} ~i~0 := 0; {9752#false} is VALID [2018-11-23 12:11:55,510 INFO L273 TraceCheckUtils]: 36: Hoare triple {9752#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {9752#false} is VALID [2018-11-23 12:11:55,510 INFO L273 TraceCheckUtils]: 37: Hoare triple {9752#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {9752#false} is VALID [2018-11-23 12:11:55,510 INFO L273 TraceCheckUtils]: 38: Hoare triple {9752#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9752#false} is VALID [2018-11-23 12:11:55,510 INFO L273 TraceCheckUtils]: 39: Hoare triple {9752#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {9752#false} is VALID [2018-11-23 12:11:55,511 INFO L273 TraceCheckUtils]: 40: Hoare triple {9752#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {9752#false} is VALID [2018-11-23 12:11:55,511 INFO L273 TraceCheckUtils]: 41: Hoare triple {9752#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9752#false} is VALID [2018-11-23 12:11:55,511 INFO L273 TraceCheckUtils]: 42: Hoare triple {9752#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {9752#false} is VALID [2018-11-23 12:11:55,511 INFO L273 TraceCheckUtils]: 43: Hoare triple {9752#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {9752#false} is VALID [2018-11-23 12:11:55,511 INFO L273 TraceCheckUtils]: 44: Hoare triple {9752#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9752#false} is VALID [2018-11-23 12:11:55,512 INFO L273 TraceCheckUtils]: 45: Hoare triple {9752#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {9752#false} is VALID [2018-11-23 12:11:55,512 INFO L273 TraceCheckUtils]: 46: Hoare triple {9752#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {9752#false} is VALID [2018-11-23 12:11:55,512 INFO L273 TraceCheckUtils]: 47: Hoare triple {9752#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9752#false} is VALID [2018-11-23 12:11:55,512 INFO L273 TraceCheckUtils]: 48: Hoare triple {9752#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {9752#false} is VALID [2018-11-23 12:11:55,512 INFO L273 TraceCheckUtils]: 49: Hoare triple {9752#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {9752#false} is VALID [2018-11-23 12:11:55,512 INFO L273 TraceCheckUtils]: 50: Hoare triple {9752#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9752#false} is VALID [2018-11-23 12:11:55,513 INFO L273 TraceCheckUtils]: 51: Hoare triple {9752#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {9752#false} is VALID [2018-11-23 12:11:55,513 INFO L273 TraceCheckUtils]: 52: Hoare triple {9752#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {9752#false} is VALID [2018-11-23 12:11:55,513 INFO L273 TraceCheckUtils]: 53: Hoare triple {9752#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9752#false} is VALID [2018-11-23 12:11:55,513 INFO L273 TraceCheckUtils]: 54: Hoare triple {9752#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {9752#false} is VALID [2018-11-23 12:11:55,513 INFO L273 TraceCheckUtils]: 55: Hoare triple {9752#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {9752#false} is VALID [2018-11-23 12:11:55,513 INFO L273 TraceCheckUtils]: 56: Hoare triple {9752#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9752#false} is VALID [2018-11-23 12:11:55,513 INFO L273 TraceCheckUtils]: 57: Hoare triple {9752#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {9752#false} is VALID [2018-11-23 12:11:55,513 INFO L273 TraceCheckUtils]: 58: Hoare triple {9752#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {9752#false} is VALID [2018-11-23 12:11:55,513 INFO L273 TraceCheckUtils]: 59: Hoare triple {9752#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9752#false} is VALID [2018-11-23 12:11:55,514 INFO L273 TraceCheckUtils]: 60: Hoare triple {9752#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {9752#false} is VALID [2018-11-23 12:11:55,514 INFO L273 TraceCheckUtils]: 61: Hoare triple {9752#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {9752#false} is VALID [2018-11-23 12:11:55,514 INFO L273 TraceCheckUtils]: 62: Hoare triple {9752#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9752#false} is VALID [2018-11-23 12:11:55,514 INFO L273 TraceCheckUtils]: 63: Hoare triple {9752#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {9752#false} is VALID [2018-11-23 12:11:55,514 INFO L273 TraceCheckUtils]: 64: Hoare triple {9752#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {9752#false} is VALID [2018-11-23 12:11:55,515 INFO L273 TraceCheckUtils]: 65: Hoare triple {9752#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9752#false} is VALID [2018-11-23 12:11:55,515 INFO L273 TraceCheckUtils]: 66: Hoare triple {9752#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {9752#false} is VALID [2018-11-23 12:11:55,515 INFO L273 TraceCheckUtils]: 67: Hoare triple {9752#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {9752#false} is VALID [2018-11-23 12:11:55,515 INFO L273 TraceCheckUtils]: 68: Hoare triple {9752#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9752#false} is VALID [2018-11-23 12:11:55,515 INFO L273 TraceCheckUtils]: 69: Hoare triple {9752#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {9752#false} is VALID [2018-11-23 12:11:55,515 INFO L273 TraceCheckUtils]: 70: Hoare triple {9752#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {9752#false} is VALID [2018-11-23 12:11:55,516 INFO L273 TraceCheckUtils]: 71: Hoare triple {9752#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9752#false} is VALID [2018-11-23 12:11:55,516 INFO L273 TraceCheckUtils]: 72: Hoare triple {9752#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {9752#false} is VALID [2018-11-23 12:11:55,516 INFO L273 TraceCheckUtils]: 73: Hoare triple {9752#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {9752#false} is VALID [2018-11-23 12:11:55,516 INFO L273 TraceCheckUtils]: 74: Hoare triple {9752#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9752#false} is VALID [2018-11-23 12:11:55,516 INFO L273 TraceCheckUtils]: 75: Hoare triple {9752#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {9752#false} is VALID [2018-11-23 12:11:55,517 INFO L273 TraceCheckUtils]: 76: Hoare triple {9752#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {9752#false} is VALID [2018-11-23 12:11:55,517 INFO L273 TraceCheckUtils]: 77: Hoare triple {9752#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9752#false} is VALID [2018-11-23 12:11:55,517 INFO L273 TraceCheckUtils]: 78: Hoare triple {9752#false} assume !(~i~0 < 100000); {9752#false} is VALID [2018-11-23 12:11:55,517 INFO L273 TraceCheckUtils]: 79: Hoare triple {9752#false} ~i~0 := 0; {9752#false} is VALID [2018-11-23 12:11:55,517 INFO L273 TraceCheckUtils]: 80: Hoare triple {9752#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem5 == #t~mem6; {9752#false} is VALID [2018-11-23 12:11:55,517 INFO L273 TraceCheckUtils]: 81: Hoare triple {9752#false} assume !#t~short10;call #t~mem9 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 == #t~mem7 * #t~mem8; {9752#false} is VALID [2018-11-23 12:11:55,518 INFO L256 TraceCheckUtils]: 82: Hoare triple {9752#false} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {9752#false} is VALID [2018-11-23 12:11:55,518 INFO L273 TraceCheckUtils]: 83: Hoare triple {9752#false} ~cond := #in~cond; {9752#false} is VALID [2018-11-23 12:11:55,518 INFO L273 TraceCheckUtils]: 84: Hoare triple {9752#false} assume 0 == ~cond; {9752#false} is VALID [2018-11-23 12:11:55,518 INFO L273 TraceCheckUtils]: 85: Hoare triple {9752#false} assume !false; {9752#false} is VALID [2018-11-23 12:11:55,523 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2018-11-23 12:11:55,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:11:55,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-11-23 12:11:55,553 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 86 [2018-11-23 12:11:55,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:55,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:11:55,674 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:55,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:11:55,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:11:55,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:11:55,675 INFO L87 Difference]: Start difference. First operand 96 states and 113 transitions. Second operand 17 states. [2018-11-23 12:11:57,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:57,323 INFO L93 Difference]: Finished difference Result 255 states and 337 transitions. [2018-11-23 12:11:57,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:11:57,323 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 86 [2018-11-23 12:11:57,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:57,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:11:57,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 244 transitions. [2018-11-23 12:11:57,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:11:57,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 244 transitions. [2018-11-23 12:11:57,330 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 244 transitions. [2018-11-23 12:11:57,579 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 244 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:57,585 INFO L225 Difference]: With dead ends: 255 [2018-11-23 12:11:57,585 INFO L226 Difference]: Without dead ends: 194 [2018-11-23 12:11:57,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:11:57,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-23 12:11:57,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 101. [2018-11-23 12:11:57,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:57,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand 101 states. [2018-11-23 12:11:57,698 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 101 states. [2018-11-23 12:11:57,698 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 101 states. [2018-11-23 12:11:57,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:57,703 INFO L93 Difference]: Finished difference Result 194 states and 258 transitions. [2018-11-23 12:11:57,704 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 258 transitions. [2018-11-23 12:11:57,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:57,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:57,705 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 194 states. [2018-11-23 12:11:57,705 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 194 states. [2018-11-23 12:11:57,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:57,711 INFO L93 Difference]: Finished difference Result 194 states and 258 transitions. [2018-11-23 12:11:57,711 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 258 transitions. [2018-11-23 12:11:57,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:57,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:57,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:57,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:57,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-23 12:11:57,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 119 transitions. [2018-11-23 12:11:57,714 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 119 transitions. Word has length 86 [2018-11-23 12:11:57,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:57,715 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 119 transitions. [2018-11-23 12:11:57,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:11:57,715 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 119 transitions. [2018-11-23 12:11:57,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 12:11:57,716 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:57,716 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:57,716 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:57,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:57,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1552853825, now seen corresponding path program 15 times [2018-11-23 12:11:57,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:57,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:57,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:57,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:11:57,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:57,735 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:11:57,735 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:11:57,735 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:11:57,754 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:11:58,538 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-23 12:11:58,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:11:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:58,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:11:58,873 INFO L256 TraceCheckUtils]: 0: Hoare triple {10916#true} call ULTIMATE.init(); {10916#true} is VALID [2018-11-23 12:11:58,873 INFO L273 TraceCheckUtils]: 1: Hoare triple {10916#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10916#true} is VALID [2018-11-23 12:11:58,874 INFO L273 TraceCheckUtils]: 2: Hoare triple {10916#true} assume true; {10916#true} is VALID [2018-11-23 12:11:58,874 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10916#true} {10916#true} #74#return; {10916#true} is VALID [2018-11-23 12:11:58,874 INFO L256 TraceCheckUtils]: 4: Hoare triple {10916#true} call #t~ret11 := main(); {10916#true} is VALID [2018-11-23 12:11:58,874 INFO L273 TraceCheckUtils]: 5: Hoare triple {10916#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);havoc ~k~0;havoc ~i~0;~i~0 := 0; {10916#true} is VALID [2018-11-23 12:11:58,875 INFO L273 TraceCheckUtils]: 6: Hoare triple {10916#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10916#true} is VALID [2018-11-23 12:11:58,875 INFO L273 TraceCheckUtils]: 7: Hoare triple {10916#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10916#true} is VALID [2018-11-23 12:11:58,875 INFO L273 TraceCheckUtils]: 8: Hoare triple {10916#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10916#true} is VALID [2018-11-23 12:11:58,875 INFO L273 TraceCheckUtils]: 9: Hoare triple {10916#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10916#true} is VALID [2018-11-23 12:11:58,875 INFO L273 TraceCheckUtils]: 10: Hoare triple {10916#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10916#true} is VALID [2018-11-23 12:11:58,875 INFO L273 TraceCheckUtils]: 11: Hoare triple {10916#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10916#true} is VALID [2018-11-23 12:11:58,875 INFO L273 TraceCheckUtils]: 12: Hoare triple {10916#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10916#true} is VALID [2018-11-23 12:11:58,875 INFO L273 TraceCheckUtils]: 13: Hoare triple {10916#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10916#true} is VALID [2018-11-23 12:11:58,876 INFO L273 TraceCheckUtils]: 14: Hoare triple {10916#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10916#true} is VALID [2018-11-23 12:11:58,876 INFO L273 TraceCheckUtils]: 15: Hoare triple {10916#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10916#true} is VALID [2018-11-23 12:11:58,876 INFO L273 TraceCheckUtils]: 16: Hoare triple {10916#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10916#true} is VALID [2018-11-23 12:11:58,876 INFO L273 TraceCheckUtils]: 17: Hoare triple {10916#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10916#true} is VALID [2018-11-23 12:11:58,876 INFO L273 TraceCheckUtils]: 18: Hoare triple {10916#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10916#true} is VALID [2018-11-23 12:11:58,876 INFO L273 TraceCheckUtils]: 19: Hoare triple {10916#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10916#true} is VALID [2018-11-23 12:11:58,876 INFO L273 TraceCheckUtils]: 20: Hoare triple {10916#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10916#true} is VALID [2018-11-23 12:11:58,876 INFO L273 TraceCheckUtils]: 21: Hoare triple {10916#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10916#true} is VALID [2018-11-23 12:11:58,877 INFO L273 TraceCheckUtils]: 22: Hoare triple {10916#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10916#true} is VALID [2018-11-23 12:11:58,877 INFO L273 TraceCheckUtils]: 23: Hoare triple {10916#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10916#true} is VALID [2018-11-23 12:11:58,877 INFO L273 TraceCheckUtils]: 24: Hoare triple {10916#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10916#true} is VALID [2018-11-23 12:11:58,877 INFO L273 TraceCheckUtils]: 25: Hoare triple {10916#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10916#true} is VALID [2018-11-23 12:11:58,877 INFO L273 TraceCheckUtils]: 26: Hoare triple {10916#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10916#true} is VALID [2018-11-23 12:11:58,877 INFO L273 TraceCheckUtils]: 27: Hoare triple {10916#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10916#true} is VALID [2018-11-23 12:11:58,877 INFO L273 TraceCheckUtils]: 28: Hoare triple {10916#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10916#true} is VALID [2018-11-23 12:11:58,877 INFO L273 TraceCheckUtils]: 29: Hoare triple {10916#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10916#true} is VALID [2018-11-23 12:11:58,878 INFO L273 TraceCheckUtils]: 30: Hoare triple {10916#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10916#true} is VALID [2018-11-23 12:11:58,878 INFO L273 TraceCheckUtils]: 31: Hoare triple {10916#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10916#true} is VALID [2018-11-23 12:11:58,878 INFO L273 TraceCheckUtils]: 32: Hoare triple {10916#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10916#true} is VALID [2018-11-23 12:11:58,878 INFO L273 TraceCheckUtils]: 33: Hoare triple {10916#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10916#true} is VALID [2018-11-23 12:11:58,878 INFO L273 TraceCheckUtils]: 34: Hoare triple {10916#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {10916#true} is VALID [2018-11-23 12:11:58,878 INFO L273 TraceCheckUtils]: 35: Hoare triple {10916#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10916#true} is VALID [2018-11-23 12:11:58,878 INFO L273 TraceCheckUtils]: 36: Hoare triple {10916#true} assume !(~i~0 < 100000); {10916#true} is VALID [2018-11-23 12:11:58,879 INFO L273 TraceCheckUtils]: 37: Hoare triple {10916#true} ~i~0 := 0; {11032#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:58,879 INFO L273 TraceCheckUtils]: 38: Hoare triple {11032#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {11032#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:58,879 INFO L273 TraceCheckUtils]: 39: Hoare triple {11032#(<= main_~i~0 0)} assume !(0 != #t~nondet2);havoc #t~nondet2; {11032#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:58,880 INFO L273 TraceCheckUtils]: 40: Hoare triple {11032#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11042#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:58,880 INFO L273 TraceCheckUtils]: 41: Hoare triple {11042#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {11042#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:58,881 INFO L273 TraceCheckUtils]: 42: Hoare triple {11042#(<= main_~i~0 1)} assume !(0 != #t~nondet2);havoc #t~nondet2; {11042#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:58,881 INFO L273 TraceCheckUtils]: 43: Hoare triple {11042#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11052#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:58,881 INFO L273 TraceCheckUtils]: 44: Hoare triple {11052#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {11052#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:58,882 INFO L273 TraceCheckUtils]: 45: Hoare triple {11052#(<= main_~i~0 2)} assume !(0 != #t~nondet2);havoc #t~nondet2; {11052#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:58,882 INFO L273 TraceCheckUtils]: 46: Hoare triple {11052#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11062#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:58,883 INFO L273 TraceCheckUtils]: 47: Hoare triple {11062#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {11062#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:58,883 INFO L273 TraceCheckUtils]: 48: Hoare triple {11062#(<= main_~i~0 3)} assume !(0 != #t~nondet2);havoc #t~nondet2; {11062#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:58,884 INFO L273 TraceCheckUtils]: 49: Hoare triple {11062#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11072#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:58,884 INFO L273 TraceCheckUtils]: 50: Hoare triple {11072#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {11072#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:58,885 INFO L273 TraceCheckUtils]: 51: Hoare triple {11072#(<= main_~i~0 4)} assume !(0 != #t~nondet2);havoc #t~nondet2; {11072#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:58,886 INFO L273 TraceCheckUtils]: 52: Hoare triple {11072#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11082#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:58,886 INFO L273 TraceCheckUtils]: 53: Hoare triple {11082#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {11082#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:58,887 INFO L273 TraceCheckUtils]: 54: Hoare triple {11082#(<= main_~i~0 5)} assume !(0 != #t~nondet2);havoc #t~nondet2; {11082#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:58,888 INFO L273 TraceCheckUtils]: 55: Hoare triple {11082#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11092#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:58,888 INFO L273 TraceCheckUtils]: 56: Hoare triple {11092#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {11092#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:58,889 INFO L273 TraceCheckUtils]: 57: Hoare triple {11092#(<= main_~i~0 6)} assume !(0 != #t~nondet2);havoc #t~nondet2; {11092#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:58,890 INFO L273 TraceCheckUtils]: 58: Hoare triple {11092#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11102#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:58,890 INFO L273 TraceCheckUtils]: 59: Hoare triple {11102#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {11102#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:58,891 INFO L273 TraceCheckUtils]: 60: Hoare triple {11102#(<= main_~i~0 7)} assume !(0 != #t~nondet2);havoc #t~nondet2; {11102#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:58,891 INFO L273 TraceCheckUtils]: 61: Hoare triple {11102#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11112#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:58,892 INFO L273 TraceCheckUtils]: 62: Hoare triple {11112#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {11112#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:58,892 INFO L273 TraceCheckUtils]: 63: Hoare triple {11112#(<= main_~i~0 8)} assume !(0 != #t~nondet2);havoc #t~nondet2; {11112#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:58,893 INFO L273 TraceCheckUtils]: 64: Hoare triple {11112#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11122#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:58,894 INFO L273 TraceCheckUtils]: 65: Hoare triple {11122#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {11122#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:58,894 INFO L273 TraceCheckUtils]: 66: Hoare triple {11122#(<= main_~i~0 9)} assume !(0 != #t~nondet2);havoc #t~nondet2; {11122#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:58,895 INFO L273 TraceCheckUtils]: 67: Hoare triple {11122#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11132#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:58,896 INFO L273 TraceCheckUtils]: 68: Hoare triple {11132#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {11132#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:58,896 INFO L273 TraceCheckUtils]: 69: Hoare triple {11132#(<= main_~i~0 10)} assume !(0 != #t~nondet2);havoc #t~nondet2; {11132#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:58,897 INFO L273 TraceCheckUtils]: 70: Hoare triple {11132#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11142#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:58,898 INFO L273 TraceCheckUtils]: 71: Hoare triple {11142#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {11142#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:58,898 INFO L273 TraceCheckUtils]: 72: Hoare triple {11142#(<= main_~i~0 11)} assume !(0 != #t~nondet2);havoc #t~nondet2; {11142#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:58,899 INFO L273 TraceCheckUtils]: 73: Hoare triple {11142#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11152#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:58,899 INFO L273 TraceCheckUtils]: 74: Hoare triple {11152#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {11152#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:58,900 INFO L273 TraceCheckUtils]: 75: Hoare triple {11152#(<= main_~i~0 12)} assume !(0 != #t~nondet2);havoc #t~nondet2; {11152#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:58,901 INFO L273 TraceCheckUtils]: 76: Hoare triple {11152#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11162#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:58,901 INFO L273 TraceCheckUtils]: 77: Hoare triple {11162#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {11162#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:58,902 INFO L273 TraceCheckUtils]: 78: Hoare triple {11162#(<= main_~i~0 13)} assume !(0 != #t~nondet2);havoc #t~nondet2; {11162#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:58,902 INFO L273 TraceCheckUtils]: 79: Hoare triple {11162#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11172#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:58,903 INFO L273 TraceCheckUtils]: 80: Hoare triple {11172#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {11172#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:58,903 INFO L273 TraceCheckUtils]: 81: Hoare triple {11172#(<= main_~i~0 14)} assume !(0 != #t~nondet2);havoc #t~nondet2; {11172#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:58,904 INFO L273 TraceCheckUtils]: 82: Hoare triple {11172#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11182#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:58,905 INFO L273 TraceCheckUtils]: 83: Hoare triple {11182#(<= main_~i~0 15)} assume !(~i~0 < 100000); {10917#false} is VALID [2018-11-23 12:11:58,905 INFO L273 TraceCheckUtils]: 84: Hoare triple {10917#false} ~i~0 := 0; {10917#false} is VALID [2018-11-23 12:11:58,905 INFO L273 TraceCheckUtils]: 85: Hoare triple {10917#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem5 == #t~mem6; {10917#false} is VALID [2018-11-23 12:11:58,906 INFO L273 TraceCheckUtils]: 86: Hoare triple {10917#false} assume !#t~short10;call #t~mem9 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 == #t~mem7 * #t~mem8; {10917#false} is VALID [2018-11-23 12:11:58,906 INFO L256 TraceCheckUtils]: 87: Hoare triple {10917#false} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {10917#false} is VALID [2018-11-23 12:11:58,906 INFO L273 TraceCheckUtils]: 88: Hoare triple {10917#false} ~cond := #in~cond; {10917#false} is VALID [2018-11-23 12:11:58,906 INFO L273 TraceCheckUtils]: 89: Hoare triple {10917#false} assume 0 == ~cond; {10917#false} is VALID [2018-11-23 12:11:58,906 INFO L273 TraceCheckUtils]: 90: Hoare triple {10917#false} assume !false; {10917#false} is VALID [2018-11-23 12:11:58,912 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-11-23 12:11:58,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:11:58,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-11-23 12:11:58,934 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2018-11-23 12:11:58,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:58,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:11:58,994 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:58,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:11:58,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:11:58,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:11:58,995 INFO L87 Difference]: Start difference. First operand 101 states and 119 transitions. Second operand 18 states. [2018-11-23 12:12:00,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:00,477 INFO L93 Difference]: Finished difference Result 269 states and 356 transitions. [2018-11-23 12:12:00,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 12:12:00,477 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2018-11-23 12:12:00,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:12:00,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:12:00,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 257 transitions. [2018-11-23 12:12:00,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:12:00,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 257 transitions. [2018-11-23 12:12:00,482 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 257 transitions. [2018-11-23 12:12:02,092 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 257 edges. 257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:12:02,096 INFO L225 Difference]: With dead ends: 269 [2018-11-23 12:12:02,096 INFO L226 Difference]: Without dead ends: 205 [2018-11-23 12:12:02,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:12:02,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-11-23 12:12:02,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 106. [2018-11-23 12:12:02,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:12:02,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 205 states. Second operand 106 states. [2018-11-23 12:12:02,197 INFO L74 IsIncluded]: Start isIncluded. First operand 205 states. Second operand 106 states. [2018-11-23 12:12:02,197 INFO L87 Difference]: Start difference. First operand 205 states. Second operand 106 states. [2018-11-23 12:12:02,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:02,202 INFO L93 Difference]: Finished difference Result 205 states and 273 transitions. [2018-11-23 12:12:02,202 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 273 transitions. [2018-11-23 12:12:02,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:12:02,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:12:02,203 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 205 states. [2018-11-23 12:12:02,203 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 205 states. [2018-11-23 12:12:02,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:02,209 INFO L93 Difference]: Finished difference Result 205 states and 273 transitions. [2018-11-23 12:12:02,209 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 273 transitions. [2018-11-23 12:12:02,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:12:02,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:12:02,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:12:02,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:12:02,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-23 12:12:02,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 125 transitions. [2018-11-23 12:12:02,212 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 125 transitions. Word has length 91 [2018-11-23 12:12:02,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:12:02,212 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 125 transitions. [2018-11-23 12:12:02,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:12:02,213 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 125 transitions. [2018-11-23 12:12:02,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 12:12:02,214 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:12:02,214 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:12:02,214 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:12:02,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:12:02,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1426325304, now seen corresponding path program 16 times [2018-11-23 12:12:02,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:12:02,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:12:02,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:02,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:12:02,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:02,233 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:12:02,233 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:12:02,233 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:12:02,251 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:12:02,290 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:12:02,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:12:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:12:02,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:12:02,685 INFO L256 TraceCheckUtils]: 0: Hoare triple {12146#true} call ULTIMATE.init(); {12146#true} is VALID [2018-11-23 12:12:02,686 INFO L273 TraceCheckUtils]: 1: Hoare triple {12146#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12146#true} is VALID [2018-11-23 12:12:02,686 INFO L273 TraceCheckUtils]: 2: Hoare triple {12146#true} assume true; {12146#true} is VALID [2018-11-23 12:12:02,686 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12146#true} {12146#true} #74#return; {12146#true} is VALID [2018-11-23 12:12:02,686 INFO L256 TraceCheckUtils]: 4: Hoare triple {12146#true} call #t~ret11 := main(); {12146#true} is VALID [2018-11-23 12:12:02,687 INFO L273 TraceCheckUtils]: 5: Hoare triple {12146#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);havoc ~k~0;havoc ~i~0;~i~0 := 0; {12166#(<= main_~i~0 0)} is VALID [2018-11-23 12:12:02,687 INFO L273 TraceCheckUtils]: 6: Hoare triple {12166#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12166#(<= main_~i~0 0)} is VALID [2018-11-23 12:12:02,688 INFO L273 TraceCheckUtils]: 7: Hoare triple {12166#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12173#(<= main_~i~0 1)} is VALID [2018-11-23 12:12:02,688 INFO L273 TraceCheckUtils]: 8: Hoare triple {12173#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12173#(<= main_~i~0 1)} is VALID [2018-11-23 12:12:02,688 INFO L273 TraceCheckUtils]: 9: Hoare triple {12173#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12180#(<= main_~i~0 2)} is VALID [2018-11-23 12:12:02,689 INFO L273 TraceCheckUtils]: 10: Hoare triple {12180#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12180#(<= main_~i~0 2)} is VALID [2018-11-23 12:12:02,689 INFO L273 TraceCheckUtils]: 11: Hoare triple {12180#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12187#(<= main_~i~0 3)} is VALID [2018-11-23 12:12:02,689 INFO L273 TraceCheckUtils]: 12: Hoare triple {12187#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12187#(<= main_~i~0 3)} is VALID [2018-11-23 12:12:02,690 INFO L273 TraceCheckUtils]: 13: Hoare triple {12187#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12194#(<= main_~i~0 4)} is VALID [2018-11-23 12:12:02,691 INFO L273 TraceCheckUtils]: 14: Hoare triple {12194#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12194#(<= main_~i~0 4)} is VALID [2018-11-23 12:12:02,691 INFO L273 TraceCheckUtils]: 15: Hoare triple {12194#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12201#(<= main_~i~0 5)} is VALID [2018-11-23 12:12:02,692 INFO L273 TraceCheckUtils]: 16: Hoare triple {12201#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12201#(<= main_~i~0 5)} is VALID [2018-11-23 12:12:02,693 INFO L273 TraceCheckUtils]: 17: Hoare triple {12201#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12208#(<= main_~i~0 6)} is VALID [2018-11-23 12:12:02,693 INFO L273 TraceCheckUtils]: 18: Hoare triple {12208#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12208#(<= main_~i~0 6)} is VALID [2018-11-23 12:12:02,694 INFO L273 TraceCheckUtils]: 19: Hoare triple {12208#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12215#(<= main_~i~0 7)} is VALID [2018-11-23 12:12:02,695 INFO L273 TraceCheckUtils]: 20: Hoare triple {12215#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12215#(<= main_~i~0 7)} is VALID [2018-11-23 12:12:02,695 INFO L273 TraceCheckUtils]: 21: Hoare triple {12215#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12222#(<= main_~i~0 8)} is VALID [2018-11-23 12:12:02,696 INFO L273 TraceCheckUtils]: 22: Hoare triple {12222#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12222#(<= main_~i~0 8)} is VALID [2018-11-23 12:12:02,697 INFO L273 TraceCheckUtils]: 23: Hoare triple {12222#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12229#(<= main_~i~0 9)} is VALID [2018-11-23 12:12:02,697 INFO L273 TraceCheckUtils]: 24: Hoare triple {12229#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12229#(<= main_~i~0 9)} is VALID [2018-11-23 12:12:02,698 INFO L273 TraceCheckUtils]: 25: Hoare triple {12229#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12236#(<= main_~i~0 10)} is VALID [2018-11-23 12:12:02,699 INFO L273 TraceCheckUtils]: 26: Hoare triple {12236#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12236#(<= main_~i~0 10)} is VALID [2018-11-23 12:12:02,699 INFO L273 TraceCheckUtils]: 27: Hoare triple {12236#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12243#(<= main_~i~0 11)} is VALID [2018-11-23 12:12:02,700 INFO L273 TraceCheckUtils]: 28: Hoare triple {12243#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12243#(<= main_~i~0 11)} is VALID [2018-11-23 12:12:02,701 INFO L273 TraceCheckUtils]: 29: Hoare triple {12243#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12250#(<= main_~i~0 12)} is VALID [2018-11-23 12:12:02,701 INFO L273 TraceCheckUtils]: 30: Hoare triple {12250#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12250#(<= main_~i~0 12)} is VALID [2018-11-23 12:12:02,702 INFO L273 TraceCheckUtils]: 31: Hoare triple {12250#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12257#(<= main_~i~0 13)} is VALID [2018-11-23 12:12:02,703 INFO L273 TraceCheckUtils]: 32: Hoare triple {12257#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12257#(<= main_~i~0 13)} is VALID [2018-11-23 12:12:02,703 INFO L273 TraceCheckUtils]: 33: Hoare triple {12257#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12264#(<= main_~i~0 14)} is VALID [2018-11-23 12:12:02,705 INFO L273 TraceCheckUtils]: 34: Hoare triple {12264#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12264#(<= main_~i~0 14)} is VALID [2018-11-23 12:12:02,706 INFO L273 TraceCheckUtils]: 35: Hoare triple {12264#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12271#(<= main_~i~0 15)} is VALID [2018-11-23 12:12:02,706 INFO L273 TraceCheckUtils]: 36: Hoare triple {12271#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {12271#(<= main_~i~0 15)} is VALID [2018-11-23 12:12:02,707 INFO L273 TraceCheckUtils]: 37: Hoare triple {12271#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12278#(<= main_~i~0 16)} is VALID [2018-11-23 12:12:02,708 INFO L273 TraceCheckUtils]: 38: Hoare triple {12278#(<= main_~i~0 16)} assume !(~i~0 < 100000); {12147#false} is VALID [2018-11-23 12:12:02,708 INFO L273 TraceCheckUtils]: 39: Hoare triple {12147#false} ~i~0 := 0; {12147#false} is VALID [2018-11-23 12:12:02,708 INFO L273 TraceCheckUtils]: 40: Hoare triple {12147#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {12147#false} is VALID [2018-11-23 12:12:02,708 INFO L273 TraceCheckUtils]: 41: Hoare triple {12147#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {12147#false} is VALID [2018-11-23 12:12:02,708 INFO L273 TraceCheckUtils]: 42: Hoare triple {12147#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12147#false} is VALID [2018-11-23 12:12:02,709 INFO L273 TraceCheckUtils]: 43: Hoare triple {12147#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {12147#false} is VALID [2018-11-23 12:12:02,709 INFO L273 TraceCheckUtils]: 44: Hoare triple {12147#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {12147#false} is VALID [2018-11-23 12:12:02,709 INFO L273 TraceCheckUtils]: 45: Hoare triple {12147#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12147#false} is VALID [2018-11-23 12:12:02,709 INFO L273 TraceCheckUtils]: 46: Hoare triple {12147#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {12147#false} is VALID [2018-11-23 12:12:02,709 INFO L273 TraceCheckUtils]: 47: Hoare triple {12147#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {12147#false} is VALID [2018-11-23 12:12:02,710 INFO L273 TraceCheckUtils]: 48: Hoare triple {12147#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12147#false} is VALID [2018-11-23 12:12:02,710 INFO L273 TraceCheckUtils]: 49: Hoare triple {12147#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {12147#false} is VALID [2018-11-23 12:12:02,710 INFO L273 TraceCheckUtils]: 50: Hoare triple {12147#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {12147#false} is VALID [2018-11-23 12:12:02,710 INFO L273 TraceCheckUtils]: 51: Hoare triple {12147#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12147#false} is VALID [2018-11-23 12:12:02,711 INFO L273 TraceCheckUtils]: 52: Hoare triple {12147#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {12147#false} is VALID [2018-11-23 12:12:02,711 INFO L273 TraceCheckUtils]: 53: Hoare triple {12147#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {12147#false} is VALID [2018-11-23 12:12:02,711 INFO L273 TraceCheckUtils]: 54: Hoare triple {12147#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12147#false} is VALID [2018-11-23 12:12:02,712 INFO L273 TraceCheckUtils]: 55: Hoare triple {12147#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {12147#false} is VALID [2018-11-23 12:12:02,712 INFO L273 TraceCheckUtils]: 56: Hoare triple {12147#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {12147#false} is VALID [2018-11-23 12:12:02,712 INFO L273 TraceCheckUtils]: 57: Hoare triple {12147#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12147#false} is VALID [2018-11-23 12:12:02,712 INFO L273 TraceCheckUtils]: 58: Hoare triple {12147#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {12147#false} is VALID [2018-11-23 12:12:02,712 INFO L273 TraceCheckUtils]: 59: Hoare triple {12147#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {12147#false} is VALID [2018-11-23 12:12:02,712 INFO L273 TraceCheckUtils]: 60: Hoare triple {12147#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12147#false} is VALID [2018-11-23 12:12:02,713 INFO L273 TraceCheckUtils]: 61: Hoare triple {12147#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {12147#false} is VALID [2018-11-23 12:12:02,713 INFO L273 TraceCheckUtils]: 62: Hoare triple {12147#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {12147#false} is VALID [2018-11-23 12:12:02,713 INFO L273 TraceCheckUtils]: 63: Hoare triple {12147#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12147#false} is VALID [2018-11-23 12:12:02,713 INFO L273 TraceCheckUtils]: 64: Hoare triple {12147#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {12147#false} is VALID [2018-11-23 12:12:02,713 INFO L273 TraceCheckUtils]: 65: Hoare triple {12147#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {12147#false} is VALID [2018-11-23 12:12:02,714 INFO L273 TraceCheckUtils]: 66: Hoare triple {12147#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12147#false} is VALID [2018-11-23 12:12:02,714 INFO L273 TraceCheckUtils]: 67: Hoare triple {12147#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {12147#false} is VALID [2018-11-23 12:12:02,714 INFO L273 TraceCheckUtils]: 68: Hoare triple {12147#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {12147#false} is VALID [2018-11-23 12:12:02,714 INFO L273 TraceCheckUtils]: 69: Hoare triple {12147#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12147#false} is VALID [2018-11-23 12:12:02,714 INFO L273 TraceCheckUtils]: 70: Hoare triple {12147#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {12147#false} is VALID [2018-11-23 12:12:02,714 INFO L273 TraceCheckUtils]: 71: Hoare triple {12147#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {12147#false} is VALID [2018-11-23 12:12:02,714 INFO L273 TraceCheckUtils]: 72: Hoare triple {12147#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12147#false} is VALID [2018-11-23 12:12:02,714 INFO L273 TraceCheckUtils]: 73: Hoare triple {12147#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {12147#false} is VALID [2018-11-23 12:12:02,715 INFO L273 TraceCheckUtils]: 74: Hoare triple {12147#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {12147#false} is VALID [2018-11-23 12:12:02,715 INFO L273 TraceCheckUtils]: 75: Hoare triple {12147#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12147#false} is VALID [2018-11-23 12:12:02,715 INFO L273 TraceCheckUtils]: 76: Hoare triple {12147#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {12147#false} is VALID [2018-11-23 12:12:02,715 INFO L273 TraceCheckUtils]: 77: Hoare triple {12147#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {12147#false} is VALID [2018-11-23 12:12:02,715 INFO L273 TraceCheckUtils]: 78: Hoare triple {12147#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12147#false} is VALID [2018-11-23 12:12:02,715 INFO L273 TraceCheckUtils]: 79: Hoare triple {12147#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {12147#false} is VALID [2018-11-23 12:12:02,715 INFO L273 TraceCheckUtils]: 80: Hoare triple {12147#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {12147#false} is VALID [2018-11-23 12:12:02,715 INFO L273 TraceCheckUtils]: 81: Hoare triple {12147#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12147#false} is VALID [2018-11-23 12:12:02,715 INFO L273 TraceCheckUtils]: 82: Hoare triple {12147#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {12147#false} is VALID [2018-11-23 12:12:02,716 INFO L273 TraceCheckUtils]: 83: Hoare triple {12147#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {12147#false} is VALID [2018-11-23 12:12:02,716 INFO L273 TraceCheckUtils]: 84: Hoare triple {12147#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12147#false} is VALID [2018-11-23 12:12:02,716 INFO L273 TraceCheckUtils]: 85: Hoare triple {12147#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {12147#false} is VALID [2018-11-23 12:12:02,716 INFO L273 TraceCheckUtils]: 86: Hoare triple {12147#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {12147#false} is VALID [2018-11-23 12:12:02,716 INFO L273 TraceCheckUtils]: 87: Hoare triple {12147#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12147#false} is VALID [2018-11-23 12:12:02,716 INFO L273 TraceCheckUtils]: 88: Hoare triple {12147#false} assume !(~i~0 < 100000); {12147#false} is VALID [2018-11-23 12:12:02,716 INFO L273 TraceCheckUtils]: 89: Hoare triple {12147#false} ~i~0 := 0; {12147#false} is VALID [2018-11-23 12:12:02,716 INFO L273 TraceCheckUtils]: 90: Hoare triple {12147#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem5 == #t~mem6; {12147#false} is VALID [2018-11-23 12:12:02,717 INFO L273 TraceCheckUtils]: 91: Hoare triple {12147#false} assume !#t~short10;call #t~mem9 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 == #t~mem7 * #t~mem8; {12147#false} is VALID [2018-11-23 12:12:02,717 INFO L256 TraceCheckUtils]: 92: Hoare triple {12147#false} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {12147#false} is VALID [2018-11-23 12:12:02,717 INFO L273 TraceCheckUtils]: 93: Hoare triple {12147#false} ~cond := #in~cond; {12147#false} is VALID [2018-11-23 12:12:02,717 INFO L273 TraceCheckUtils]: 94: Hoare triple {12147#false} assume 0 == ~cond; {12147#false} is VALID [2018-11-23 12:12:02,717 INFO L273 TraceCheckUtils]: 95: Hoare triple {12147#false} assume !false; {12147#false} is VALID [2018-11-23 12:12:02,722 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2018-11-23 12:12:02,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:12:02,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-11-23 12:12:02,743 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 96 [2018-11-23 12:12:02,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:12:02,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:12:02,798 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:12:02,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:12:02,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:12:02,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:12:02,800 INFO L87 Difference]: Start difference. First operand 106 states and 125 transitions. Second operand 19 states. [2018-11-23 12:12:04,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:04,347 INFO L93 Difference]: Finished difference Result 283 states and 375 transitions. [2018-11-23 12:12:04,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:12:04,347 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 96 [2018-11-23 12:12:04,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:12:04,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:12:04,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 270 transitions. [2018-11-23 12:12:04,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:12:04,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 270 transitions. [2018-11-23 12:12:04,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 270 transitions. [2018-11-23 12:12:04,625 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 270 edges. 270 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:12:04,630 INFO L225 Difference]: With dead ends: 283 [2018-11-23 12:12:04,631 INFO L226 Difference]: Without dead ends: 216 [2018-11-23 12:12:04,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:12:04,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-11-23 12:12:04,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 111. [2018-11-23 12:12:04,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:12:04,730 INFO L82 GeneralOperation]: Start isEquivalent. First operand 216 states. Second operand 111 states. [2018-11-23 12:12:04,730 INFO L74 IsIncluded]: Start isIncluded. First operand 216 states. Second operand 111 states. [2018-11-23 12:12:04,730 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 111 states. [2018-11-23 12:12:04,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:04,734 INFO L93 Difference]: Finished difference Result 216 states and 288 transitions. [2018-11-23 12:12:04,734 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 288 transitions. [2018-11-23 12:12:04,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:12:04,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:12:04,735 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 216 states. [2018-11-23 12:12:04,736 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 216 states. [2018-11-23 12:12:04,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:04,742 INFO L93 Difference]: Finished difference Result 216 states and 288 transitions. [2018-11-23 12:12:04,742 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 288 transitions. [2018-11-23 12:12:04,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:12:04,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:12:04,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:12:04,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:12:04,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-23 12:12:04,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 131 transitions. [2018-11-23 12:12:04,746 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 131 transitions. Word has length 96 [2018-11-23 12:12:04,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:12:04,746 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 131 transitions. [2018-11-23 12:12:04,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:12:04,746 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 131 transitions. [2018-11-23 12:12:04,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-23 12:12:04,747 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:12:04,747 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:12:04,747 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:12:04,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:12:04,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1888118109, now seen corresponding path program 17 times [2018-11-23 12:12:04,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:12:04,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:12:04,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:04,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:12:04,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:04,776 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:12:04,776 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:12:04,776 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:12:04,791 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:12:06,678 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-23 12:12:06,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:12:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:12:06,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:12:07,051 INFO L256 TraceCheckUtils]: 0: Hoare triple {13441#true} call ULTIMATE.init(); {13441#true} is VALID [2018-11-23 12:12:07,051 INFO L273 TraceCheckUtils]: 1: Hoare triple {13441#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13441#true} is VALID [2018-11-23 12:12:07,052 INFO L273 TraceCheckUtils]: 2: Hoare triple {13441#true} assume true; {13441#true} is VALID [2018-11-23 12:12:07,052 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13441#true} {13441#true} #74#return; {13441#true} is VALID [2018-11-23 12:12:07,052 INFO L256 TraceCheckUtils]: 4: Hoare triple {13441#true} call #t~ret11 := main(); {13441#true} is VALID [2018-11-23 12:12:07,053 INFO L273 TraceCheckUtils]: 5: Hoare triple {13441#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);havoc ~k~0;havoc ~i~0;~i~0 := 0; {13461#(<= main_~i~0 0)} is VALID [2018-11-23 12:12:07,053 INFO L273 TraceCheckUtils]: 6: Hoare triple {13461#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13461#(<= main_~i~0 0)} is VALID [2018-11-23 12:12:07,054 INFO L273 TraceCheckUtils]: 7: Hoare triple {13461#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13468#(<= main_~i~0 1)} is VALID [2018-11-23 12:12:07,054 INFO L273 TraceCheckUtils]: 8: Hoare triple {13468#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13468#(<= main_~i~0 1)} is VALID [2018-11-23 12:12:07,054 INFO L273 TraceCheckUtils]: 9: Hoare triple {13468#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13475#(<= main_~i~0 2)} is VALID [2018-11-23 12:12:07,055 INFO L273 TraceCheckUtils]: 10: Hoare triple {13475#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13475#(<= main_~i~0 2)} is VALID [2018-11-23 12:12:07,055 INFO L273 TraceCheckUtils]: 11: Hoare triple {13475#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13482#(<= main_~i~0 3)} is VALID [2018-11-23 12:12:07,056 INFO L273 TraceCheckUtils]: 12: Hoare triple {13482#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13482#(<= main_~i~0 3)} is VALID [2018-11-23 12:12:07,057 INFO L273 TraceCheckUtils]: 13: Hoare triple {13482#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13489#(<= main_~i~0 4)} is VALID [2018-11-23 12:12:07,057 INFO L273 TraceCheckUtils]: 14: Hoare triple {13489#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13489#(<= main_~i~0 4)} is VALID [2018-11-23 12:12:07,058 INFO L273 TraceCheckUtils]: 15: Hoare triple {13489#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13496#(<= main_~i~0 5)} is VALID [2018-11-23 12:12:07,058 INFO L273 TraceCheckUtils]: 16: Hoare triple {13496#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13496#(<= main_~i~0 5)} is VALID [2018-11-23 12:12:07,059 INFO L273 TraceCheckUtils]: 17: Hoare triple {13496#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13503#(<= main_~i~0 6)} is VALID [2018-11-23 12:12:07,060 INFO L273 TraceCheckUtils]: 18: Hoare triple {13503#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13503#(<= main_~i~0 6)} is VALID [2018-11-23 12:12:07,060 INFO L273 TraceCheckUtils]: 19: Hoare triple {13503#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13510#(<= main_~i~0 7)} is VALID [2018-11-23 12:12:07,061 INFO L273 TraceCheckUtils]: 20: Hoare triple {13510#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13510#(<= main_~i~0 7)} is VALID [2018-11-23 12:12:07,062 INFO L273 TraceCheckUtils]: 21: Hoare triple {13510#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13517#(<= main_~i~0 8)} is VALID [2018-11-23 12:12:07,062 INFO L273 TraceCheckUtils]: 22: Hoare triple {13517#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13517#(<= main_~i~0 8)} is VALID [2018-11-23 12:12:07,063 INFO L273 TraceCheckUtils]: 23: Hoare triple {13517#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13524#(<= main_~i~0 9)} is VALID [2018-11-23 12:12:07,063 INFO L273 TraceCheckUtils]: 24: Hoare triple {13524#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13524#(<= main_~i~0 9)} is VALID [2018-11-23 12:12:07,064 INFO L273 TraceCheckUtils]: 25: Hoare triple {13524#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13531#(<= main_~i~0 10)} is VALID [2018-11-23 12:12:07,064 INFO L273 TraceCheckUtils]: 26: Hoare triple {13531#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13531#(<= main_~i~0 10)} is VALID [2018-11-23 12:12:07,065 INFO L273 TraceCheckUtils]: 27: Hoare triple {13531#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13538#(<= main_~i~0 11)} is VALID [2018-11-23 12:12:07,066 INFO L273 TraceCheckUtils]: 28: Hoare triple {13538#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13538#(<= main_~i~0 11)} is VALID [2018-11-23 12:12:07,066 INFO L273 TraceCheckUtils]: 29: Hoare triple {13538#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13545#(<= main_~i~0 12)} is VALID [2018-11-23 12:12:07,067 INFO L273 TraceCheckUtils]: 30: Hoare triple {13545#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13545#(<= main_~i~0 12)} is VALID [2018-11-23 12:12:07,068 INFO L273 TraceCheckUtils]: 31: Hoare triple {13545#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13552#(<= main_~i~0 13)} is VALID [2018-11-23 12:12:07,068 INFO L273 TraceCheckUtils]: 32: Hoare triple {13552#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13552#(<= main_~i~0 13)} is VALID [2018-11-23 12:12:07,069 INFO L273 TraceCheckUtils]: 33: Hoare triple {13552#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13559#(<= main_~i~0 14)} is VALID [2018-11-23 12:12:07,069 INFO L273 TraceCheckUtils]: 34: Hoare triple {13559#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13559#(<= main_~i~0 14)} is VALID [2018-11-23 12:12:07,070 INFO L273 TraceCheckUtils]: 35: Hoare triple {13559#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13566#(<= main_~i~0 15)} is VALID [2018-11-23 12:12:07,070 INFO L273 TraceCheckUtils]: 36: Hoare triple {13566#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13566#(<= main_~i~0 15)} is VALID [2018-11-23 12:12:07,071 INFO L273 TraceCheckUtils]: 37: Hoare triple {13566#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13573#(<= main_~i~0 16)} is VALID [2018-11-23 12:12:07,072 INFO L273 TraceCheckUtils]: 38: Hoare triple {13573#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {13573#(<= main_~i~0 16)} is VALID [2018-11-23 12:12:07,072 INFO L273 TraceCheckUtils]: 39: Hoare triple {13573#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13580#(<= main_~i~0 17)} is VALID [2018-11-23 12:12:07,073 INFO L273 TraceCheckUtils]: 40: Hoare triple {13580#(<= main_~i~0 17)} assume !(~i~0 < 100000); {13442#false} is VALID [2018-11-23 12:12:07,073 INFO L273 TraceCheckUtils]: 41: Hoare triple {13442#false} ~i~0 := 0; {13442#false} is VALID [2018-11-23 12:12:07,073 INFO L273 TraceCheckUtils]: 42: Hoare triple {13442#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {13442#false} is VALID [2018-11-23 12:12:07,074 INFO L273 TraceCheckUtils]: 43: Hoare triple {13442#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {13442#false} is VALID [2018-11-23 12:12:07,074 INFO L273 TraceCheckUtils]: 44: Hoare triple {13442#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13442#false} is VALID [2018-11-23 12:12:07,074 INFO L273 TraceCheckUtils]: 45: Hoare triple {13442#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {13442#false} is VALID [2018-11-23 12:12:07,074 INFO L273 TraceCheckUtils]: 46: Hoare triple {13442#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {13442#false} is VALID [2018-11-23 12:12:07,074 INFO L273 TraceCheckUtils]: 47: Hoare triple {13442#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13442#false} is VALID [2018-11-23 12:12:07,075 INFO L273 TraceCheckUtils]: 48: Hoare triple {13442#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {13442#false} is VALID [2018-11-23 12:12:07,075 INFO L273 TraceCheckUtils]: 49: Hoare triple {13442#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {13442#false} is VALID [2018-11-23 12:12:07,075 INFO L273 TraceCheckUtils]: 50: Hoare triple {13442#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13442#false} is VALID [2018-11-23 12:12:07,075 INFO L273 TraceCheckUtils]: 51: Hoare triple {13442#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {13442#false} is VALID [2018-11-23 12:12:07,075 INFO L273 TraceCheckUtils]: 52: Hoare triple {13442#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {13442#false} is VALID [2018-11-23 12:12:07,076 INFO L273 TraceCheckUtils]: 53: Hoare triple {13442#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13442#false} is VALID [2018-11-23 12:12:07,076 INFO L273 TraceCheckUtils]: 54: Hoare triple {13442#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {13442#false} is VALID [2018-11-23 12:12:07,076 INFO L273 TraceCheckUtils]: 55: Hoare triple {13442#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {13442#false} is VALID [2018-11-23 12:12:07,076 INFO L273 TraceCheckUtils]: 56: Hoare triple {13442#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13442#false} is VALID [2018-11-23 12:12:07,076 INFO L273 TraceCheckUtils]: 57: Hoare triple {13442#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {13442#false} is VALID [2018-11-23 12:12:07,076 INFO L273 TraceCheckUtils]: 58: Hoare triple {13442#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {13442#false} is VALID [2018-11-23 12:12:07,077 INFO L273 TraceCheckUtils]: 59: Hoare triple {13442#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13442#false} is VALID [2018-11-23 12:12:07,077 INFO L273 TraceCheckUtils]: 60: Hoare triple {13442#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {13442#false} is VALID [2018-11-23 12:12:07,077 INFO L273 TraceCheckUtils]: 61: Hoare triple {13442#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {13442#false} is VALID [2018-11-23 12:12:07,077 INFO L273 TraceCheckUtils]: 62: Hoare triple {13442#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13442#false} is VALID [2018-11-23 12:12:07,077 INFO L273 TraceCheckUtils]: 63: Hoare triple {13442#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {13442#false} is VALID [2018-11-23 12:12:07,077 INFO L273 TraceCheckUtils]: 64: Hoare triple {13442#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {13442#false} is VALID [2018-11-23 12:12:07,077 INFO L273 TraceCheckUtils]: 65: Hoare triple {13442#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13442#false} is VALID [2018-11-23 12:12:07,078 INFO L273 TraceCheckUtils]: 66: Hoare triple {13442#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {13442#false} is VALID [2018-11-23 12:12:07,078 INFO L273 TraceCheckUtils]: 67: Hoare triple {13442#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {13442#false} is VALID [2018-11-23 12:12:07,078 INFO L273 TraceCheckUtils]: 68: Hoare triple {13442#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13442#false} is VALID [2018-11-23 12:12:07,078 INFO L273 TraceCheckUtils]: 69: Hoare triple {13442#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {13442#false} is VALID [2018-11-23 12:12:07,078 INFO L273 TraceCheckUtils]: 70: Hoare triple {13442#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {13442#false} is VALID [2018-11-23 12:12:07,078 INFO L273 TraceCheckUtils]: 71: Hoare triple {13442#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13442#false} is VALID [2018-11-23 12:12:07,078 INFO L273 TraceCheckUtils]: 72: Hoare triple {13442#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {13442#false} is VALID [2018-11-23 12:12:07,078 INFO L273 TraceCheckUtils]: 73: Hoare triple {13442#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {13442#false} is VALID [2018-11-23 12:12:07,079 INFO L273 TraceCheckUtils]: 74: Hoare triple {13442#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13442#false} is VALID [2018-11-23 12:12:07,079 INFO L273 TraceCheckUtils]: 75: Hoare triple {13442#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {13442#false} is VALID [2018-11-23 12:12:07,079 INFO L273 TraceCheckUtils]: 76: Hoare triple {13442#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {13442#false} is VALID [2018-11-23 12:12:07,079 INFO L273 TraceCheckUtils]: 77: Hoare triple {13442#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13442#false} is VALID [2018-11-23 12:12:07,079 INFO L273 TraceCheckUtils]: 78: Hoare triple {13442#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {13442#false} is VALID [2018-11-23 12:12:07,079 INFO L273 TraceCheckUtils]: 79: Hoare triple {13442#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {13442#false} is VALID [2018-11-23 12:12:07,079 INFO L273 TraceCheckUtils]: 80: Hoare triple {13442#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13442#false} is VALID [2018-11-23 12:12:07,079 INFO L273 TraceCheckUtils]: 81: Hoare triple {13442#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {13442#false} is VALID [2018-11-23 12:12:07,080 INFO L273 TraceCheckUtils]: 82: Hoare triple {13442#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {13442#false} is VALID [2018-11-23 12:12:07,080 INFO L273 TraceCheckUtils]: 83: Hoare triple {13442#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13442#false} is VALID [2018-11-23 12:12:07,080 INFO L273 TraceCheckUtils]: 84: Hoare triple {13442#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {13442#false} is VALID [2018-11-23 12:12:07,080 INFO L273 TraceCheckUtils]: 85: Hoare triple {13442#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {13442#false} is VALID [2018-11-23 12:12:07,080 INFO L273 TraceCheckUtils]: 86: Hoare triple {13442#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13442#false} is VALID [2018-11-23 12:12:07,080 INFO L273 TraceCheckUtils]: 87: Hoare triple {13442#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {13442#false} is VALID [2018-11-23 12:12:07,080 INFO L273 TraceCheckUtils]: 88: Hoare triple {13442#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {13442#false} is VALID [2018-11-23 12:12:07,080 INFO L273 TraceCheckUtils]: 89: Hoare triple {13442#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13442#false} is VALID [2018-11-23 12:12:07,080 INFO L273 TraceCheckUtils]: 90: Hoare triple {13442#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {13442#false} is VALID [2018-11-23 12:12:07,081 INFO L273 TraceCheckUtils]: 91: Hoare triple {13442#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {13442#false} is VALID [2018-11-23 12:12:07,081 INFO L273 TraceCheckUtils]: 92: Hoare triple {13442#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13442#false} is VALID [2018-11-23 12:12:07,081 INFO L273 TraceCheckUtils]: 93: Hoare triple {13442#false} assume !(~i~0 < 100000); {13442#false} is VALID [2018-11-23 12:12:07,081 INFO L273 TraceCheckUtils]: 94: Hoare triple {13442#false} ~i~0 := 0; {13442#false} is VALID [2018-11-23 12:12:07,081 INFO L273 TraceCheckUtils]: 95: Hoare triple {13442#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem5 == #t~mem6; {13442#false} is VALID [2018-11-23 12:12:07,081 INFO L273 TraceCheckUtils]: 96: Hoare triple {13442#false} assume !#t~short10;call #t~mem9 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 == #t~mem7 * #t~mem8; {13442#false} is VALID [2018-11-23 12:12:07,081 INFO L256 TraceCheckUtils]: 97: Hoare triple {13442#false} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {13442#false} is VALID [2018-11-23 12:12:07,081 INFO L273 TraceCheckUtils]: 98: Hoare triple {13442#false} ~cond := #in~cond; {13442#false} is VALID [2018-11-23 12:12:07,082 INFO L273 TraceCheckUtils]: 99: Hoare triple {13442#false} assume 0 == ~cond; {13442#false} is VALID [2018-11-23 12:12:07,082 INFO L273 TraceCheckUtils]: 100: Hoare triple {13442#false} assume !false; {13442#false} is VALID [2018-11-23 12:12:07,086 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2018-11-23 12:12:07,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:12:07,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-11-23 12:12:07,108 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 101 [2018-11-23 12:12:07,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:12:07,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:12:07,160 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:12:07,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:12:07,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:12:07,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:12:07,161 INFO L87 Difference]: Start difference. First operand 111 states and 131 transitions. Second operand 20 states. [2018-11-23 12:12:08,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:08,662 INFO L93 Difference]: Finished difference Result 297 states and 394 transitions. [2018-11-23 12:12:08,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 12:12:08,662 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 101 [2018-11-23 12:12:08,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:12:08,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:12:08,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 283 transitions. [2018-11-23 12:12:08,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:12:08,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 283 transitions. [2018-11-23 12:12:08,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 283 transitions. [2018-11-23 12:12:08,946 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 283 edges. 283 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:12:08,950 INFO L225 Difference]: With dead ends: 297 [2018-11-23 12:12:08,951 INFO L226 Difference]: Without dead ends: 227 [2018-11-23 12:12:08,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:12:08,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-11-23 12:12:09,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 116. [2018-11-23 12:12:09,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:12:09,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 227 states. Second operand 116 states. [2018-11-23 12:12:09,059 INFO L74 IsIncluded]: Start isIncluded. First operand 227 states. Second operand 116 states. [2018-11-23 12:12:09,059 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 116 states. [2018-11-23 12:12:09,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:09,064 INFO L93 Difference]: Finished difference Result 227 states and 303 transitions. [2018-11-23 12:12:09,064 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 303 transitions. [2018-11-23 12:12:09,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:12:09,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:12:09,065 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 227 states. [2018-11-23 12:12:09,066 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 227 states. [2018-11-23 12:12:09,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:09,072 INFO L93 Difference]: Finished difference Result 227 states and 303 transitions. [2018-11-23 12:12:09,072 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 303 transitions. [2018-11-23 12:12:09,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:12:09,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:12:09,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:12:09,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:12:09,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-23 12:12:09,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 137 transitions. [2018-11-23 12:12:09,075 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 137 transitions. Word has length 101 [2018-11-23 12:12:09,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:12:09,076 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 137 transitions. [2018-11-23 12:12:09,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:12:09,076 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 137 transitions. [2018-11-23 12:12:09,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-23 12:12:09,077 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:12:09,077 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:12:09,078 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:12:09,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:12:09,078 INFO L82 PathProgramCache]: Analyzing trace with hash -240611668, now seen corresponding path program 18 times [2018-11-23 12:12:09,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:12:09,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:12:09,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:09,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:12:09,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:09,096 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:12:09,097 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:12:09,097 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:12:09,110 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:12:12,325 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 12:12:12,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:12:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:12:12,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:12:12,791 INFO L256 TraceCheckUtils]: 0: Hoare triple {14801#true} call ULTIMATE.init(); {14801#true} is VALID [2018-11-23 12:12:12,791 INFO L273 TraceCheckUtils]: 1: Hoare triple {14801#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14801#true} is VALID [2018-11-23 12:12:12,792 INFO L273 TraceCheckUtils]: 2: Hoare triple {14801#true} assume true; {14801#true} is VALID [2018-11-23 12:12:12,792 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14801#true} {14801#true} #74#return; {14801#true} is VALID [2018-11-23 12:12:12,792 INFO L256 TraceCheckUtils]: 4: Hoare triple {14801#true} call #t~ret11 := main(); {14801#true} is VALID [2018-11-23 12:12:12,814 INFO L273 TraceCheckUtils]: 5: Hoare triple {14801#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);havoc ~k~0;havoc ~i~0;~i~0 := 0; {14821#(<= main_~i~0 0)} is VALID [2018-11-23 12:12:12,827 INFO L273 TraceCheckUtils]: 6: Hoare triple {14821#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14821#(<= main_~i~0 0)} is VALID [2018-11-23 12:12:12,836 INFO L273 TraceCheckUtils]: 7: Hoare triple {14821#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14828#(<= main_~i~0 1)} is VALID [2018-11-23 12:12:12,836 INFO L273 TraceCheckUtils]: 8: Hoare triple {14828#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14828#(<= main_~i~0 1)} is VALID [2018-11-23 12:12:12,837 INFO L273 TraceCheckUtils]: 9: Hoare triple {14828#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14835#(<= main_~i~0 2)} is VALID [2018-11-23 12:12:12,837 INFO L273 TraceCheckUtils]: 10: Hoare triple {14835#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14835#(<= main_~i~0 2)} is VALID [2018-11-23 12:12:12,838 INFO L273 TraceCheckUtils]: 11: Hoare triple {14835#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14842#(<= main_~i~0 3)} is VALID [2018-11-23 12:12:12,838 INFO L273 TraceCheckUtils]: 12: Hoare triple {14842#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14842#(<= main_~i~0 3)} is VALID [2018-11-23 12:12:12,839 INFO L273 TraceCheckUtils]: 13: Hoare triple {14842#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14849#(<= main_~i~0 4)} is VALID [2018-11-23 12:12:12,839 INFO L273 TraceCheckUtils]: 14: Hoare triple {14849#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14849#(<= main_~i~0 4)} is VALID [2018-11-23 12:12:12,840 INFO L273 TraceCheckUtils]: 15: Hoare triple {14849#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14856#(<= main_~i~0 5)} is VALID [2018-11-23 12:12:12,840 INFO L273 TraceCheckUtils]: 16: Hoare triple {14856#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14856#(<= main_~i~0 5)} is VALID [2018-11-23 12:12:12,841 INFO L273 TraceCheckUtils]: 17: Hoare triple {14856#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14863#(<= main_~i~0 6)} is VALID [2018-11-23 12:12:12,841 INFO L273 TraceCheckUtils]: 18: Hoare triple {14863#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14863#(<= main_~i~0 6)} is VALID [2018-11-23 12:12:12,842 INFO L273 TraceCheckUtils]: 19: Hoare triple {14863#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14870#(<= main_~i~0 7)} is VALID [2018-11-23 12:12:12,843 INFO L273 TraceCheckUtils]: 20: Hoare triple {14870#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14870#(<= main_~i~0 7)} is VALID [2018-11-23 12:12:12,843 INFO L273 TraceCheckUtils]: 21: Hoare triple {14870#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14877#(<= main_~i~0 8)} is VALID [2018-11-23 12:12:12,844 INFO L273 TraceCheckUtils]: 22: Hoare triple {14877#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14877#(<= main_~i~0 8)} is VALID [2018-11-23 12:12:12,845 INFO L273 TraceCheckUtils]: 23: Hoare triple {14877#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14884#(<= main_~i~0 9)} is VALID [2018-11-23 12:12:12,846 INFO L273 TraceCheckUtils]: 24: Hoare triple {14884#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14884#(<= main_~i~0 9)} is VALID [2018-11-23 12:12:12,846 INFO L273 TraceCheckUtils]: 25: Hoare triple {14884#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14891#(<= main_~i~0 10)} is VALID [2018-11-23 12:12:12,847 INFO L273 TraceCheckUtils]: 26: Hoare triple {14891#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14891#(<= main_~i~0 10)} is VALID [2018-11-23 12:12:12,848 INFO L273 TraceCheckUtils]: 27: Hoare triple {14891#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14898#(<= main_~i~0 11)} is VALID [2018-11-23 12:12:12,849 INFO L273 TraceCheckUtils]: 28: Hoare triple {14898#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14898#(<= main_~i~0 11)} is VALID [2018-11-23 12:12:12,849 INFO L273 TraceCheckUtils]: 29: Hoare triple {14898#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14905#(<= main_~i~0 12)} is VALID [2018-11-23 12:12:12,850 INFO L273 TraceCheckUtils]: 30: Hoare triple {14905#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14905#(<= main_~i~0 12)} is VALID [2018-11-23 12:12:12,851 INFO L273 TraceCheckUtils]: 31: Hoare triple {14905#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14912#(<= main_~i~0 13)} is VALID [2018-11-23 12:12:12,851 INFO L273 TraceCheckUtils]: 32: Hoare triple {14912#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14912#(<= main_~i~0 13)} is VALID [2018-11-23 12:12:12,852 INFO L273 TraceCheckUtils]: 33: Hoare triple {14912#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14919#(<= main_~i~0 14)} is VALID [2018-11-23 12:12:12,853 INFO L273 TraceCheckUtils]: 34: Hoare triple {14919#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14919#(<= main_~i~0 14)} is VALID [2018-11-23 12:12:12,854 INFO L273 TraceCheckUtils]: 35: Hoare triple {14919#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14926#(<= main_~i~0 15)} is VALID [2018-11-23 12:12:12,855 INFO L273 TraceCheckUtils]: 36: Hoare triple {14926#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14926#(<= main_~i~0 15)} is VALID [2018-11-23 12:12:12,855 INFO L273 TraceCheckUtils]: 37: Hoare triple {14926#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14933#(<= main_~i~0 16)} is VALID [2018-11-23 12:12:12,856 INFO L273 TraceCheckUtils]: 38: Hoare triple {14933#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14933#(<= main_~i~0 16)} is VALID [2018-11-23 12:12:12,857 INFO L273 TraceCheckUtils]: 39: Hoare triple {14933#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14940#(<= main_~i~0 17)} is VALID [2018-11-23 12:12:12,858 INFO L273 TraceCheckUtils]: 40: Hoare triple {14940#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {14940#(<= main_~i~0 17)} is VALID [2018-11-23 12:12:12,858 INFO L273 TraceCheckUtils]: 41: Hoare triple {14940#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14947#(<= main_~i~0 18)} is VALID [2018-11-23 12:12:12,859 INFO L273 TraceCheckUtils]: 42: Hoare triple {14947#(<= main_~i~0 18)} assume !(~i~0 < 100000); {14802#false} is VALID [2018-11-23 12:12:12,859 INFO L273 TraceCheckUtils]: 43: Hoare triple {14802#false} ~i~0 := 0; {14802#false} is VALID [2018-11-23 12:12:12,860 INFO L273 TraceCheckUtils]: 44: Hoare triple {14802#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {14802#false} is VALID [2018-11-23 12:12:12,860 INFO L273 TraceCheckUtils]: 45: Hoare triple {14802#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {14802#false} is VALID [2018-11-23 12:12:12,860 INFO L273 TraceCheckUtils]: 46: Hoare triple {14802#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14802#false} is VALID [2018-11-23 12:12:12,860 INFO L273 TraceCheckUtils]: 47: Hoare triple {14802#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {14802#false} is VALID [2018-11-23 12:12:12,861 INFO L273 TraceCheckUtils]: 48: Hoare triple {14802#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {14802#false} is VALID [2018-11-23 12:12:12,861 INFO L273 TraceCheckUtils]: 49: Hoare triple {14802#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14802#false} is VALID [2018-11-23 12:12:12,861 INFO L273 TraceCheckUtils]: 50: Hoare triple {14802#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {14802#false} is VALID [2018-11-23 12:12:12,861 INFO L273 TraceCheckUtils]: 51: Hoare triple {14802#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {14802#false} is VALID [2018-11-23 12:12:12,862 INFO L273 TraceCheckUtils]: 52: Hoare triple {14802#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14802#false} is VALID [2018-11-23 12:12:12,862 INFO L273 TraceCheckUtils]: 53: Hoare triple {14802#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {14802#false} is VALID [2018-11-23 12:12:12,862 INFO L273 TraceCheckUtils]: 54: Hoare triple {14802#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {14802#false} is VALID [2018-11-23 12:12:12,862 INFO L273 TraceCheckUtils]: 55: Hoare triple {14802#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14802#false} is VALID [2018-11-23 12:12:12,862 INFO L273 TraceCheckUtils]: 56: Hoare triple {14802#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {14802#false} is VALID [2018-11-23 12:12:12,863 INFO L273 TraceCheckUtils]: 57: Hoare triple {14802#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {14802#false} is VALID [2018-11-23 12:12:12,863 INFO L273 TraceCheckUtils]: 58: Hoare triple {14802#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14802#false} is VALID [2018-11-23 12:12:12,863 INFO L273 TraceCheckUtils]: 59: Hoare triple {14802#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {14802#false} is VALID [2018-11-23 12:12:12,863 INFO L273 TraceCheckUtils]: 60: Hoare triple {14802#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {14802#false} is VALID [2018-11-23 12:12:12,863 INFO L273 TraceCheckUtils]: 61: Hoare triple {14802#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14802#false} is VALID [2018-11-23 12:12:12,863 INFO L273 TraceCheckUtils]: 62: Hoare triple {14802#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {14802#false} is VALID [2018-11-23 12:12:12,863 INFO L273 TraceCheckUtils]: 63: Hoare triple {14802#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {14802#false} is VALID [2018-11-23 12:12:12,864 INFO L273 TraceCheckUtils]: 64: Hoare triple {14802#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14802#false} is VALID [2018-11-23 12:12:12,864 INFO L273 TraceCheckUtils]: 65: Hoare triple {14802#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {14802#false} is VALID [2018-11-23 12:12:12,864 INFO L273 TraceCheckUtils]: 66: Hoare triple {14802#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {14802#false} is VALID [2018-11-23 12:12:12,864 INFO L273 TraceCheckUtils]: 67: Hoare triple {14802#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14802#false} is VALID [2018-11-23 12:12:12,864 INFO L273 TraceCheckUtils]: 68: Hoare triple {14802#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {14802#false} is VALID [2018-11-23 12:12:12,864 INFO L273 TraceCheckUtils]: 69: Hoare triple {14802#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {14802#false} is VALID [2018-11-23 12:12:12,864 INFO L273 TraceCheckUtils]: 70: Hoare triple {14802#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14802#false} is VALID [2018-11-23 12:12:12,865 INFO L273 TraceCheckUtils]: 71: Hoare triple {14802#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {14802#false} is VALID [2018-11-23 12:12:12,865 INFO L273 TraceCheckUtils]: 72: Hoare triple {14802#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {14802#false} is VALID [2018-11-23 12:12:12,865 INFO L273 TraceCheckUtils]: 73: Hoare triple {14802#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14802#false} is VALID [2018-11-23 12:12:12,865 INFO L273 TraceCheckUtils]: 74: Hoare triple {14802#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {14802#false} is VALID [2018-11-23 12:12:12,865 INFO L273 TraceCheckUtils]: 75: Hoare triple {14802#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {14802#false} is VALID [2018-11-23 12:12:12,865 INFO L273 TraceCheckUtils]: 76: Hoare triple {14802#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14802#false} is VALID [2018-11-23 12:12:12,865 INFO L273 TraceCheckUtils]: 77: Hoare triple {14802#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {14802#false} is VALID [2018-11-23 12:12:12,866 INFO L273 TraceCheckUtils]: 78: Hoare triple {14802#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {14802#false} is VALID [2018-11-23 12:12:12,866 INFO L273 TraceCheckUtils]: 79: Hoare triple {14802#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14802#false} is VALID [2018-11-23 12:12:12,866 INFO L273 TraceCheckUtils]: 80: Hoare triple {14802#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {14802#false} is VALID [2018-11-23 12:12:12,866 INFO L273 TraceCheckUtils]: 81: Hoare triple {14802#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {14802#false} is VALID [2018-11-23 12:12:12,866 INFO L273 TraceCheckUtils]: 82: Hoare triple {14802#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14802#false} is VALID [2018-11-23 12:12:12,866 INFO L273 TraceCheckUtils]: 83: Hoare triple {14802#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {14802#false} is VALID [2018-11-23 12:12:12,867 INFO L273 TraceCheckUtils]: 84: Hoare triple {14802#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {14802#false} is VALID [2018-11-23 12:12:12,867 INFO L273 TraceCheckUtils]: 85: Hoare triple {14802#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14802#false} is VALID [2018-11-23 12:12:12,867 INFO L273 TraceCheckUtils]: 86: Hoare triple {14802#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {14802#false} is VALID [2018-11-23 12:12:12,867 INFO L273 TraceCheckUtils]: 87: Hoare triple {14802#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {14802#false} is VALID [2018-11-23 12:12:12,867 INFO L273 TraceCheckUtils]: 88: Hoare triple {14802#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14802#false} is VALID [2018-11-23 12:12:12,867 INFO L273 TraceCheckUtils]: 89: Hoare triple {14802#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {14802#false} is VALID [2018-11-23 12:12:12,867 INFO L273 TraceCheckUtils]: 90: Hoare triple {14802#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {14802#false} is VALID [2018-11-23 12:12:12,868 INFO L273 TraceCheckUtils]: 91: Hoare triple {14802#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14802#false} is VALID [2018-11-23 12:12:12,868 INFO L273 TraceCheckUtils]: 92: Hoare triple {14802#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {14802#false} is VALID [2018-11-23 12:12:12,868 INFO L273 TraceCheckUtils]: 93: Hoare triple {14802#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {14802#false} is VALID [2018-11-23 12:12:12,868 INFO L273 TraceCheckUtils]: 94: Hoare triple {14802#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14802#false} is VALID [2018-11-23 12:12:12,868 INFO L273 TraceCheckUtils]: 95: Hoare triple {14802#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {14802#false} is VALID [2018-11-23 12:12:12,868 INFO L273 TraceCheckUtils]: 96: Hoare triple {14802#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {14802#false} is VALID [2018-11-23 12:12:12,868 INFO L273 TraceCheckUtils]: 97: Hoare triple {14802#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14802#false} is VALID [2018-11-23 12:12:12,869 INFO L273 TraceCheckUtils]: 98: Hoare triple {14802#false} assume !(~i~0 < 100000); {14802#false} is VALID [2018-11-23 12:12:12,869 INFO L273 TraceCheckUtils]: 99: Hoare triple {14802#false} ~i~0 := 0; {14802#false} is VALID [2018-11-23 12:12:12,869 INFO L273 TraceCheckUtils]: 100: Hoare triple {14802#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem5 == #t~mem6; {14802#false} is VALID [2018-11-23 12:12:12,869 INFO L273 TraceCheckUtils]: 101: Hoare triple {14802#false} assume !#t~short10;call #t~mem9 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 == #t~mem7 * #t~mem8; {14802#false} is VALID [2018-11-23 12:12:12,869 INFO L256 TraceCheckUtils]: 102: Hoare triple {14802#false} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {14802#false} is VALID [2018-11-23 12:12:12,869 INFO L273 TraceCheckUtils]: 103: Hoare triple {14802#false} ~cond := #in~cond; {14802#false} is VALID [2018-11-23 12:12:12,870 INFO L273 TraceCheckUtils]: 104: Hoare triple {14802#false} assume 0 == ~cond; {14802#false} is VALID [2018-11-23 12:12:12,870 INFO L273 TraceCheckUtils]: 105: Hoare triple {14802#false} assume !false; {14802#false} is VALID [2018-11-23 12:12:12,881 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2018-11-23 12:12:12,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:12:12,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-11-23 12:12:12,903 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 106 [2018-11-23 12:12:12,903 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:12:12,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 12:12:12,965 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:12:12,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 12:12:12,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 12:12:12,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:12:12,966 INFO L87 Difference]: Start difference. First operand 116 states and 137 transitions. Second operand 21 states. [2018-11-23 12:12:14,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:14,708 INFO L93 Difference]: Finished difference Result 311 states and 413 transitions. [2018-11-23 12:12:14,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 12:12:14,708 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 106 [2018-11-23 12:12:14,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:12:14,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:12:14,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 296 transitions. [2018-11-23 12:12:14,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:12:14,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 296 transitions. [2018-11-23 12:12:14,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 296 transitions. [2018-11-23 12:12:14,997 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 296 edges. 296 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:12:15,004 INFO L225 Difference]: With dead ends: 311 [2018-11-23 12:12:15,004 INFO L226 Difference]: Without dead ends: 238 [2018-11-23 12:12:15,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:12:15,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-11-23 12:12:15,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 121. [2018-11-23 12:12:15,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:12:15,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 238 states. Second operand 121 states. [2018-11-23 12:12:15,085 INFO L74 IsIncluded]: Start isIncluded. First operand 238 states. Second operand 121 states. [2018-11-23 12:12:15,085 INFO L87 Difference]: Start difference. First operand 238 states. Second operand 121 states. [2018-11-23 12:12:15,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:15,090 INFO L93 Difference]: Finished difference Result 238 states and 318 transitions. [2018-11-23 12:12:15,090 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 318 transitions. [2018-11-23 12:12:15,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:12:15,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:12:15,091 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 238 states. [2018-11-23 12:12:15,092 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 238 states. [2018-11-23 12:12:15,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:15,098 INFO L93 Difference]: Finished difference Result 238 states and 318 transitions. [2018-11-23 12:12:15,098 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 318 transitions. [2018-11-23 12:12:15,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:12:15,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:12:15,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:12:15,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:12:15,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-23 12:12:15,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 143 transitions. [2018-11-23 12:12:15,101 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 143 transitions. Word has length 106 [2018-11-23 12:12:15,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:12:15,101 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 143 transitions. [2018-11-23 12:12:15,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 12:12:15,101 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 143 transitions. [2018-11-23 12:12:15,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-23 12:12:15,102 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:12:15,102 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:12:15,103 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:12:15,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:12:15,103 INFO L82 PathProgramCache]: Analyzing trace with hash 653590393, now seen corresponding path program 19 times [2018-11-23 12:12:15,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:12:15,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:12:15,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:15,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:12:15,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:15,123 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:12:15,123 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:12:15,123 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:12:15,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:12:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:12:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:12:15,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:12:15,712 INFO L256 TraceCheckUtils]: 0: Hoare triple {16226#true} call ULTIMATE.init(); {16226#true} is VALID [2018-11-23 12:12:15,713 INFO L273 TraceCheckUtils]: 1: Hoare triple {16226#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16226#true} is VALID [2018-11-23 12:12:15,713 INFO L273 TraceCheckUtils]: 2: Hoare triple {16226#true} assume true; {16226#true} is VALID [2018-11-23 12:12:15,713 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16226#true} {16226#true} #74#return; {16226#true} is VALID [2018-11-23 12:12:15,714 INFO L256 TraceCheckUtils]: 4: Hoare triple {16226#true} call #t~ret11 := main(); {16226#true} is VALID [2018-11-23 12:12:15,715 INFO L273 TraceCheckUtils]: 5: Hoare triple {16226#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);havoc ~k~0;havoc ~i~0;~i~0 := 0; {16246#(<= main_~i~0 0)} is VALID [2018-11-23 12:12:15,715 INFO L273 TraceCheckUtils]: 6: Hoare triple {16246#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16246#(<= main_~i~0 0)} is VALID [2018-11-23 12:12:15,716 INFO L273 TraceCheckUtils]: 7: Hoare triple {16246#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16253#(<= main_~i~0 1)} is VALID [2018-11-23 12:12:15,716 INFO L273 TraceCheckUtils]: 8: Hoare triple {16253#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16253#(<= main_~i~0 1)} is VALID [2018-11-23 12:12:15,716 INFO L273 TraceCheckUtils]: 9: Hoare triple {16253#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16260#(<= main_~i~0 2)} is VALID [2018-11-23 12:12:15,717 INFO L273 TraceCheckUtils]: 10: Hoare triple {16260#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16260#(<= main_~i~0 2)} is VALID [2018-11-23 12:12:15,717 INFO L273 TraceCheckUtils]: 11: Hoare triple {16260#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16267#(<= main_~i~0 3)} is VALID [2018-11-23 12:12:15,718 INFO L273 TraceCheckUtils]: 12: Hoare triple {16267#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16267#(<= main_~i~0 3)} is VALID [2018-11-23 12:12:15,718 INFO L273 TraceCheckUtils]: 13: Hoare triple {16267#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16274#(<= main_~i~0 4)} is VALID [2018-11-23 12:12:15,719 INFO L273 TraceCheckUtils]: 14: Hoare triple {16274#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16274#(<= main_~i~0 4)} is VALID [2018-11-23 12:12:15,720 INFO L273 TraceCheckUtils]: 15: Hoare triple {16274#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16281#(<= main_~i~0 5)} is VALID [2018-11-23 12:12:15,720 INFO L273 TraceCheckUtils]: 16: Hoare triple {16281#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16281#(<= main_~i~0 5)} is VALID [2018-11-23 12:12:15,721 INFO L273 TraceCheckUtils]: 17: Hoare triple {16281#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16288#(<= main_~i~0 6)} is VALID [2018-11-23 12:12:15,721 INFO L273 TraceCheckUtils]: 18: Hoare triple {16288#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16288#(<= main_~i~0 6)} is VALID [2018-11-23 12:12:15,722 INFO L273 TraceCheckUtils]: 19: Hoare triple {16288#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16295#(<= main_~i~0 7)} is VALID [2018-11-23 12:12:15,723 INFO L273 TraceCheckUtils]: 20: Hoare triple {16295#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16295#(<= main_~i~0 7)} is VALID [2018-11-23 12:12:15,723 INFO L273 TraceCheckUtils]: 21: Hoare triple {16295#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16302#(<= main_~i~0 8)} is VALID [2018-11-23 12:12:15,724 INFO L273 TraceCheckUtils]: 22: Hoare triple {16302#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16302#(<= main_~i~0 8)} is VALID [2018-11-23 12:12:15,725 INFO L273 TraceCheckUtils]: 23: Hoare triple {16302#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16309#(<= main_~i~0 9)} is VALID [2018-11-23 12:12:15,725 INFO L273 TraceCheckUtils]: 24: Hoare triple {16309#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16309#(<= main_~i~0 9)} is VALID [2018-11-23 12:12:15,726 INFO L273 TraceCheckUtils]: 25: Hoare triple {16309#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16316#(<= main_~i~0 10)} is VALID [2018-11-23 12:12:15,726 INFO L273 TraceCheckUtils]: 26: Hoare triple {16316#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16316#(<= main_~i~0 10)} is VALID [2018-11-23 12:12:15,727 INFO L273 TraceCheckUtils]: 27: Hoare triple {16316#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16323#(<= main_~i~0 11)} is VALID [2018-11-23 12:12:15,728 INFO L273 TraceCheckUtils]: 28: Hoare triple {16323#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16323#(<= main_~i~0 11)} is VALID [2018-11-23 12:12:15,729 INFO L273 TraceCheckUtils]: 29: Hoare triple {16323#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16330#(<= main_~i~0 12)} is VALID [2018-11-23 12:12:15,729 INFO L273 TraceCheckUtils]: 30: Hoare triple {16330#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16330#(<= main_~i~0 12)} is VALID [2018-11-23 12:12:15,730 INFO L273 TraceCheckUtils]: 31: Hoare triple {16330#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16337#(<= main_~i~0 13)} is VALID [2018-11-23 12:12:15,730 INFO L273 TraceCheckUtils]: 32: Hoare triple {16337#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16337#(<= main_~i~0 13)} is VALID [2018-11-23 12:12:15,731 INFO L273 TraceCheckUtils]: 33: Hoare triple {16337#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16344#(<= main_~i~0 14)} is VALID [2018-11-23 12:12:15,732 INFO L273 TraceCheckUtils]: 34: Hoare triple {16344#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16344#(<= main_~i~0 14)} is VALID [2018-11-23 12:12:15,732 INFO L273 TraceCheckUtils]: 35: Hoare triple {16344#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16351#(<= main_~i~0 15)} is VALID [2018-11-23 12:12:15,733 INFO L273 TraceCheckUtils]: 36: Hoare triple {16351#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16351#(<= main_~i~0 15)} is VALID [2018-11-23 12:12:15,734 INFO L273 TraceCheckUtils]: 37: Hoare triple {16351#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16358#(<= main_~i~0 16)} is VALID [2018-11-23 12:12:15,734 INFO L273 TraceCheckUtils]: 38: Hoare triple {16358#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16358#(<= main_~i~0 16)} is VALID [2018-11-23 12:12:15,735 INFO L273 TraceCheckUtils]: 39: Hoare triple {16358#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16365#(<= main_~i~0 17)} is VALID [2018-11-23 12:12:15,735 INFO L273 TraceCheckUtils]: 40: Hoare triple {16365#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16365#(<= main_~i~0 17)} is VALID [2018-11-23 12:12:15,736 INFO L273 TraceCheckUtils]: 41: Hoare triple {16365#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16372#(<= main_~i~0 18)} is VALID [2018-11-23 12:12:15,737 INFO L273 TraceCheckUtils]: 42: Hoare triple {16372#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {16372#(<= main_~i~0 18)} is VALID [2018-11-23 12:12:15,737 INFO L273 TraceCheckUtils]: 43: Hoare triple {16372#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16379#(<= main_~i~0 19)} is VALID [2018-11-23 12:12:15,738 INFO L273 TraceCheckUtils]: 44: Hoare triple {16379#(<= main_~i~0 19)} assume !(~i~0 < 100000); {16227#false} is VALID [2018-11-23 12:12:15,738 INFO L273 TraceCheckUtils]: 45: Hoare triple {16227#false} ~i~0 := 0; {16227#false} is VALID [2018-11-23 12:12:15,739 INFO L273 TraceCheckUtils]: 46: Hoare triple {16227#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {16227#false} is VALID [2018-11-23 12:12:15,739 INFO L273 TraceCheckUtils]: 47: Hoare triple {16227#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {16227#false} is VALID [2018-11-23 12:12:15,739 INFO L273 TraceCheckUtils]: 48: Hoare triple {16227#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16227#false} is VALID [2018-11-23 12:12:15,739 INFO L273 TraceCheckUtils]: 49: Hoare triple {16227#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {16227#false} is VALID [2018-11-23 12:12:15,739 INFO L273 TraceCheckUtils]: 50: Hoare triple {16227#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {16227#false} is VALID [2018-11-23 12:12:15,740 INFO L273 TraceCheckUtils]: 51: Hoare triple {16227#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16227#false} is VALID [2018-11-23 12:12:15,740 INFO L273 TraceCheckUtils]: 52: Hoare triple {16227#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {16227#false} is VALID [2018-11-23 12:12:15,740 INFO L273 TraceCheckUtils]: 53: Hoare triple {16227#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {16227#false} is VALID [2018-11-23 12:12:15,740 INFO L273 TraceCheckUtils]: 54: Hoare triple {16227#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16227#false} is VALID [2018-11-23 12:12:15,740 INFO L273 TraceCheckUtils]: 55: Hoare triple {16227#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {16227#false} is VALID [2018-11-23 12:12:15,741 INFO L273 TraceCheckUtils]: 56: Hoare triple {16227#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {16227#false} is VALID [2018-11-23 12:12:15,741 INFO L273 TraceCheckUtils]: 57: Hoare triple {16227#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16227#false} is VALID [2018-11-23 12:12:15,741 INFO L273 TraceCheckUtils]: 58: Hoare triple {16227#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {16227#false} is VALID [2018-11-23 12:12:15,741 INFO L273 TraceCheckUtils]: 59: Hoare triple {16227#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {16227#false} is VALID [2018-11-23 12:12:15,741 INFO L273 TraceCheckUtils]: 60: Hoare triple {16227#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16227#false} is VALID [2018-11-23 12:12:15,742 INFO L273 TraceCheckUtils]: 61: Hoare triple {16227#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {16227#false} is VALID [2018-11-23 12:12:15,742 INFO L273 TraceCheckUtils]: 62: Hoare triple {16227#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {16227#false} is VALID [2018-11-23 12:12:15,742 INFO L273 TraceCheckUtils]: 63: Hoare triple {16227#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16227#false} is VALID [2018-11-23 12:12:15,742 INFO L273 TraceCheckUtils]: 64: Hoare triple {16227#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {16227#false} is VALID [2018-11-23 12:12:15,742 INFO L273 TraceCheckUtils]: 65: Hoare triple {16227#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {16227#false} is VALID [2018-11-23 12:12:15,743 INFO L273 TraceCheckUtils]: 66: Hoare triple {16227#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16227#false} is VALID [2018-11-23 12:12:15,743 INFO L273 TraceCheckUtils]: 67: Hoare triple {16227#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {16227#false} is VALID [2018-11-23 12:12:15,743 INFO L273 TraceCheckUtils]: 68: Hoare triple {16227#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {16227#false} is VALID [2018-11-23 12:12:15,743 INFO L273 TraceCheckUtils]: 69: Hoare triple {16227#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16227#false} is VALID [2018-11-23 12:12:15,743 INFO L273 TraceCheckUtils]: 70: Hoare triple {16227#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {16227#false} is VALID [2018-11-23 12:12:15,743 INFO L273 TraceCheckUtils]: 71: Hoare triple {16227#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {16227#false} is VALID [2018-11-23 12:12:15,744 INFO L273 TraceCheckUtils]: 72: Hoare triple {16227#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16227#false} is VALID [2018-11-23 12:12:15,744 INFO L273 TraceCheckUtils]: 73: Hoare triple {16227#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {16227#false} is VALID [2018-11-23 12:12:15,744 INFO L273 TraceCheckUtils]: 74: Hoare triple {16227#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {16227#false} is VALID [2018-11-23 12:12:15,744 INFO L273 TraceCheckUtils]: 75: Hoare triple {16227#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16227#false} is VALID [2018-11-23 12:12:15,744 INFO L273 TraceCheckUtils]: 76: Hoare triple {16227#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {16227#false} is VALID [2018-11-23 12:12:15,744 INFO L273 TraceCheckUtils]: 77: Hoare triple {16227#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {16227#false} is VALID [2018-11-23 12:12:15,744 INFO L273 TraceCheckUtils]: 78: Hoare triple {16227#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16227#false} is VALID [2018-11-23 12:12:15,744 INFO L273 TraceCheckUtils]: 79: Hoare triple {16227#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {16227#false} is VALID [2018-11-23 12:12:15,745 INFO L273 TraceCheckUtils]: 80: Hoare triple {16227#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {16227#false} is VALID [2018-11-23 12:12:15,745 INFO L273 TraceCheckUtils]: 81: Hoare triple {16227#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16227#false} is VALID [2018-11-23 12:12:15,745 INFO L273 TraceCheckUtils]: 82: Hoare triple {16227#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {16227#false} is VALID [2018-11-23 12:12:15,745 INFO L273 TraceCheckUtils]: 83: Hoare triple {16227#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {16227#false} is VALID [2018-11-23 12:12:15,745 INFO L273 TraceCheckUtils]: 84: Hoare triple {16227#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16227#false} is VALID [2018-11-23 12:12:15,745 INFO L273 TraceCheckUtils]: 85: Hoare triple {16227#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {16227#false} is VALID [2018-11-23 12:12:15,745 INFO L273 TraceCheckUtils]: 86: Hoare triple {16227#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {16227#false} is VALID [2018-11-23 12:12:15,745 INFO L273 TraceCheckUtils]: 87: Hoare triple {16227#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16227#false} is VALID [2018-11-23 12:12:15,745 INFO L273 TraceCheckUtils]: 88: Hoare triple {16227#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {16227#false} is VALID [2018-11-23 12:12:15,746 INFO L273 TraceCheckUtils]: 89: Hoare triple {16227#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {16227#false} is VALID [2018-11-23 12:12:15,746 INFO L273 TraceCheckUtils]: 90: Hoare triple {16227#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16227#false} is VALID [2018-11-23 12:12:15,746 INFO L273 TraceCheckUtils]: 91: Hoare triple {16227#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {16227#false} is VALID [2018-11-23 12:12:15,746 INFO L273 TraceCheckUtils]: 92: Hoare triple {16227#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {16227#false} is VALID [2018-11-23 12:12:15,746 INFO L273 TraceCheckUtils]: 93: Hoare triple {16227#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16227#false} is VALID [2018-11-23 12:12:15,746 INFO L273 TraceCheckUtils]: 94: Hoare triple {16227#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {16227#false} is VALID [2018-11-23 12:12:15,746 INFO L273 TraceCheckUtils]: 95: Hoare triple {16227#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {16227#false} is VALID [2018-11-23 12:12:15,746 INFO L273 TraceCheckUtils]: 96: Hoare triple {16227#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16227#false} is VALID [2018-11-23 12:12:15,746 INFO L273 TraceCheckUtils]: 97: Hoare triple {16227#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {16227#false} is VALID [2018-11-23 12:12:15,747 INFO L273 TraceCheckUtils]: 98: Hoare triple {16227#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {16227#false} is VALID [2018-11-23 12:12:15,747 INFO L273 TraceCheckUtils]: 99: Hoare triple {16227#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16227#false} is VALID [2018-11-23 12:12:15,747 INFO L273 TraceCheckUtils]: 100: Hoare triple {16227#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {16227#false} is VALID [2018-11-23 12:12:15,747 INFO L273 TraceCheckUtils]: 101: Hoare triple {16227#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {16227#false} is VALID [2018-11-23 12:12:15,747 INFO L273 TraceCheckUtils]: 102: Hoare triple {16227#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16227#false} is VALID [2018-11-23 12:12:15,747 INFO L273 TraceCheckUtils]: 103: Hoare triple {16227#false} assume !(~i~0 < 100000); {16227#false} is VALID [2018-11-23 12:12:15,747 INFO L273 TraceCheckUtils]: 104: Hoare triple {16227#false} ~i~0 := 0; {16227#false} is VALID [2018-11-23 12:12:15,747 INFO L273 TraceCheckUtils]: 105: Hoare triple {16227#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem5 == #t~mem6; {16227#false} is VALID [2018-11-23 12:12:15,748 INFO L273 TraceCheckUtils]: 106: Hoare triple {16227#false} assume !#t~short10;call #t~mem9 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 == #t~mem7 * #t~mem8; {16227#false} is VALID [2018-11-23 12:12:15,748 INFO L256 TraceCheckUtils]: 107: Hoare triple {16227#false} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {16227#false} is VALID [2018-11-23 12:12:15,748 INFO L273 TraceCheckUtils]: 108: Hoare triple {16227#false} ~cond := #in~cond; {16227#false} is VALID [2018-11-23 12:12:15,748 INFO L273 TraceCheckUtils]: 109: Hoare triple {16227#false} assume 0 == ~cond; {16227#false} is VALID [2018-11-23 12:12:15,748 INFO L273 TraceCheckUtils]: 110: Hoare triple {16227#false} assume !false; {16227#false} is VALID [2018-11-23 12:12:15,754 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2018-11-23 12:12:15,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:12:15,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-11-23 12:12:15,774 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 111 [2018-11-23 12:12:15,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:12:15,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 12:12:15,842 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:12:15,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 12:12:15,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 12:12:15,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:12:15,842 INFO L87 Difference]: Start difference. First operand 121 states and 143 transitions. Second operand 22 states. [2018-11-23 12:12:17,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:17,999 INFO L93 Difference]: Finished difference Result 325 states and 432 transitions. [2018-11-23 12:12:17,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 12:12:17,999 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 111 [2018-11-23 12:12:18,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:12:18,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:12:18,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 309 transitions. [2018-11-23 12:12:18,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:12:18,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 309 transitions. [2018-11-23 12:12:18,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 309 transitions. [2018-11-23 12:12:18,294 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 309 edges. 309 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:12:18,300 INFO L225 Difference]: With dead ends: 325 [2018-11-23 12:12:18,301 INFO L226 Difference]: Without dead ends: 249 [2018-11-23 12:12:18,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:12:18,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-11-23 12:12:18,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 126. [2018-11-23 12:12:18,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:12:18,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 249 states. Second operand 126 states. [2018-11-23 12:12:18,399 INFO L74 IsIncluded]: Start isIncluded. First operand 249 states. Second operand 126 states. [2018-11-23 12:12:18,399 INFO L87 Difference]: Start difference. First operand 249 states. Second operand 126 states. [2018-11-23 12:12:18,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:18,405 INFO L93 Difference]: Finished difference Result 249 states and 333 transitions. [2018-11-23 12:12:18,405 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 333 transitions. [2018-11-23 12:12:18,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:12:18,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:12:18,406 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 249 states. [2018-11-23 12:12:18,406 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 249 states. [2018-11-23 12:12:18,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:18,412 INFO L93 Difference]: Finished difference Result 249 states and 333 transitions. [2018-11-23 12:12:18,412 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 333 transitions. [2018-11-23 12:12:18,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:12:18,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:12:18,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:12:18,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:12:18,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-23 12:12:18,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 149 transitions. [2018-11-23 12:12:18,415 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 149 transitions. Word has length 111 [2018-11-23 12:12:18,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:12:18,415 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 149 transitions. [2018-11-23 12:12:18,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 12:12:18,415 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 149 transitions. [2018-11-23 12:12:18,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-23 12:12:18,416 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:12:18,416 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:12:18,417 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:12:18,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:12:18,417 INFO L82 PathProgramCache]: Analyzing trace with hash 238509200, now seen corresponding path program 20 times [2018-11-23 12:12:18,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:12:18,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:12:18,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:18,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:12:18,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:18,436 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:12:18,436 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:12:18,436 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:12:18,449 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:12:18,494 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:12:18,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:12:18,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:12:18,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:12:19,029 INFO L256 TraceCheckUtils]: 0: Hoare triple {17716#true} call ULTIMATE.init(); {17716#true} is VALID [2018-11-23 12:12:19,029 INFO L273 TraceCheckUtils]: 1: Hoare triple {17716#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17716#true} is VALID [2018-11-23 12:12:19,029 INFO L273 TraceCheckUtils]: 2: Hoare triple {17716#true} assume true; {17716#true} is VALID [2018-11-23 12:12:19,030 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17716#true} {17716#true} #74#return; {17716#true} is VALID [2018-11-23 12:12:19,030 INFO L256 TraceCheckUtils]: 4: Hoare triple {17716#true} call #t~ret11 := main(); {17716#true} is VALID [2018-11-23 12:12:19,031 INFO L273 TraceCheckUtils]: 5: Hoare triple {17716#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);havoc ~k~0;havoc ~i~0;~i~0 := 0; {17736#(<= main_~i~0 0)} is VALID [2018-11-23 12:12:19,031 INFO L273 TraceCheckUtils]: 6: Hoare triple {17736#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17736#(<= main_~i~0 0)} is VALID [2018-11-23 12:12:19,032 INFO L273 TraceCheckUtils]: 7: Hoare triple {17736#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17743#(<= main_~i~0 1)} is VALID [2018-11-23 12:12:19,032 INFO L273 TraceCheckUtils]: 8: Hoare triple {17743#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17743#(<= main_~i~0 1)} is VALID [2018-11-23 12:12:19,032 INFO L273 TraceCheckUtils]: 9: Hoare triple {17743#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17750#(<= main_~i~0 2)} is VALID [2018-11-23 12:12:19,033 INFO L273 TraceCheckUtils]: 10: Hoare triple {17750#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17750#(<= main_~i~0 2)} is VALID [2018-11-23 12:12:19,033 INFO L273 TraceCheckUtils]: 11: Hoare triple {17750#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17757#(<= main_~i~0 3)} is VALID [2018-11-23 12:12:19,033 INFO L273 TraceCheckUtils]: 12: Hoare triple {17757#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17757#(<= main_~i~0 3)} is VALID [2018-11-23 12:12:19,034 INFO L273 TraceCheckUtils]: 13: Hoare triple {17757#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17764#(<= main_~i~0 4)} is VALID [2018-11-23 12:12:19,035 INFO L273 TraceCheckUtils]: 14: Hoare triple {17764#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17764#(<= main_~i~0 4)} is VALID [2018-11-23 12:12:19,035 INFO L273 TraceCheckUtils]: 15: Hoare triple {17764#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17771#(<= main_~i~0 5)} is VALID [2018-11-23 12:12:19,036 INFO L273 TraceCheckUtils]: 16: Hoare triple {17771#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17771#(<= main_~i~0 5)} is VALID [2018-11-23 12:12:19,037 INFO L273 TraceCheckUtils]: 17: Hoare triple {17771#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17778#(<= main_~i~0 6)} is VALID [2018-11-23 12:12:19,037 INFO L273 TraceCheckUtils]: 18: Hoare triple {17778#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17778#(<= main_~i~0 6)} is VALID [2018-11-23 12:12:19,038 INFO L273 TraceCheckUtils]: 19: Hoare triple {17778#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17785#(<= main_~i~0 7)} is VALID [2018-11-23 12:12:19,038 INFO L273 TraceCheckUtils]: 20: Hoare triple {17785#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17785#(<= main_~i~0 7)} is VALID [2018-11-23 12:12:19,039 INFO L273 TraceCheckUtils]: 21: Hoare triple {17785#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17792#(<= main_~i~0 8)} is VALID [2018-11-23 12:12:19,040 INFO L273 TraceCheckUtils]: 22: Hoare triple {17792#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17792#(<= main_~i~0 8)} is VALID [2018-11-23 12:12:19,040 INFO L273 TraceCheckUtils]: 23: Hoare triple {17792#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17799#(<= main_~i~0 9)} is VALID [2018-11-23 12:12:19,041 INFO L273 TraceCheckUtils]: 24: Hoare triple {17799#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17799#(<= main_~i~0 9)} is VALID [2018-11-23 12:12:19,042 INFO L273 TraceCheckUtils]: 25: Hoare triple {17799#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17806#(<= main_~i~0 10)} is VALID [2018-11-23 12:12:19,042 INFO L273 TraceCheckUtils]: 26: Hoare triple {17806#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17806#(<= main_~i~0 10)} is VALID [2018-11-23 12:12:19,043 INFO L273 TraceCheckUtils]: 27: Hoare triple {17806#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17813#(<= main_~i~0 11)} is VALID [2018-11-23 12:12:19,044 INFO L273 TraceCheckUtils]: 28: Hoare triple {17813#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17813#(<= main_~i~0 11)} is VALID [2018-11-23 12:12:19,044 INFO L273 TraceCheckUtils]: 29: Hoare triple {17813#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17820#(<= main_~i~0 12)} is VALID [2018-11-23 12:12:19,045 INFO L273 TraceCheckUtils]: 30: Hoare triple {17820#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17820#(<= main_~i~0 12)} is VALID [2018-11-23 12:12:19,046 INFO L273 TraceCheckUtils]: 31: Hoare triple {17820#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17827#(<= main_~i~0 13)} is VALID [2018-11-23 12:12:19,046 INFO L273 TraceCheckUtils]: 32: Hoare triple {17827#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17827#(<= main_~i~0 13)} is VALID [2018-11-23 12:12:19,047 INFO L273 TraceCheckUtils]: 33: Hoare triple {17827#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17834#(<= main_~i~0 14)} is VALID [2018-11-23 12:12:19,047 INFO L273 TraceCheckUtils]: 34: Hoare triple {17834#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17834#(<= main_~i~0 14)} is VALID [2018-11-23 12:12:19,048 INFO L273 TraceCheckUtils]: 35: Hoare triple {17834#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17841#(<= main_~i~0 15)} is VALID [2018-11-23 12:12:19,049 INFO L273 TraceCheckUtils]: 36: Hoare triple {17841#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17841#(<= main_~i~0 15)} is VALID [2018-11-23 12:12:19,068 INFO L273 TraceCheckUtils]: 37: Hoare triple {17841#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17848#(<= main_~i~0 16)} is VALID [2018-11-23 12:12:19,069 INFO L273 TraceCheckUtils]: 38: Hoare triple {17848#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17848#(<= main_~i~0 16)} is VALID [2018-11-23 12:12:19,069 INFO L273 TraceCheckUtils]: 39: Hoare triple {17848#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17855#(<= main_~i~0 17)} is VALID [2018-11-23 12:12:19,070 INFO L273 TraceCheckUtils]: 40: Hoare triple {17855#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17855#(<= main_~i~0 17)} is VALID [2018-11-23 12:12:19,070 INFO L273 TraceCheckUtils]: 41: Hoare triple {17855#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17862#(<= main_~i~0 18)} is VALID [2018-11-23 12:12:19,070 INFO L273 TraceCheckUtils]: 42: Hoare triple {17862#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17862#(<= main_~i~0 18)} is VALID [2018-11-23 12:12:19,071 INFO L273 TraceCheckUtils]: 43: Hoare triple {17862#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17869#(<= main_~i~0 19)} is VALID [2018-11-23 12:12:19,071 INFO L273 TraceCheckUtils]: 44: Hoare triple {17869#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {17869#(<= main_~i~0 19)} is VALID [2018-11-23 12:12:19,072 INFO L273 TraceCheckUtils]: 45: Hoare triple {17869#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17876#(<= main_~i~0 20)} is VALID [2018-11-23 12:12:19,072 INFO L273 TraceCheckUtils]: 46: Hoare triple {17876#(<= main_~i~0 20)} assume !(~i~0 < 100000); {17717#false} is VALID [2018-11-23 12:12:19,072 INFO L273 TraceCheckUtils]: 47: Hoare triple {17717#false} ~i~0 := 0; {17717#false} is VALID [2018-11-23 12:12:19,072 INFO L273 TraceCheckUtils]: 48: Hoare triple {17717#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {17717#false} is VALID [2018-11-23 12:12:19,072 INFO L273 TraceCheckUtils]: 49: Hoare triple {17717#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {17717#false} is VALID [2018-11-23 12:12:19,073 INFO L273 TraceCheckUtils]: 50: Hoare triple {17717#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17717#false} is VALID [2018-11-23 12:12:19,073 INFO L273 TraceCheckUtils]: 51: Hoare triple {17717#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {17717#false} is VALID [2018-11-23 12:12:19,073 INFO L273 TraceCheckUtils]: 52: Hoare triple {17717#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {17717#false} is VALID [2018-11-23 12:12:19,073 INFO L273 TraceCheckUtils]: 53: Hoare triple {17717#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17717#false} is VALID [2018-11-23 12:12:19,073 INFO L273 TraceCheckUtils]: 54: Hoare triple {17717#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {17717#false} is VALID [2018-11-23 12:12:19,073 INFO L273 TraceCheckUtils]: 55: Hoare triple {17717#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {17717#false} is VALID [2018-11-23 12:12:19,073 INFO L273 TraceCheckUtils]: 56: Hoare triple {17717#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17717#false} is VALID [2018-11-23 12:12:19,073 INFO L273 TraceCheckUtils]: 57: Hoare triple {17717#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {17717#false} is VALID [2018-11-23 12:12:19,073 INFO L273 TraceCheckUtils]: 58: Hoare triple {17717#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {17717#false} is VALID [2018-11-23 12:12:19,074 INFO L273 TraceCheckUtils]: 59: Hoare triple {17717#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17717#false} is VALID [2018-11-23 12:12:19,074 INFO L273 TraceCheckUtils]: 60: Hoare triple {17717#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {17717#false} is VALID [2018-11-23 12:12:19,074 INFO L273 TraceCheckUtils]: 61: Hoare triple {17717#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {17717#false} is VALID [2018-11-23 12:12:19,074 INFO L273 TraceCheckUtils]: 62: Hoare triple {17717#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17717#false} is VALID [2018-11-23 12:12:19,074 INFO L273 TraceCheckUtils]: 63: Hoare triple {17717#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {17717#false} is VALID [2018-11-23 12:12:19,075 INFO L273 TraceCheckUtils]: 64: Hoare triple {17717#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {17717#false} is VALID [2018-11-23 12:12:19,075 INFO L273 TraceCheckUtils]: 65: Hoare triple {17717#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17717#false} is VALID [2018-11-23 12:12:19,075 INFO L273 TraceCheckUtils]: 66: Hoare triple {17717#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {17717#false} is VALID [2018-11-23 12:12:19,075 INFO L273 TraceCheckUtils]: 67: Hoare triple {17717#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {17717#false} is VALID [2018-11-23 12:12:19,075 INFO L273 TraceCheckUtils]: 68: Hoare triple {17717#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17717#false} is VALID [2018-11-23 12:12:19,076 INFO L273 TraceCheckUtils]: 69: Hoare triple {17717#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {17717#false} is VALID [2018-11-23 12:12:19,076 INFO L273 TraceCheckUtils]: 70: Hoare triple {17717#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {17717#false} is VALID [2018-11-23 12:12:19,076 INFO L273 TraceCheckUtils]: 71: Hoare triple {17717#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17717#false} is VALID [2018-11-23 12:12:19,076 INFO L273 TraceCheckUtils]: 72: Hoare triple {17717#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {17717#false} is VALID [2018-11-23 12:12:19,076 INFO L273 TraceCheckUtils]: 73: Hoare triple {17717#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {17717#false} is VALID [2018-11-23 12:12:19,077 INFO L273 TraceCheckUtils]: 74: Hoare triple {17717#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17717#false} is VALID [2018-11-23 12:12:19,077 INFO L273 TraceCheckUtils]: 75: Hoare triple {17717#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {17717#false} is VALID [2018-11-23 12:12:19,077 INFO L273 TraceCheckUtils]: 76: Hoare triple {17717#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {17717#false} is VALID [2018-11-23 12:12:19,077 INFO L273 TraceCheckUtils]: 77: Hoare triple {17717#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17717#false} is VALID [2018-11-23 12:12:19,077 INFO L273 TraceCheckUtils]: 78: Hoare triple {17717#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {17717#false} is VALID [2018-11-23 12:12:19,077 INFO L273 TraceCheckUtils]: 79: Hoare triple {17717#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {17717#false} is VALID [2018-11-23 12:12:19,077 INFO L273 TraceCheckUtils]: 80: Hoare triple {17717#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17717#false} is VALID [2018-11-23 12:12:19,077 INFO L273 TraceCheckUtils]: 81: Hoare triple {17717#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {17717#false} is VALID [2018-11-23 12:12:19,078 INFO L273 TraceCheckUtils]: 82: Hoare triple {17717#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {17717#false} is VALID [2018-11-23 12:12:19,078 INFO L273 TraceCheckUtils]: 83: Hoare triple {17717#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17717#false} is VALID [2018-11-23 12:12:19,078 INFO L273 TraceCheckUtils]: 84: Hoare triple {17717#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {17717#false} is VALID [2018-11-23 12:12:19,078 INFO L273 TraceCheckUtils]: 85: Hoare triple {17717#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {17717#false} is VALID [2018-11-23 12:12:19,078 INFO L273 TraceCheckUtils]: 86: Hoare triple {17717#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17717#false} is VALID [2018-11-23 12:12:19,078 INFO L273 TraceCheckUtils]: 87: Hoare triple {17717#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {17717#false} is VALID [2018-11-23 12:12:19,078 INFO L273 TraceCheckUtils]: 88: Hoare triple {17717#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {17717#false} is VALID [2018-11-23 12:12:19,078 INFO L273 TraceCheckUtils]: 89: Hoare triple {17717#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17717#false} is VALID [2018-11-23 12:12:19,078 INFO L273 TraceCheckUtils]: 90: Hoare triple {17717#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {17717#false} is VALID [2018-11-23 12:12:19,079 INFO L273 TraceCheckUtils]: 91: Hoare triple {17717#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {17717#false} is VALID [2018-11-23 12:12:19,079 INFO L273 TraceCheckUtils]: 92: Hoare triple {17717#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17717#false} is VALID [2018-11-23 12:12:19,079 INFO L273 TraceCheckUtils]: 93: Hoare triple {17717#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {17717#false} is VALID [2018-11-23 12:12:19,079 INFO L273 TraceCheckUtils]: 94: Hoare triple {17717#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {17717#false} is VALID [2018-11-23 12:12:19,079 INFO L273 TraceCheckUtils]: 95: Hoare triple {17717#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17717#false} is VALID [2018-11-23 12:12:19,079 INFO L273 TraceCheckUtils]: 96: Hoare triple {17717#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {17717#false} is VALID [2018-11-23 12:12:19,079 INFO L273 TraceCheckUtils]: 97: Hoare triple {17717#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {17717#false} is VALID [2018-11-23 12:12:19,079 INFO L273 TraceCheckUtils]: 98: Hoare triple {17717#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17717#false} is VALID [2018-11-23 12:12:19,080 INFO L273 TraceCheckUtils]: 99: Hoare triple {17717#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {17717#false} is VALID [2018-11-23 12:12:19,080 INFO L273 TraceCheckUtils]: 100: Hoare triple {17717#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {17717#false} is VALID [2018-11-23 12:12:19,080 INFO L273 TraceCheckUtils]: 101: Hoare triple {17717#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17717#false} is VALID [2018-11-23 12:12:19,080 INFO L273 TraceCheckUtils]: 102: Hoare triple {17717#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {17717#false} is VALID [2018-11-23 12:12:19,080 INFO L273 TraceCheckUtils]: 103: Hoare triple {17717#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {17717#false} is VALID [2018-11-23 12:12:19,080 INFO L273 TraceCheckUtils]: 104: Hoare triple {17717#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17717#false} is VALID [2018-11-23 12:12:19,080 INFO L273 TraceCheckUtils]: 105: Hoare triple {17717#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {17717#false} is VALID [2018-11-23 12:12:19,080 INFO L273 TraceCheckUtils]: 106: Hoare triple {17717#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {17717#false} is VALID [2018-11-23 12:12:19,080 INFO L273 TraceCheckUtils]: 107: Hoare triple {17717#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17717#false} is VALID [2018-11-23 12:12:19,081 INFO L273 TraceCheckUtils]: 108: Hoare triple {17717#false} assume !(~i~0 < 100000); {17717#false} is VALID [2018-11-23 12:12:19,081 INFO L273 TraceCheckUtils]: 109: Hoare triple {17717#false} ~i~0 := 0; {17717#false} is VALID [2018-11-23 12:12:19,081 INFO L273 TraceCheckUtils]: 110: Hoare triple {17717#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem5 == #t~mem6; {17717#false} is VALID [2018-11-23 12:12:19,081 INFO L273 TraceCheckUtils]: 111: Hoare triple {17717#false} assume !#t~short10;call #t~mem9 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 == #t~mem7 * #t~mem8; {17717#false} is VALID [2018-11-23 12:12:19,081 INFO L256 TraceCheckUtils]: 112: Hoare triple {17717#false} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {17717#false} is VALID [2018-11-23 12:12:19,081 INFO L273 TraceCheckUtils]: 113: Hoare triple {17717#false} ~cond := #in~cond; {17717#false} is VALID [2018-11-23 12:12:19,081 INFO L273 TraceCheckUtils]: 114: Hoare triple {17717#false} assume 0 == ~cond; {17717#false} is VALID [2018-11-23 12:12:19,081 INFO L273 TraceCheckUtils]: 115: Hoare triple {17717#false} assume !false; {17717#false} is VALID [2018-11-23 12:12:19,088 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2018-11-23 12:12:19,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:12:19,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-11-23 12:12:19,107 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 116 [2018-11-23 12:12:19,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:12:19,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 12:12:19,165 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:12:19,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 12:12:19,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 12:12:19,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:12:19,166 INFO L87 Difference]: Start difference. First operand 126 states and 149 transitions. Second operand 23 states. [2018-11-23 12:12:20,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:20,836 INFO L93 Difference]: Finished difference Result 339 states and 451 transitions. [2018-11-23 12:12:20,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 12:12:20,836 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 116 [2018-11-23 12:12:20,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:12:20,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:12:20,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 322 transitions. [2018-11-23 12:12:20,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:12:20,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 322 transitions. [2018-11-23 12:12:20,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 322 transitions. [2018-11-23 12:12:21,150 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 322 edges. 322 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:12:21,156 INFO L225 Difference]: With dead ends: 339 [2018-11-23 12:12:21,156 INFO L226 Difference]: Without dead ends: 260 [2018-11-23 12:12:21,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:12:21,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-11-23 12:12:21,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 131. [2018-11-23 12:12:21,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:12:21,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 260 states. Second operand 131 states. [2018-11-23 12:12:21,272 INFO L74 IsIncluded]: Start isIncluded. First operand 260 states. Second operand 131 states. [2018-11-23 12:12:21,272 INFO L87 Difference]: Start difference. First operand 260 states. Second operand 131 states. [2018-11-23 12:12:21,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:21,280 INFO L93 Difference]: Finished difference Result 260 states and 348 transitions. [2018-11-23 12:12:21,281 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 348 transitions. [2018-11-23 12:12:21,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:12:21,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:12:21,282 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 260 states. [2018-11-23 12:12:21,282 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 260 states. [2018-11-23 12:12:21,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:21,289 INFO L93 Difference]: Finished difference Result 260 states and 348 transitions. [2018-11-23 12:12:21,289 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 348 transitions. [2018-11-23 12:12:21,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:12:21,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:12:21,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:12:21,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:12:21,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-23 12:12:21,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 155 transitions. [2018-11-23 12:12:21,293 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 155 transitions. Word has length 116 [2018-11-23 12:12:21,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:12:21,293 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 155 transitions. [2018-11-23 12:12:21,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 12:12:21,293 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 155 transitions. [2018-11-23 12:12:21,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-23 12:12:21,294 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:12:21,294 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:12:21,294 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:12:21,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:12:21,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1229732245, now seen corresponding path program 21 times [2018-11-23 12:12:21,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:12:21,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:12:21,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:21,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:12:21,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:21,311 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:12:21,312 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:12:21,312 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:12:21,324 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:12:25,656 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-23 12:12:25,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:12:25,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:12:25,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:12:26,130 INFO L256 TraceCheckUtils]: 0: Hoare triple {19271#true} call ULTIMATE.init(); {19271#true} is VALID [2018-11-23 12:12:26,131 INFO L273 TraceCheckUtils]: 1: Hoare triple {19271#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19271#true} is VALID [2018-11-23 12:12:26,131 INFO L273 TraceCheckUtils]: 2: Hoare triple {19271#true} assume true; {19271#true} is VALID [2018-11-23 12:12:26,131 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19271#true} {19271#true} #74#return; {19271#true} is VALID [2018-11-23 12:12:26,131 INFO L256 TraceCheckUtils]: 4: Hoare triple {19271#true} call #t~ret11 := main(); {19271#true} is VALID [2018-11-23 12:12:26,132 INFO L273 TraceCheckUtils]: 5: Hoare triple {19271#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);havoc ~k~0;havoc ~i~0;~i~0 := 0; {19271#true} is VALID [2018-11-23 12:12:26,132 INFO L273 TraceCheckUtils]: 6: Hoare triple {19271#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19271#true} is VALID [2018-11-23 12:12:26,132 INFO L273 TraceCheckUtils]: 7: Hoare triple {19271#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19271#true} is VALID [2018-11-23 12:12:26,132 INFO L273 TraceCheckUtils]: 8: Hoare triple {19271#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19271#true} is VALID [2018-11-23 12:12:26,132 INFO L273 TraceCheckUtils]: 9: Hoare triple {19271#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19271#true} is VALID [2018-11-23 12:12:26,133 INFO L273 TraceCheckUtils]: 10: Hoare triple {19271#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19271#true} is VALID [2018-11-23 12:12:26,133 INFO L273 TraceCheckUtils]: 11: Hoare triple {19271#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19271#true} is VALID [2018-11-23 12:12:26,133 INFO L273 TraceCheckUtils]: 12: Hoare triple {19271#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19271#true} is VALID [2018-11-23 12:12:26,133 INFO L273 TraceCheckUtils]: 13: Hoare triple {19271#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19271#true} is VALID [2018-11-23 12:12:26,133 INFO L273 TraceCheckUtils]: 14: Hoare triple {19271#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19271#true} is VALID [2018-11-23 12:12:26,134 INFO L273 TraceCheckUtils]: 15: Hoare triple {19271#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19271#true} is VALID [2018-11-23 12:12:26,134 INFO L273 TraceCheckUtils]: 16: Hoare triple {19271#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19271#true} is VALID [2018-11-23 12:12:26,134 INFO L273 TraceCheckUtils]: 17: Hoare triple {19271#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19271#true} is VALID [2018-11-23 12:12:26,134 INFO L273 TraceCheckUtils]: 18: Hoare triple {19271#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19271#true} is VALID [2018-11-23 12:12:26,134 INFO L273 TraceCheckUtils]: 19: Hoare triple {19271#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19271#true} is VALID [2018-11-23 12:12:26,134 INFO L273 TraceCheckUtils]: 20: Hoare triple {19271#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19271#true} is VALID [2018-11-23 12:12:26,134 INFO L273 TraceCheckUtils]: 21: Hoare triple {19271#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19271#true} is VALID [2018-11-23 12:12:26,135 INFO L273 TraceCheckUtils]: 22: Hoare triple {19271#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19271#true} is VALID [2018-11-23 12:12:26,135 INFO L273 TraceCheckUtils]: 23: Hoare triple {19271#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19271#true} is VALID [2018-11-23 12:12:26,135 INFO L273 TraceCheckUtils]: 24: Hoare triple {19271#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19271#true} is VALID [2018-11-23 12:12:26,135 INFO L273 TraceCheckUtils]: 25: Hoare triple {19271#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19271#true} is VALID [2018-11-23 12:12:26,135 INFO L273 TraceCheckUtils]: 26: Hoare triple {19271#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19271#true} is VALID [2018-11-23 12:12:26,135 INFO L273 TraceCheckUtils]: 27: Hoare triple {19271#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19271#true} is VALID [2018-11-23 12:12:26,135 INFO L273 TraceCheckUtils]: 28: Hoare triple {19271#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19271#true} is VALID [2018-11-23 12:12:26,135 INFO L273 TraceCheckUtils]: 29: Hoare triple {19271#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19271#true} is VALID [2018-11-23 12:12:26,135 INFO L273 TraceCheckUtils]: 30: Hoare triple {19271#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19271#true} is VALID [2018-11-23 12:12:26,136 INFO L273 TraceCheckUtils]: 31: Hoare triple {19271#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19271#true} is VALID [2018-11-23 12:12:26,136 INFO L273 TraceCheckUtils]: 32: Hoare triple {19271#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19271#true} is VALID [2018-11-23 12:12:26,136 INFO L273 TraceCheckUtils]: 33: Hoare triple {19271#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19271#true} is VALID [2018-11-23 12:12:26,136 INFO L273 TraceCheckUtils]: 34: Hoare triple {19271#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19271#true} is VALID [2018-11-23 12:12:26,136 INFO L273 TraceCheckUtils]: 35: Hoare triple {19271#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19271#true} is VALID [2018-11-23 12:12:26,136 INFO L273 TraceCheckUtils]: 36: Hoare triple {19271#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19271#true} is VALID [2018-11-23 12:12:26,136 INFO L273 TraceCheckUtils]: 37: Hoare triple {19271#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19271#true} is VALID [2018-11-23 12:12:26,136 INFO L273 TraceCheckUtils]: 38: Hoare triple {19271#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19271#true} is VALID [2018-11-23 12:12:26,136 INFO L273 TraceCheckUtils]: 39: Hoare triple {19271#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19271#true} is VALID [2018-11-23 12:12:26,137 INFO L273 TraceCheckUtils]: 40: Hoare triple {19271#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19271#true} is VALID [2018-11-23 12:12:26,137 INFO L273 TraceCheckUtils]: 41: Hoare triple {19271#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19271#true} is VALID [2018-11-23 12:12:26,137 INFO L273 TraceCheckUtils]: 42: Hoare triple {19271#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19271#true} is VALID [2018-11-23 12:12:26,137 INFO L273 TraceCheckUtils]: 43: Hoare triple {19271#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19271#true} is VALID [2018-11-23 12:12:26,137 INFO L273 TraceCheckUtils]: 44: Hoare triple {19271#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19271#true} is VALID [2018-11-23 12:12:26,137 INFO L273 TraceCheckUtils]: 45: Hoare triple {19271#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19271#true} is VALID [2018-11-23 12:12:26,137 INFO L273 TraceCheckUtils]: 46: Hoare triple {19271#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {19271#true} is VALID [2018-11-23 12:12:26,137 INFO L273 TraceCheckUtils]: 47: Hoare triple {19271#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19271#true} is VALID [2018-11-23 12:12:26,138 INFO L273 TraceCheckUtils]: 48: Hoare triple {19271#true} assume !(~i~0 < 100000); {19271#true} is VALID [2018-11-23 12:12:26,138 INFO L273 TraceCheckUtils]: 49: Hoare triple {19271#true} ~i~0 := 0; {19423#(<= main_~i~0 0)} is VALID [2018-11-23 12:12:26,138 INFO L273 TraceCheckUtils]: 50: Hoare triple {19423#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {19423#(<= main_~i~0 0)} is VALID [2018-11-23 12:12:26,139 INFO L273 TraceCheckUtils]: 51: Hoare triple {19423#(<= main_~i~0 0)} assume !(0 != #t~nondet2);havoc #t~nondet2; {19423#(<= main_~i~0 0)} is VALID [2018-11-23 12:12:26,139 INFO L273 TraceCheckUtils]: 52: Hoare triple {19423#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19433#(<= main_~i~0 1)} is VALID [2018-11-23 12:12:26,139 INFO L273 TraceCheckUtils]: 53: Hoare triple {19433#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {19433#(<= main_~i~0 1)} is VALID [2018-11-23 12:12:26,140 INFO L273 TraceCheckUtils]: 54: Hoare triple {19433#(<= main_~i~0 1)} assume !(0 != #t~nondet2);havoc #t~nondet2; {19433#(<= main_~i~0 1)} is VALID [2018-11-23 12:12:26,140 INFO L273 TraceCheckUtils]: 55: Hoare triple {19433#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19443#(<= main_~i~0 2)} is VALID [2018-11-23 12:12:26,141 INFO L273 TraceCheckUtils]: 56: Hoare triple {19443#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {19443#(<= main_~i~0 2)} is VALID [2018-11-23 12:12:26,141 INFO L273 TraceCheckUtils]: 57: Hoare triple {19443#(<= main_~i~0 2)} assume !(0 != #t~nondet2);havoc #t~nondet2; {19443#(<= main_~i~0 2)} is VALID [2018-11-23 12:12:26,142 INFO L273 TraceCheckUtils]: 58: Hoare triple {19443#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19453#(<= main_~i~0 3)} is VALID [2018-11-23 12:12:26,142 INFO L273 TraceCheckUtils]: 59: Hoare triple {19453#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {19453#(<= main_~i~0 3)} is VALID [2018-11-23 12:12:26,143 INFO L273 TraceCheckUtils]: 60: Hoare triple {19453#(<= main_~i~0 3)} assume !(0 != #t~nondet2);havoc #t~nondet2; {19453#(<= main_~i~0 3)} is VALID [2018-11-23 12:12:26,143 INFO L273 TraceCheckUtils]: 61: Hoare triple {19453#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19463#(<= main_~i~0 4)} is VALID [2018-11-23 12:12:26,144 INFO L273 TraceCheckUtils]: 62: Hoare triple {19463#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {19463#(<= main_~i~0 4)} is VALID [2018-11-23 12:12:26,144 INFO L273 TraceCheckUtils]: 63: Hoare triple {19463#(<= main_~i~0 4)} assume !(0 != #t~nondet2);havoc #t~nondet2; {19463#(<= main_~i~0 4)} is VALID [2018-11-23 12:12:26,145 INFO L273 TraceCheckUtils]: 64: Hoare triple {19463#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19473#(<= main_~i~0 5)} is VALID [2018-11-23 12:12:26,145 INFO L273 TraceCheckUtils]: 65: Hoare triple {19473#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {19473#(<= main_~i~0 5)} is VALID [2018-11-23 12:12:26,146 INFO L273 TraceCheckUtils]: 66: Hoare triple {19473#(<= main_~i~0 5)} assume !(0 != #t~nondet2);havoc #t~nondet2; {19473#(<= main_~i~0 5)} is VALID [2018-11-23 12:12:26,147 INFO L273 TraceCheckUtils]: 67: Hoare triple {19473#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19483#(<= main_~i~0 6)} is VALID [2018-11-23 12:12:26,147 INFO L273 TraceCheckUtils]: 68: Hoare triple {19483#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {19483#(<= main_~i~0 6)} is VALID [2018-11-23 12:12:26,148 INFO L273 TraceCheckUtils]: 69: Hoare triple {19483#(<= main_~i~0 6)} assume !(0 != #t~nondet2);havoc #t~nondet2; {19483#(<= main_~i~0 6)} is VALID [2018-11-23 12:12:26,148 INFO L273 TraceCheckUtils]: 70: Hoare triple {19483#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19493#(<= main_~i~0 7)} is VALID [2018-11-23 12:12:26,149 INFO L273 TraceCheckUtils]: 71: Hoare triple {19493#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {19493#(<= main_~i~0 7)} is VALID [2018-11-23 12:12:26,149 INFO L273 TraceCheckUtils]: 72: Hoare triple {19493#(<= main_~i~0 7)} assume !(0 != #t~nondet2);havoc #t~nondet2; {19493#(<= main_~i~0 7)} is VALID [2018-11-23 12:12:26,150 INFO L273 TraceCheckUtils]: 73: Hoare triple {19493#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19503#(<= main_~i~0 8)} is VALID [2018-11-23 12:12:26,151 INFO L273 TraceCheckUtils]: 74: Hoare triple {19503#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {19503#(<= main_~i~0 8)} is VALID [2018-11-23 12:12:26,151 INFO L273 TraceCheckUtils]: 75: Hoare triple {19503#(<= main_~i~0 8)} assume !(0 != #t~nondet2);havoc #t~nondet2; {19503#(<= main_~i~0 8)} is VALID [2018-11-23 12:12:26,152 INFO L273 TraceCheckUtils]: 76: Hoare triple {19503#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19513#(<= main_~i~0 9)} is VALID [2018-11-23 12:12:26,152 INFO L273 TraceCheckUtils]: 77: Hoare triple {19513#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {19513#(<= main_~i~0 9)} is VALID [2018-11-23 12:12:26,153 INFO L273 TraceCheckUtils]: 78: Hoare triple {19513#(<= main_~i~0 9)} assume !(0 != #t~nondet2);havoc #t~nondet2; {19513#(<= main_~i~0 9)} is VALID [2018-11-23 12:12:26,154 INFO L273 TraceCheckUtils]: 79: Hoare triple {19513#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19523#(<= main_~i~0 10)} is VALID [2018-11-23 12:12:26,154 INFO L273 TraceCheckUtils]: 80: Hoare triple {19523#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {19523#(<= main_~i~0 10)} is VALID [2018-11-23 12:12:26,155 INFO L273 TraceCheckUtils]: 81: Hoare triple {19523#(<= main_~i~0 10)} assume !(0 != #t~nondet2);havoc #t~nondet2; {19523#(<= main_~i~0 10)} is VALID [2018-11-23 12:12:26,174 INFO L273 TraceCheckUtils]: 82: Hoare triple {19523#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19533#(<= main_~i~0 11)} is VALID [2018-11-23 12:12:26,177 INFO L273 TraceCheckUtils]: 83: Hoare triple {19533#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {19533#(<= main_~i~0 11)} is VALID [2018-11-23 12:12:26,177 INFO L273 TraceCheckUtils]: 84: Hoare triple {19533#(<= main_~i~0 11)} assume !(0 != #t~nondet2);havoc #t~nondet2; {19533#(<= main_~i~0 11)} is VALID [2018-11-23 12:12:26,178 INFO L273 TraceCheckUtils]: 85: Hoare triple {19533#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19543#(<= main_~i~0 12)} is VALID [2018-11-23 12:12:26,178 INFO L273 TraceCheckUtils]: 86: Hoare triple {19543#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {19543#(<= main_~i~0 12)} is VALID [2018-11-23 12:12:26,178 INFO L273 TraceCheckUtils]: 87: Hoare triple {19543#(<= main_~i~0 12)} assume !(0 != #t~nondet2);havoc #t~nondet2; {19543#(<= main_~i~0 12)} is VALID [2018-11-23 12:12:26,179 INFO L273 TraceCheckUtils]: 88: Hoare triple {19543#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19553#(<= main_~i~0 13)} is VALID [2018-11-23 12:12:26,179 INFO L273 TraceCheckUtils]: 89: Hoare triple {19553#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {19553#(<= main_~i~0 13)} is VALID [2018-11-23 12:12:26,179 INFO L273 TraceCheckUtils]: 90: Hoare triple {19553#(<= main_~i~0 13)} assume !(0 != #t~nondet2);havoc #t~nondet2; {19553#(<= main_~i~0 13)} is VALID [2018-11-23 12:12:26,180 INFO L273 TraceCheckUtils]: 91: Hoare triple {19553#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19563#(<= main_~i~0 14)} is VALID [2018-11-23 12:12:26,180 INFO L273 TraceCheckUtils]: 92: Hoare triple {19563#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {19563#(<= main_~i~0 14)} is VALID [2018-11-23 12:12:26,181 INFO L273 TraceCheckUtils]: 93: Hoare triple {19563#(<= main_~i~0 14)} assume !(0 != #t~nondet2);havoc #t~nondet2; {19563#(<= main_~i~0 14)} is VALID [2018-11-23 12:12:26,182 INFO L273 TraceCheckUtils]: 94: Hoare triple {19563#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19573#(<= main_~i~0 15)} is VALID [2018-11-23 12:12:26,182 INFO L273 TraceCheckUtils]: 95: Hoare triple {19573#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {19573#(<= main_~i~0 15)} is VALID [2018-11-23 12:12:26,183 INFO L273 TraceCheckUtils]: 96: Hoare triple {19573#(<= main_~i~0 15)} assume !(0 != #t~nondet2);havoc #t~nondet2; {19573#(<= main_~i~0 15)} is VALID [2018-11-23 12:12:26,183 INFO L273 TraceCheckUtils]: 97: Hoare triple {19573#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19583#(<= main_~i~0 16)} is VALID [2018-11-23 12:12:26,184 INFO L273 TraceCheckUtils]: 98: Hoare triple {19583#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {19583#(<= main_~i~0 16)} is VALID [2018-11-23 12:12:26,184 INFO L273 TraceCheckUtils]: 99: Hoare triple {19583#(<= main_~i~0 16)} assume !(0 != #t~nondet2);havoc #t~nondet2; {19583#(<= main_~i~0 16)} is VALID [2018-11-23 12:12:26,185 INFO L273 TraceCheckUtils]: 100: Hoare triple {19583#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19593#(<= main_~i~0 17)} is VALID [2018-11-23 12:12:26,186 INFO L273 TraceCheckUtils]: 101: Hoare triple {19593#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {19593#(<= main_~i~0 17)} is VALID [2018-11-23 12:12:26,186 INFO L273 TraceCheckUtils]: 102: Hoare triple {19593#(<= main_~i~0 17)} assume !(0 != #t~nondet2);havoc #t~nondet2; {19593#(<= main_~i~0 17)} is VALID [2018-11-23 12:12:26,187 INFO L273 TraceCheckUtils]: 103: Hoare triple {19593#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19603#(<= main_~i~0 18)} is VALID [2018-11-23 12:12:26,187 INFO L273 TraceCheckUtils]: 104: Hoare triple {19603#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {19603#(<= main_~i~0 18)} is VALID [2018-11-23 12:12:26,188 INFO L273 TraceCheckUtils]: 105: Hoare triple {19603#(<= main_~i~0 18)} assume !(0 != #t~nondet2);havoc #t~nondet2; {19603#(<= main_~i~0 18)} is VALID [2018-11-23 12:12:26,189 INFO L273 TraceCheckUtils]: 106: Hoare triple {19603#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19613#(<= main_~i~0 19)} is VALID [2018-11-23 12:12:26,189 INFO L273 TraceCheckUtils]: 107: Hoare triple {19613#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {19613#(<= main_~i~0 19)} is VALID [2018-11-23 12:12:26,190 INFO L273 TraceCheckUtils]: 108: Hoare triple {19613#(<= main_~i~0 19)} assume !(0 != #t~nondet2);havoc #t~nondet2; {19613#(<= main_~i~0 19)} is VALID [2018-11-23 12:12:26,191 INFO L273 TraceCheckUtils]: 109: Hoare triple {19613#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19623#(<= main_~i~0 20)} is VALID [2018-11-23 12:12:26,191 INFO L273 TraceCheckUtils]: 110: Hoare triple {19623#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {19623#(<= main_~i~0 20)} is VALID [2018-11-23 12:12:26,192 INFO L273 TraceCheckUtils]: 111: Hoare triple {19623#(<= main_~i~0 20)} assume !(0 != #t~nondet2);havoc #t~nondet2; {19623#(<= main_~i~0 20)} is VALID [2018-11-23 12:12:26,192 INFO L273 TraceCheckUtils]: 112: Hoare triple {19623#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19633#(<= main_~i~0 21)} is VALID [2018-11-23 12:12:26,193 INFO L273 TraceCheckUtils]: 113: Hoare triple {19633#(<= main_~i~0 21)} assume !(~i~0 < 100000); {19272#false} is VALID [2018-11-23 12:12:26,194 INFO L273 TraceCheckUtils]: 114: Hoare triple {19272#false} ~i~0 := 0; {19272#false} is VALID [2018-11-23 12:12:26,194 INFO L273 TraceCheckUtils]: 115: Hoare triple {19272#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem5 == #t~mem6; {19272#false} is VALID [2018-11-23 12:12:26,194 INFO L273 TraceCheckUtils]: 116: Hoare triple {19272#false} assume !#t~short10;call #t~mem9 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 == #t~mem7 * #t~mem8; {19272#false} is VALID [2018-11-23 12:12:26,194 INFO L256 TraceCheckUtils]: 117: Hoare triple {19272#false} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {19272#false} is VALID [2018-11-23 12:12:26,194 INFO L273 TraceCheckUtils]: 118: Hoare triple {19272#false} ~cond := #in~cond; {19272#false} is VALID [2018-11-23 12:12:26,195 INFO L273 TraceCheckUtils]: 119: Hoare triple {19272#false} assume 0 == ~cond; {19272#false} is VALID [2018-11-23 12:12:26,195 INFO L273 TraceCheckUtils]: 120: Hoare triple {19272#false} assume !false; {19272#false} is VALID [2018-11-23 12:12:26,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2018-11-23 12:12:26,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:12:26,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-11-23 12:12:26,226 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 121 [2018-11-23 12:12:26,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:12:26,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:12:26,299 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:12:26,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:12:26,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:12:26,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:12:26,300 INFO L87 Difference]: Start difference. First operand 131 states and 155 transitions. Second operand 24 states. [2018-11-23 12:12:28,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:28,555 INFO L93 Difference]: Finished difference Result 353 states and 470 transitions. [2018-11-23 12:12:28,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 12:12:28,555 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 121 [2018-11-23 12:12:28,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:12:28,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:12:28,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 335 transitions. [2018-11-23 12:12:28,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:12:28,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 335 transitions. [2018-11-23 12:12:28,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 335 transitions. [2018-11-23 12:12:28,899 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 335 edges. 335 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:12:28,905 INFO L225 Difference]: With dead ends: 353 [2018-11-23 12:12:28,905 INFO L226 Difference]: Without dead ends: 271 [2018-11-23 12:12:28,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:12:28,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-11-23 12:12:29,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 136. [2018-11-23 12:12:29,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:12:29,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 271 states. Second operand 136 states. [2018-11-23 12:12:29,008 INFO L74 IsIncluded]: Start isIncluded. First operand 271 states. Second operand 136 states. [2018-11-23 12:12:29,008 INFO L87 Difference]: Start difference. First operand 271 states. Second operand 136 states. [2018-11-23 12:12:29,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:29,014 INFO L93 Difference]: Finished difference Result 271 states and 363 transitions. [2018-11-23 12:12:29,014 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 363 transitions. [2018-11-23 12:12:29,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:12:29,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:12:29,015 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 271 states. [2018-11-23 12:12:29,015 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 271 states. [2018-11-23 12:12:29,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:29,021 INFO L93 Difference]: Finished difference Result 271 states and 363 transitions. [2018-11-23 12:12:29,021 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 363 transitions. [2018-11-23 12:12:29,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:12:29,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:12:29,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:12:29,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:12:29,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-23 12:12:29,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 161 transitions. [2018-11-23 12:12:29,023 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 161 transitions. Word has length 121 [2018-11-23 12:12:29,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:12:29,024 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 161 transitions. [2018-11-23 12:12:29,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:12:29,024 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 161 transitions. [2018-11-23 12:12:29,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-23 12:12:29,024 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:12:29,024 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:12:29,025 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:12:29,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:12:29,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1351964044, now seen corresponding path program 22 times [2018-11-23 12:12:29,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:12:29,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:12:29,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:29,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:12:29,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:29,041 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:12:29,042 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:12:29,042 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:12:29,063 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:12:29,111 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:12:29,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:12:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:12:29,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:12:29,652 INFO L256 TraceCheckUtils]: 0: Hoare triple {20891#true} call ULTIMATE.init(); {20891#true} is VALID [2018-11-23 12:12:29,652 INFO L273 TraceCheckUtils]: 1: Hoare triple {20891#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20891#true} is VALID [2018-11-23 12:12:29,653 INFO L273 TraceCheckUtils]: 2: Hoare triple {20891#true} assume true; {20891#true} is VALID [2018-11-23 12:12:29,653 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20891#true} {20891#true} #74#return; {20891#true} is VALID [2018-11-23 12:12:29,653 INFO L256 TraceCheckUtils]: 4: Hoare triple {20891#true} call #t~ret11 := main(); {20891#true} is VALID [2018-11-23 12:12:29,654 INFO L273 TraceCheckUtils]: 5: Hoare triple {20891#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);havoc ~k~0;havoc ~i~0;~i~0 := 0; {20911#(<= main_~i~0 0)} is VALID [2018-11-23 12:12:29,654 INFO L273 TraceCheckUtils]: 6: Hoare triple {20911#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {20911#(<= main_~i~0 0)} is VALID [2018-11-23 12:12:29,655 INFO L273 TraceCheckUtils]: 7: Hoare triple {20911#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20918#(<= main_~i~0 1)} is VALID [2018-11-23 12:12:29,655 INFO L273 TraceCheckUtils]: 8: Hoare triple {20918#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {20918#(<= main_~i~0 1)} is VALID [2018-11-23 12:12:29,656 INFO L273 TraceCheckUtils]: 9: Hoare triple {20918#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20925#(<= main_~i~0 2)} is VALID [2018-11-23 12:12:29,656 INFO L273 TraceCheckUtils]: 10: Hoare triple {20925#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {20925#(<= main_~i~0 2)} is VALID [2018-11-23 12:12:29,656 INFO L273 TraceCheckUtils]: 11: Hoare triple {20925#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20932#(<= main_~i~0 3)} is VALID [2018-11-23 12:12:29,657 INFO L273 TraceCheckUtils]: 12: Hoare triple {20932#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {20932#(<= main_~i~0 3)} is VALID [2018-11-23 12:12:29,658 INFO L273 TraceCheckUtils]: 13: Hoare triple {20932#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20939#(<= main_~i~0 4)} is VALID [2018-11-23 12:12:29,658 INFO L273 TraceCheckUtils]: 14: Hoare triple {20939#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {20939#(<= main_~i~0 4)} is VALID [2018-11-23 12:12:29,659 INFO L273 TraceCheckUtils]: 15: Hoare triple {20939#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20946#(<= main_~i~0 5)} is VALID [2018-11-23 12:12:29,660 INFO L273 TraceCheckUtils]: 16: Hoare triple {20946#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {20946#(<= main_~i~0 5)} is VALID [2018-11-23 12:12:29,660 INFO L273 TraceCheckUtils]: 17: Hoare triple {20946#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20953#(<= main_~i~0 6)} is VALID [2018-11-23 12:12:29,661 INFO L273 TraceCheckUtils]: 18: Hoare triple {20953#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {20953#(<= main_~i~0 6)} is VALID [2018-11-23 12:12:29,662 INFO L273 TraceCheckUtils]: 19: Hoare triple {20953#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20960#(<= main_~i~0 7)} is VALID [2018-11-23 12:12:29,662 INFO L273 TraceCheckUtils]: 20: Hoare triple {20960#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {20960#(<= main_~i~0 7)} is VALID [2018-11-23 12:12:29,663 INFO L273 TraceCheckUtils]: 21: Hoare triple {20960#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20967#(<= main_~i~0 8)} is VALID [2018-11-23 12:12:29,663 INFO L273 TraceCheckUtils]: 22: Hoare triple {20967#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {20967#(<= main_~i~0 8)} is VALID [2018-11-23 12:12:29,664 INFO L273 TraceCheckUtils]: 23: Hoare triple {20967#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20974#(<= main_~i~0 9)} is VALID [2018-11-23 12:12:29,665 INFO L273 TraceCheckUtils]: 24: Hoare triple {20974#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {20974#(<= main_~i~0 9)} is VALID [2018-11-23 12:12:29,666 INFO L273 TraceCheckUtils]: 25: Hoare triple {20974#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20981#(<= main_~i~0 10)} is VALID [2018-11-23 12:12:29,666 INFO L273 TraceCheckUtils]: 26: Hoare triple {20981#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {20981#(<= main_~i~0 10)} is VALID [2018-11-23 12:12:29,667 INFO L273 TraceCheckUtils]: 27: Hoare triple {20981#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20988#(<= main_~i~0 11)} is VALID [2018-11-23 12:12:29,668 INFO L273 TraceCheckUtils]: 28: Hoare triple {20988#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {20988#(<= main_~i~0 11)} is VALID [2018-11-23 12:12:29,669 INFO L273 TraceCheckUtils]: 29: Hoare triple {20988#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20995#(<= main_~i~0 12)} is VALID [2018-11-23 12:12:29,669 INFO L273 TraceCheckUtils]: 30: Hoare triple {20995#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {20995#(<= main_~i~0 12)} is VALID [2018-11-23 12:12:29,670 INFO L273 TraceCheckUtils]: 31: Hoare triple {20995#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21002#(<= main_~i~0 13)} is VALID [2018-11-23 12:12:29,670 INFO L273 TraceCheckUtils]: 32: Hoare triple {21002#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21002#(<= main_~i~0 13)} is VALID [2018-11-23 12:12:29,671 INFO L273 TraceCheckUtils]: 33: Hoare triple {21002#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21009#(<= main_~i~0 14)} is VALID [2018-11-23 12:12:29,672 INFO L273 TraceCheckUtils]: 34: Hoare triple {21009#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21009#(<= main_~i~0 14)} is VALID [2018-11-23 12:12:29,672 INFO L273 TraceCheckUtils]: 35: Hoare triple {21009#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21016#(<= main_~i~0 15)} is VALID [2018-11-23 12:12:29,673 INFO L273 TraceCheckUtils]: 36: Hoare triple {21016#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21016#(<= main_~i~0 15)} is VALID [2018-11-23 12:12:29,674 INFO L273 TraceCheckUtils]: 37: Hoare triple {21016#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21023#(<= main_~i~0 16)} is VALID [2018-11-23 12:12:29,674 INFO L273 TraceCheckUtils]: 38: Hoare triple {21023#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21023#(<= main_~i~0 16)} is VALID [2018-11-23 12:12:29,675 INFO L273 TraceCheckUtils]: 39: Hoare triple {21023#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21030#(<= main_~i~0 17)} is VALID [2018-11-23 12:12:29,675 INFO L273 TraceCheckUtils]: 40: Hoare triple {21030#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21030#(<= main_~i~0 17)} is VALID [2018-11-23 12:12:29,676 INFO L273 TraceCheckUtils]: 41: Hoare triple {21030#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21037#(<= main_~i~0 18)} is VALID [2018-11-23 12:12:29,677 INFO L273 TraceCheckUtils]: 42: Hoare triple {21037#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21037#(<= main_~i~0 18)} is VALID [2018-11-23 12:12:29,677 INFO L273 TraceCheckUtils]: 43: Hoare triple {21037#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21044#(<= main_~i~0 19)} is VALID [2018-11-23 12:12:29,678 INFO L273 TraceCheckUtils]: 44: Hoare triple {21044#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21044#(<= main_~i~0 19)} is VALID [2018-11-23 12:12:29,679 INFO L273 TraceCheckUtils]: 45: Hoare triple {21044#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21051#(<= main_~i~0 20)} is VALID [2018-11-23 12:12:29,679 INFO L273 TraceCheckUtils]: 46: Hoare triple {21051#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21051#(<= main_~i~0 20)} is VALID [2018-11-23 12:12:29,680 INFO L273 TraceCheckUtils]: 47: Hoare triple {21051#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21058#(<= main_~i~0 21)} is VALID [2018-11-23 12:12:29,681 INFO L273 TraceCheckUtils]: 48: Hoare triple {21058#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {21058#(<= main_~i~0 21)} is VALID [2018-11-23 12:12:29,682 INFO L273 TraceCheckUtils]: 49: Hoare triple {21058#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21065#(<= main_~i~0 22)} is VALID [2018-11-23 12:12:29,683 INFO L273 TraceCheckUtils]: 50: Hoare triple {21065#(<= main_~i~0 22)} assume !(~i~0 < 100000); {20892#false} is VALID [2018-11-23 12:12:29,683 INFO L273 TraceCheckUtils]: 51: Hoare triple {20892#false} ~i~0 := 0; {20892#false} is VALID [2018-11-23 12:12:29,683 INFO L273 TraceCheckUtils]: 52: Hoare triple {20892#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {20892#false} is VALID [2018-11-23 12:12:29,684 INFO L273 TraceCheckUtils]: 53: Hoare triple {20892#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {20892#false} is VALID [2018-11-23 12:12:29,684 INFO L273 TraceCheckUtils]: 54: Hoare triple {20892#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20892#false} is VALID [2018-11-23 12:12:29,684 INFO L273 TraceCheckUtils]: 55: Hoare triple {20892#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {20892#false} is VALID [2018-11-23 12:12:29,684 INFO L273 TraceCheckUtils]: 56: Hoare triple {20892#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {20892#false} is VALID [2018-11-23 12:12:29,684 INFO L273 TraceCheckUtils]: 57: Hoare triple {20892#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20892#false} is VALID [2018-11-23 12:12:29,685 INFO L273 TraceCheckUtils]: 58: Hoare triple {20892#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {20892#false} is VALID [2018-11-23 12:12:29,685 INFO L273 TraceCheckUtils]: 59: Hoare triple {20892#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {20892#false} is VALID [2018-11-23 12:12:29,685 INFO L273 TraceCheckUtils]: 60: Hoare triple {20892#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20892#false} is VALID [2018-11-23 12:12:29,685 INFO L273 TraceCheckUtils]: 61: Hoare triple {20892#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {20892#false} is VALID [2018-11-23 12:12:29,685 INFO L273 TraceCheckUtils]: 62: Hoare triple {20892#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {20892#false} is VALID [2018-11-23 12:12:29,686 INFO L273 TraceCheckUtils]: 63: Hoare triple {20892#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20892#false} is VALID [2018-11-23 12:12:29,686 INFO L273 TraceCheckUtils]: 64: Hoare triple {20892#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {20892#false} is VALID [2018-11-23 12:12:29,686 INFO L273 TraceCheckUtils]: 65: Hoare triple {20892#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {20892#false} is VALID [2018-11-23 12:12:29,686 INFO L273 TraceCheckUtils]: 66: Hoare triple {20892#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20892#false} is VALID [2018-11-23 12:12:29,686 INFO L273 TraceCheckUtils]: 67: Hoare triple {20892#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {20892#false} is VALID [2018-11-23 12:12:29,687 INFO L273 TraceCheckUtils]: 68: Hoare triple {20892#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {20892#false} is VALID [2018-11-23 12:12:29,687 INFO L273 TraceCheckUtils]: 69: Hoare triple {20892#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20892#false} is VALID [2018-11-23 12:12:29,687 INFO L273 TraceCheckUtils]: 70: Hoare triple {20892#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {20892#false} is VALID [2018-11-23 12:12:29,687 INFO L273 TraceCheckUtils]: 71: Hoare triple {20892#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {20892#false} is VALID [2018-11-23 12:12:29,687 INFO L273 TraceCheckUtils]: 72: Hoare triple {20892#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20892#false} is VALID [2018-11-23 12:12:29,687 INFO L273 TraceCheckUtils]: 73: Hoare triple {20892#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {20892#false} is VALID [2018-11-23 12:12:29,687 INFO L273 TraceCheckUtils]: 74: Hoare triple {20892#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {20892#false} is VALID [2018-11-23 12:12:29,687 INFO L273 TraceCheckUtils]: 75: Hoare triple {20892#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20892#false} is VALID [2018-11-23 12:12:29,687 INFO L273 TraceCheckUtils]: 76: Hoare triple {20892#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {20892#false} is VALID [2018-11-23 12:12:29,688 INFO L273 TraceCheckUtils]: 77: Hoare triple {20892#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {20892#false} is VALID [2018-11-23 12:12:29,688 INFO L273 TraceCheckUtils]: 78: Hoare triple {20892#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20892#false} is VALID [2018-11-23 12:12:29,688 INFO L273 TraceCheckUtils]: 79: Hoare triple {20892#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {20892#false} is VALID [2018-11-23 12:12:29,688 INFO L273 TraceCheckUtils]: 80: Hoare triple {20892#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {20892#false} is VALID [2018-11-23 12:12:29,688 INFO L273 TraceCheckUtils]: 81: Hoare triple {20892#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20892#false} is VALID [2018-11-23 12:12:29,688 INFO L273 TraceCheckUtils]: 82: Hoare triple {20892#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {20892#false} is VALID [2018-11-23 12:12:29,688 INFO L273 TraceCheckUtils]: 83: Hoare triple {20892#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {20892#false} is VALID [2018-11-23 12:12:29,688 INFO L273 TraceCheckUtils]: 84: Hoare triple {20892#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20892#false} is VALID [2018-11-23 12:12:29,688 INFO L273 TraceCheckUtils]: 85: Hoare triple {20892#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {20892#false} is VALID [2018-11-23 12:12:29,689 INFO L273 TraceCheckUtils]: 86: Hoare triple {20892#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {20892#false} is VALID [2018-11-23 12:12:29,689 INFO L273 TraceCheckUtils]: 87: Hoare triple {20892#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20892#false} is VALID [2018-11-23 12:12:29,689 INFO L273 TraceCheckUtils]: 88: Hoare triple {20892#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {20892#false} is VALID [2018-11-23 12:12:29,689 INFO L273 TraceCheckUtils]: 89: Hoare triple {20892#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {20892#false} is VALID [2018-11-23 12:12:29,689 INFO L273 TraceCheckUtils]: 90: Hoare triple {20892#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20892#false} is VALID [2018-11-23 12:12:29,689 INFO L273 TraceCheckUtils]: 91: Hoare triple {20892#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {20892#false} is VALID [2018-11-23 12:12:29,689 INFO L273 TraceCheckUtils]: 92: Hoare triple {20892#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {20892#false} is VALID [2018-11-23 12:12:29,689 INFO L273 TraceCheckUtils]: 93: Hoare triple {20892#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20892#false} is VALID [2018-11-23 12:12:29,690 INFO L273 TraceCheckUtils]: 94: Hoare triple {20892#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {20892#false} is VALID [2018-11-23 12:12:29,690 INFO L273 TraceCheckUtils]: 95: Hoare triple {20892#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {20892#false} is VALID [2018-11-23 12:12:29,690 INFO L273 TraceCheckUtils]: 96: Hoare triple {20892#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20892#false} is VALID [2018-11-23 12:12:29,690 INFO L273 TraceCheckUtils]: 97: Hoare triple {20892#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {20892#false} is VALID [2018-11-23 12:12:29,690 INFO L273 TraceCheckUtils]: 98: Hoare triple {20892#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {20892#false} is VALID [2018-11-23 12:12:29,690 INFO L273 TraceCheckUtils]: 99: Hoare triple {20892#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20892#false} is VALID [2018-11-23 12:12:29,690 INFO L273 TraceCheckUtils]: 100: Hoare triple {20892#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {20892#false} is VALID [2018-11-23 12:12:29,690 INFO L273 TraceCheckUtils]: 101: Hoare triple {20892#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {20892#false} is VALID [2018-11-23 12:12:29,690 INFO L273 TraceCheckUtils]: 102: Hoare triple {20892#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20892#false} is VALID [2018-11-23 12:12:29,691 INFO L273 TraceCheckUtils]: 103: Hoare triple {20892#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {20892#false} is VALID [2018-11-23 12:12:29,691 INFO L273 TraceCheckUtils]: 104: Hoare triple {20892#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {20892#false} is VALID [2018-11-23 12:12:29,691 INFO L273 TraceCheckUtils]: 105: Hoare triple {20892#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20892#false} is VALID [2018-11-23 12:12:29,691 INFO L273 TraceCheckUtils]: 106: Hoare triple {20892#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {20892#false} is VALID [2018-11-23 12:12:29,691 INFO L273 TraceCheckUtils]: 107: Hoare triple {20892#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {20892#false} is VALID [2018-11-23 12:12:29,691 INFO L273 TraceCheckUtils]: 108: Hoare triple {20892#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20892#false} is VALID [2018-11-23 12:12:29,691 INFO L273 TraceCheckUtils]: 109: Hoare triple {20892#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {20892#false} is VALID [2018-11-23 12:12:29,692 INFO L273 TraceCheckUtils]: 110: Hoare triple {20892#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {20892#false} is VALID [2018-11-23 12:12:29,692 INFO L273 TraceCheckUtils]: 111: Hoare triple {20892#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20892#false} is VALID [2018-11-23 12:12:29,692 INFO L273 TraceCheckUtils]: 112: Hoare triple {20892#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {20892#false} is VALID [2018-11-23 12:12:29,692 INFO L273 TraceCheckUtils]: 113: Hoare triple {20892#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {20892#false} is VALID [2018-11-23 12:12:29,692 INFO L273 TraceCheckUtils]: 114: Hoare triple {20892#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20892#false} is VALID [2018-11-23 12:12:29,692 INFO L273 TraceCheckUtils]: 115: Hoare triple {20892#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {20892#false} is VALID [2018-11-23 12:12:29,693 INFO L273 TraceCheckUtils]: 116: Hoare triple {20892#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {20892#false} is VALID [2018-11-23 12:12:29,693 INFO L273 TraceCheckUtils]: 117: Hoare triple {20892#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20892#false} is VALID [2018-11-23 12:12:29,693 INFO L273 TraceCheckUtils]: 118: Hoare triple {20892#false} assume !(~i~0 < 100000); {20892#false} is VALID [2018-11-23 12:12:29,693 INFO L273 TraceCheckUtils]: 119: Hoare triple {20892#false} ~i~0 := 0; {20892#false} is VALID [2018-11-23 12:12:29,693 INFO L273 TraceCheckUtils]: 120: Hoare triple {20892#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem5 == #t~mem6; {20892#false} is VALID [2018-11-23 12:12:29,693 INFO L273 TraceCheckUtils]: 121: Hoare triple {20892#false} assume !#t~short10;call #t~mem9 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 == #t~mem7 * #t~mem8; {20892#false} is VALID [2018-11-23 12:12:29,694 INFO L256 TraceCheckUtils]: 122: Hoare triple {20892#false} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {20892#false} is VALID [2018-11-23 12:12:29,694 INFO L273 TraceCheckUtils]: 123: Hoare triple {20892#false} ~cond := #in~cond; {20892#false} is VALID [2018-11-23 12:12:29,694 INFO L273 TraceCheckUtils]: 124: Hoare triple {20892#false} assume 0 == ~cond; {20892#false} is VALID [2018-11-23 12:12:29,694 INFO L273 TraceCheckUtils]: 125: Hoare triple {20892#false} assume !false; {20892#false} is VALID [2018-11-23 12:12:29,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2018-11-23 12:12:29,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:12:29,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-11-23 12:12:29,724 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 126 [2018-11-23 12:12:29,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:12:29,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 12:12:29,787 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:12:29,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 12:12:29,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 12:12:29,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:12:29,788 INFO L87 Difference]: Start difference. First operand 136 states and 161 transitions. Second operand 25 states. [2018-11-23 12:12:32,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:32,497 INFO L93 Difference]: Finished difference Result 367 states and 489 transitions. [2018-11-23 12:12:32,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 12:12:32,497 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 126 [2018-11-23 12:12:32,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:12:32,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:12:32,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 348 transitions. [2018-11-23 12:12:32,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:12:32,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 348 transitions. [2018-11-23 12:12:32,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 348 transitions. [2018-11-23 12:12:32,849 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 348 edges. 348 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:12:32,856 INFO L225 Difference]: With dead ends: 367 [2018-11-23 12:12:32,856 INFO L226 Difference]: Without dead ends: 282 [2018-11-23 12:12:32,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:12:32,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-11-23 12:12:32,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 141. [2018-11-23 12:12:32,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:12:32,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 282 states. Second operand 141 states. [2018-11-23 12:12:32,977 INFO L74 IsIncluded]: Start isIncluded. First operand 282 states. Second operand 141 states. [2018-11-23 12:12:32,977 INFO L87 Difference]: Start difference. First operand 282 states. Second operand 141 states. [2018-11-23 12:12:32,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:32,984 INFO L93 Difference]: Finished difference Result 282 states and 378 transitions. [2018-11-23 12:12:32,984 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 378 transitions. [2018-11-23 12:12:32,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:12:32,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:12:32,985 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 282 states. [2018-11-23 12:12:32,985 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 282 states. [2018-11-23 12:12:32,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:32,992 INFO L93 Difference]: Finished difference Result 282 states and 378 transitions. [2018-11-23 12:12:32,992 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 378 transitions. [2018-11-23 12:12:32,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:12:32,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:12:32,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:12:32,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:12:32,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-23 12:12:32,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 167 transitions. [2018-11-23 12:12:32,996 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 167 transitions. Word has length 126 [2018-11-23 12:12:32,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:12:32,996 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 167 transitions. [2018-11-23 12:12:32,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 12:12:32,996 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 167 transitions. [2018-11-23 12:12:32,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-23 12:12:32,997 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:12:32,997 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:12:32,997 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:12:32,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:12:32,998 INFO L82 PathProgramCache]: Analyzing trace with hash -678571087, now seen corresponding path program 23 times [2018-11-23 12:12:32,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:12:32,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:12:32,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:32,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:12:32,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:33,017 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:12:33,017 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:12:33,018 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:12:33,030 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:14:14,888 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-23 12:14:14,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:14:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:14,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:14:15,461 INFO L256 TraceCheckUtils]: 0: Hoare triple {22576#true} call ULTIMATE.init(); {22576#true} is VALID [2018-11-23 12:14:15,462 INFO L273 TraceCheckUtils]: 1: Hoare triple {22576#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22576#true} is VALID [2018-11-23 12:14:15,462 INFO L273 TraceCheckUtils]: 2: Hoare triple {22576#true} assume true; {22576#true} is VALID [2018-11-23 12:14:15,462 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22576#true} {22576#true} #74#return; {22576#true} is VALID [2018-11-23 12:14:15,462 INFO L256 TraceCheckUtils]: 4: Hoare triple {22576#true} call #t~ret11 := main(); {22576#true} is VALID [2018-11-23 12:14:15,463 INFO L273 TraceCheckUtils]: 5: Hoare triple {22576#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);havoc ~k~0;havoc ~i~0;~i~0 := 0; {22596#(<= main_~i~0 0)} is VALID [2018-11-23 12:14:15,464 INFO L273 TraceCheckUtils]: 6: Hoare triple {22596#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22596#(<= main_~i~0 0)} is VALID [2018-11-23 12:14:15,464 INFO L273 TraceCheckUtils]: 7: Hoare triple {22596#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22603#(<= main_~i~0 1)} is VALID [2018-11-23 12:14:15,465 INFO L273 TraceCheckUtils]: 8: Hoare triple {22603#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22603#(<= main_~i~0 1)} is VALID [2018-11-23 12:14:15,465 INFO L273 TraceCheckUtils]: 9: Hoare triple {22603#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22610#(<= main_~i~0 2)} is VALID [2018-11-23 12:14:15,466 INFO L273 TraceCheckUtils]: 10: Hoare triple {22610#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22610#(<= main_~i~0 2)} is VALID [2018-11-23 12:14:15,466 INFO L273 TraceCheckUtils]: 11: Hoare triple {22610#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22617#(<= main_~i~0 3)} is VALID [2018-11-23 12:14:15,466 INFO L273 TraceCheckUtils]: 12: Hoare triple {22617#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22617#(<= main_~i~0 3)} is VALID [2018-11-23 12:14:15,467 INFO L273 TraceCheckUtils]: 13: Hoare triple {22617#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22624#(<= main_~i~0 4)} is VALID [2018-11-23 12:14:15,467 INFO L273 TraceCheckUtils]: 14: Hoare triple {22624#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22624#(<= main_~i~0 4)} is VALID [2018-11-23 12:14:15,468 INFO L273 TraceCheckUtils]: 15: Hoare triple {22624#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22631#(<= main_~i~0 5)} is VALID [2018-11-23 12:14:15,469 INFO L273 TraceCheckUtils]: 16: Hoare triple {22631#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22631#(<= main_~i~0 5)} is VALID [2018-11-23 12:14:15,470 INFO L273 TraceCheckUtils]: 17: Hoare triple {22631#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22638#(<= main_~i~0 6)} is VALID [2018-11-23 12:14:15,470 INFO L273 TraceCheckUtils]: 18: Hoare triple {22638#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22638#(<= main_~i~0 6)} is VALID [2018-11-23 12:14:15,471 INFO L273 TraceCheckUtils]: 19: Hoare triple {22638#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22645#(<= main_~i~0 7)} is VALID [2018-11-23 12:14:15,471 INFO L273 TraceCheckUtils]: 20: Hoare triple {22645#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22645#(<= main_~i~0 7)} is VALID [2018-11-23 12:14:15,472 INFO L273 TraceCheckUtils]: 21: Hoare triple {22645#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22652#(<= main_~i~0 8)} is VALID [2018-11-23 12:14:15,473 INFO L273 TraceCheckUtils]: 22: Hoare triple {22652#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22652#(<= main_~i~0 8)} is VALID [2018-11-23 12:14:15,474 INFO L273 TraceCheckUtils]: 23: Hoare triple {22652#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22659#(<= main_~i~0 9)} is VALID [2018-11-23 12:14:15,474 INFO L273 TraceCheckUtils]: 24: Hoare triple {22659#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22659#(<= main_~i~0 9)} is VALID [2018-11-23 12:14:15,475 INFO L273 TraceCheckUtils]: 25: Hoare triple {22659#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22666#(<= main_~i~0 10)} is VALID [2018-11-23 12:14:15,475 INFO L273 TraceCheckUtils]: 26: Hoare triple {22666#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22666#(<= main_~i~0 10)} is VALID [2018-11-23 12:14:15,476 INFO L273 TraceCheckUtils]: 27: Hoare triple {22666#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22673#(<= main_~i~0 11)} is VALID [2018-11-23 12:14:15,477 INFO L273 TraceCheckUtils]: 28: Hoare triple {22673#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22673#(<= main_~i~0 11)} is VALID [2018-11-23 12:14:15,477 INFO L273 TraceCheckUtils]: 29: Hoare triple {22673#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22680#(<= main_~i~0 12)} is VALID [2018-11-23 12:14:15,478 INFO L273 TraceCheckUtils]: 30: Hoare triple {22680#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22680#(<= main_~i~0 12)} is VALID [2018-11-23 12:14:15,479 INFO L273 TraceCheckUtils]: 31: Hoare triple {22680#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22687#(<= main_~i~0 13)} is VALID [2018-11-23 12:14:15,479 INFO L273 TraceCheckUtils]: 32: Hoare triple {22687#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22687#(<= main_~i~0 13)} is VALID [2018-11-23 12:14:15,480 INFO L273 TraceCheckUtils]: 33: Hoare triple {22687#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22694#(<= main_~i~0 14)} is VALID [2018-11-23 12:14:15,481 INFO L273 TraceCheckUtils]: 34: Hoare triple {22694#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22694#(<= main_~i~0 14)} is VALID [2018-11-23 12:14:15,481 INFO L273 TraceCheckUtils]: 35: Hoare triple {22694#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22701#(<= main_~i~0 15)} is VALID [2018-11-23 12:14:15,482 INFO L273 TraceCheckUtils]: 36: Hoare triple {22701#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22701#(<= main_~i~0 15)} is VALID [2018-11-23 12:14:15,483 INFO L273 TraceCheckUtils]: 37: Hoare triple {22701#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22708#(<= main_~i~0 16)} is VALID [2018-11-23 12:14:15,483 INFO L273 TraceCheckUtils]: 38: Hoare triple {22708#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22708#(<= main_~i~0 16)} is VALID [2018-11-23 12:14:15,484 INFO L273 TraceCheckUtils]: 39: Hoare triple {22708#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22715#(<= main_~i~0 17)} is VALID [2018-11-23 12:14:15,485 INFO L273 TraceCheckUtils]: 40: Hoare triple {22715#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22715#(<= main_~i~0 17)} is VALID [2018-11-23 12:14:15,485 INFO L273 TraceCheckUtils]: 41: Hoare triple {22715#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22722#(<= main_~i~0 18)} is VALID [2018-11-23 12:14:15,486 INFO L273 TraceCheckUtils]: 42: Hoare triple {22722#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22722#(<= main_~i~0 18)} is VALID [2018-11-23 12:14:15,487 INFO L273 TraceCheckUtils]: 43: Hoare triple {22722#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22729#(<= main_~i~0 19)} is VALID [2018-11-23 12:14:15,487 INFO L273 TraceCheckUtils]: 44: Hoare triple {22729#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22729#(<= main_~i~0 19)} is VALID [2018-11-23 12:14:15,488 INFO L273 TraceCheckUtils]: 45: Hoare triple {22729#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22736#(<= main_~i~0 20)} is VALID [2018-11-23 12:14:15,489 INFO L273 TraceCheckUtils]: 46: Hoare triple {22736#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22736#(<= main_~i~0 20)} is VALID [2018-11-23 12:14:15,489 INFO L273 TraceCheckUtils]: 47: Hoare triple {22736#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22743#(<= main_~i~0 21)} is VALID [2018-11-23 12:14:15,490 INFO L273 TraceCheckUtils]: 48: Hoare triple {22743#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22743#(<= main_~i~0 21)} is VALID [2018-11-23 12:14:15,491 INFO L273 TraceCheckUtils]: 49: Hoare triple {22743#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22750#(<= main_~i~0 22)} is VALID [2018-11-23 12:14:15,491 INFO L273 TraceCheckUtils]: 50: Hoare triple {22750#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {22750#(<= main_~i~0 22)} is VALID [2018-11-23 12:14:15,492 INFO L273 TraceCheckUtils]: 51: Hoare triple {22750#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22757#(<= main_~i~0 23)} is VALID [2018-11-23 12:14:15,493 INFO L273 TraceCheckUtils]: 52: Hoare triple {22757#(<= main_~i~0 23)} assume !(~i~0 < 100000); {22577#false} is VALID [2018-11-23 12:14:15,493 INFO L273 TraceCheckUtils]: 53: Hoare triple {22577#false} ~i~0 := 0; {22577#false} is VALID [2018-11-23 12:14:15,493 INFO L273 TraceCheckUtils]: 54: Hoare triple {22577#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {22577#false} is VALID [2018-11-23 12:14:15,493 INFO L273 TraceCheckUtils]: 55: Hoare triple {22577#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {22577#false} is VALID [2018-11-23 12:14:15,494 INFO L273 TraceCheckUtils]: 56: Hoare triple {22577#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22577#false} is VALID [2018-11-23 12:14:15,494 INFO L273 TraceCheckUtils]: 57: Hoare triple {22577#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {22577#false} is VALID [2018-11-23 12:14:15,494 INFO L273 TraceCheckUtils]: 58: Hoare triple {22577#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {22577#false} is VALID [2018-11-23 12:14:15,494 INFO L273 TraceCheckUtils]: 59: Hoare triple {22577#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22577#false} is VALID [2018-11-23 12:14:15,494 INFO L273 TraceCheckUtils]: 60: Hoare triple {22577#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {22577#false} is VALID [2018-11-23 12:14:15,495 INFO L273 TraceCheckUtils]: 61: Hoare triple {22577#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {22577#false} is VALID [2018-11-23 12:14:15,495 INFO L273 TraceCheckUtils]: 62: Hoare triple {22577#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22577#false} is VALID [2018-11-23 12:14:15,495 INFO L273 TraceCheckUtils]: 63: Hoare triple {22577#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {22577#false} is VALID [2018-11-23 12:14:15,495 INFO L273 TraceCheckUtils]: 64: Hoare triple {22577#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {22577#false} is VALID [2018-11-23 12:14:15,495 INFO L273 TraceCheckUtils]: 65: Hoare triple {22577#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22577#false} is VALID [2018-11-23 12:14:15,496 INFO L273 TraceCheckUtils]: 66: Hoare triple {22577#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {22577#false} is VALID [2018-11-23 12:14:15,496 INFO L273 TraceCheckUtils]: 67: Hoare triple {22577#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {22577#false} is VALID [2018-11-23 12:14:15,496 INFO L273 TraceCheckUtils]: 68: Hoare triple {22577#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22577#false} is VALID [2018-11-23 12:14:15,496 INFO L273 TraceCheckUtils]: 69: Hoare triple {22577#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {22577#false} is VALID [2018-11-23 12:14:15,496 INFO L273 TraceCheckUtils]: 70: Hoare triple {22577#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {22577#false} is VALID [2018-11-23 12:14:15,496 INFO L273 TraceCheckUtils]: 71: Hoare triple {22577#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22577#false} is VALID [2018-11-23 12:14:15,496 INFO L273 TraceCheckUtils]: 72: Hoare triple {22577#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {22577#false} is VALID [2018-11-23 12:14:15,496 INFO L273 TraceCheckUtils]: 73: Hoare triple {22577#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {22577#false} is VALID [2018-11-23 12:14:15,497 INFO L273 TraceCheckUtils]: 74: Hoare triple {22577#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22577#false} is VALID [2018-11-23 12:14:15,497 INFO L273 TraceCheckUtils]: 75: Hoare triple {22577#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {22577#false} is VALID [2018-11-23 12:14:15,497 INFO L273 TraceCheckUtils]: 76: Hoare triple {22577#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {22577#false} is VALID [2018-11-23 12:14:15,497 INFO L273 TraceCheckUtils]: 77: Hoare triple {22577#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22577#false} is VALID [2018-11-23 12:14:15,497 INFO L273 TraceCheckUtils]: 78: Hoare triple {22577#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {22577#false} is VALID [2018-11-23 12:14:15,497 INFO L273 TraceCheckUtils]: 79: Hoare triple {22577#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {22577#false} is VALID [2018-11-23 12:14:15,497 INFO L273 TraceCheckUtils]: 80: Hoare triple {22577#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22577#false} is VALID [2018-11-23 12:14:15,497 INFO L273 TraceCheckUtils]: 81: Hoare triple {22577#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {22577#false} is VALID [2018-11-23 12:14:15,497 INFO L273 TraceCheckUtils]: 82: Hoare triple {22577#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {22577#false} is VALID [2018-11-23 12:14:15,498 INFO L273 TraceCheckUtils]: 83: Hoare triple {22577#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22577#false} is VALID [2018-11-23 12:14:15,498 INFO L273 TraceCheckUtils]: 84: Hoare triple {22577#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {22577#false} is VALID [2018-11-23 12:14:15,498 INFO L273 TraceCheckUtils]: 85: Hoare triple {22577#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {22577#false} is VALID [2018-11-23 12:14:15,498 INFO L273 TraceCheckUtils]: 86: Hoare triple {22577#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22577#false} is VALID [2018-11-23 12:14:15,498 INFO L273 TraceCheckUtils]: 87: Hoare triple {22577#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {22577#false} is VALID [2018-11-23 12:14:15,498 INFO L273 TraceCheckUtils]: 88: Hoare triple {22577#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {22577#false} is VALID [2018-11-23 12:14:15,498 INFO L273 TraceCheckUtils]: 89: Hoare triple {22577#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22577#false} is VALID [2018-11-23 12:14:15,498 INFO L273 TraceCheckUtils]: 90: Hoare triple {22577#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {22577#false} is VALID [2018-11-23 12:14:15,499 INFO L273 TraceCheckUtils]: 91: Hoare triple {22577#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {22577#false} is VALID [2018-11-23 12:14:15,499 INFO L273 TraceCheckUtils]: 92: Hoare triple {22577#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22577#false} is VALID [2018-11-23 12:14:15,499 INFO L273 TraceCheckUtils]: 93: Hoare triple {22577#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {22577#false} is VALID [2018-11-23 12:14:15,499 INFO L273 TraceCheckUtils]: 94: Hoare triple {22577#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {22577#false} is VALID [2018-11-23 12:14:15,499 INFO L273 TraceCheckUtils]: 95: Hoare triple {22577#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22577#false} is VALID [2018-11-23 12:14:15,499 INFO L273 TraceCheckUtils]: 96: Hoare triple {22577#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {22577#false} is VALID [2018-11-23 12:14:15,499 INFO L273 TraceCheckUtils]: 97: Hoare triple {22577#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {22577#false} is VALID [2018-11-23 12:14:15,499 INFO L273 TraceCheckUtils]: 98: Hoare triple {22577#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22577#false} is VALID [2018-11-23 12:14:15,499 INFO L273 TraceCheckUtils]: 99: Hoare triple {22577#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {22577#false} is VALID [2018-11-23 12:14:15,500 INFO L273 TraceCheckUtils]: 100: Hoare triple {22577#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {22577#false} is VALID [2018-11-23 12:14:15,500 INFO L273 TraceCheckUtils]: 101: Hoare triple {22577#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22577#false} is VALID [2018-11-23 12:14:15,500 INFO L273 TraceCheckUtils]: 102: Hoare triple {22577#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {22577#false} is VALID [2018-11-23 12:14:15,500 INFO L273 TraceCheckUtils]: 103: Hoare triple {22577#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {22577#false} is VALID [2018-11-23 12:14:15,500 INFO L273 TraceCheckUtils]: 104: Hoare triple {22577#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22577#false} is VALID [2018-11-23 12:14:15,500 INFO L273 TraceCheckUtils]: 105: Hoare triple {22577#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {22577#false} is VALID [2018-11-23 12:14:15,500 INFO L273 TraceCheckUtils]: 106: Hoare triple {22577#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {22577#false} is VALID [2018-11-23 12:14:15,500 INFO L273 TraceCheckUtils]: 107: Hoare triple {22577#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22577#false} is VALID [2018-11-23 12:14:15,501 INFO L273 TraceCheckUtils]: 108: Hoare triple {22577#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {22577#false} is VALID [2018-11-23 12:14:15,501 INFO L273 TraceCheckUtils]: 109: Hoare triple {22577#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {22577#false} is VALID [2018-11-23 12:14:15,501 INFO L273 TraceCheckUtils]: 110: Hoare triple {22577#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22577#false} is VALID [2018-11-23 12:14:15,501 INFO L273 TraceCheckUtils]: 111: Hoare triple {22577#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {22577#false} is VALID [2018-11-23 12:14:15,501 INFO L273 TraceCheckUtils]: 112: Hoare triple {22577#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {22577#false} is VALID [2018-11-23 12:14:15,501 INFO L273 TraceCheckUtils]: 113: Hoare triple {22577#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22577#false} is VALID [2018-11-23 12:14:15,501 INFO L273 TraceCheckUtils]: 114: Hoare triple {22577#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {22577#false} is VALID [2018-11-23 12:14:15,501 INFO L273 TraceCheckUtils]: 115: Hoare triple {22577#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {22577#false} is VALID [2018-11-23 12:14:15,501 INFO L273 TraceCheckUtils]: 116: Hoare triple {22577#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22577#false} is VALID [2018-11-23 12:14:15,502 INFO L273 TraceCheckUtils]: 117: Hoare triple {22577#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {22577#false} is VALID [2018-11-23 12:14:15,502 INFO L273 TraceCheckUtils]: 118: Hoare triple {22577#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {22577#false} is VALID [2018-11-23 12:14:15,502 INFO L273 TraceCheckUtils]: 119: Hoare triple {22577#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22577#false} is VALID [2018-11-23 12:14:15,502 INFO L273 TraceCheckUtils]: 120: Hoare triple {22577#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {22577#false} is VALID [2018-11-23 12:14:15,502 INFO L273 TraceCheckUtils]: 121: Hoare triple {22577#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {22577#false} is VALID [2018-11-23 12:14:15,502 INFO L273 TraceCheckUtils]: 122: Hoare triple {22577#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22577#false} is VALID [2018-11-23 12:14:15,502 INFO L273 TraceCheckUtils]: 123: Hoare triple {22577#false} assume !(~i~0 < 100000); {22577#false} is VALID [2018-11-23 12:14:15,502 INFO L273 TraceCheckUtils]: 124: Hoare triple {22577#false} ~i~0 := 0; {22577#false} is VALID [2018-11-23 12:14:15,503 INFO L273 TraceCheckUtils]: 125: Hoare triple {22577#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem5 == #t~mem6; {22577#false} is VALID [2018-11-23 12:14:15,503 INFO L273 TraceCheckUtils]: 126: Hoare triple {22577#false} assume !#t~short10;call #t~mem9 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 == #t~mem7 * #t~mem8; {22577#false} is VALID [2018-11-23 12:14:15,503 INFO L256 TraceCheckUtils]: 127: Hoare triple {22577#false} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {22577#false} is VALID [2018-11-23 12:14:15,503 INFO L273 TraceCheckUtils]: 128: Hoare triple {22577#false} ~cond := #in~cond; {22577#false} is VALID [2018-11-23 12:14:15,503 INFO L273 TraceCheckUtils]: 129: Hoare triple {22577#false} assume 0 == ~cond; {22577#false} is VALID [2018-11-23 12:14:15,503 INFO L273 TraceCheckUtils]: 130: Hoare triple {22577#false} assume !false; {22577#false} is VALID [2018-11-23 12:14:15,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2018-11-23 12:14:15,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:14:15,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-11-23 12:14:15,544 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 131 [2018-11-23 12:14:15,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:14:15,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:14:15,611 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:15,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:14:15,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:14:15,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:14:15,613 INFO L87 Difference]: Start difference. First operand 141 states and 167 transitions. Second operand 26 states. [2018-11-23 12:14:17,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:17,816 INFO L93 Difference]: Finished difference Result 381 states and 508 transitions. [2018-11-23 12:14:17,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 12:14:17,816 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 131 [2018-11-23 12:14:17,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:17,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:14:17,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 361 transitions. [2018-11-23 12:14:17,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:14:17,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 361 transitions. [2018-11-23 12:14:17,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 361 transitions. [2018-11-23 12:14:18,192 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 361 edges. 361 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:18,200 INFO L225 Difference]: With dead ends: 381 [2018-11-23 12:14:18,201 INFO L226 Difference]: Without dead ends: 293 [2018-11-23 12:14:18,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:14:18,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-11-23 12:14:18,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 146. [2018-11-23 12:14:18,291 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:14:18,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 293 states. Second operand 146 states. [2018-11-23 12:14:18,291 INFO L74 IsIncluded]: Start isIncluded. First operand 293 states. Second operand 146 states. [2018-11-23 12:14:18,291 INFO L87 Difference]: Start difference. First operand 293 states. Second operand 146 states. [2018-11-23 12:14:18,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:18,300 INFO L93 Difference]: Finished difference Result 293 states and 393 transitions. [2018-11-23 12:14:18,300 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 393 transitions. [2018-11-23 12:14:18,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:18,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:18,301 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 293 states. [2018-11-23 12:14:18,302 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 293 states. [2018-11-23 12:14:18,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:18,310 INFO L93 Difference]: Finished difference Result 293 states and 393 transitions. [2018-11-23 12:14:18,310 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 393 transitions. [2018-11-23 12:14:18,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:18,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:18,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:14:18,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:14:18,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-23 12:14:18,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 173 transitions. [2018-11-23 12:14:18,313 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 173 transitions. Word has length 131 [2018-11-23 12:14:18,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:18,313 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 173 transitions. [2018-11-23 12:14:18,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:14:18,314 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 173 transitions. [2018-11-23 12:14:18,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-23 12:14:18,314 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:18,314 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:18,314 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:18,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:18,315 INFO L82 PathProgramCache]: Analyzing trace with hash -8079272, now seen corresponding path program 24 times [2018-11-23 12:14:18,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:14:18,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:14:18,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:18,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:14:18,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:18,333 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:14:18,333 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:14:18,333 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:14:18,352 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE