java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-industry-pattern/array_mul_init_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:00:14,045 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:00:14,047 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:00:14,059 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:00:14,059 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:00:14,061 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:00:14,062 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:00:14,064 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:00:14,066 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:00:14,067 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:00:14,068 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:00:14,068 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:00:14,069 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:00:14,070 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:00:14,071 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:00:14,072 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:00:14,073 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:00:14,075 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:00:14,077 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:00:14,079 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:00:14,080 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:00:14,081 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:00:14,084 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:00:14,084 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:00:14,084 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:00:14,086 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:00:14,087 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:00:14,088 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:00:14,089 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:00:14,090 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:00:14,090 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:00:14,091 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:00:14,091 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:00:14,091 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:00:14,092 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:00:14,093 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:00:14,093 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 17:00:14,109 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:00:14,110 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:00:14,111 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:00:14,111 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:00:14,111 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:00:14,112 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:00:14,112 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:00:14,112 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:00:14,112 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:00:14,112 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:00:14,113 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:00:14,113 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:00:14,113 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:00:14,113 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:00:14,113 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:00:14,114 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:00:14,114 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:00:14,114 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:00:14,114 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:00:14,114 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:00:14,115 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:00:14,115 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:00:14,115 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:00:14,115 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:00:14,115 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:00:14,115 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:00:14,116 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:00:14,116 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:00:14,116 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:00:14,116 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:00:14,159 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:00:14,172 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:00:14,176 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:00:14,178 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:00:14,178 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:00:14,179 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-14 17:00:14,239 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8442a5373/9c4fd44279694fe69ecc135ca4337521/FLAG4149c265a [2018-11-14 17:00:14,733 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:00:14,735 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/array_mul_init_true-unreach-call_true-termination.i [2018-11-14 17:00:14,743 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8442a5373/9c4fd44279694fe69ecc135ca4337521/FLAG4149c265a [2018-11-14 17:00:14,765 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8442a5373/9c4fd44279694fe69ecc135ca4337521 [2018-11-14 17:00:14,781 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:00:14,783 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:00:14,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:00:14,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:00:14,791 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:00:14,792 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:00:14" (1/1) ... [2018-11-14 17:00:14,796 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d7e4d73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:00:14, skipping insertion in model container [2018-11-14 17:00:14,796 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:00:14" (1/1) ... [2018-11-14 17:00:14,806 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:00:14,829 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:00:15,058 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:00:15,063 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:00:15,097 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:00:15,125 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:00:15,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:00:15 WrapperNode [2018-11-14 17:00:15,126 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:00:15,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:00:15,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:00:15,127 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:00:15,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:00:15" (1/1) ... [2018-11-14 17:00:15,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:00:15" (1/1) ... [2018-11-14 17:00:15,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:00:15" (1/1) ... [2018-11-14 17:00:15,158 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:00:15" (1/1) ... [2018-11-14 17:00:15,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:00:15" (1/1) ... [2018-11-14 17:00:15,180 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:00:15" (1/1) ... [2018-11-14 17:00:15,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:00:15" (1/1) ... [2018-11-14 17:00:15,191 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:00:15,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:00:15,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:00:15,192 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:00:15,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:00:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:00:15,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:00:15,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:00:15,353 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:00:15,353 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:00:15,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:00:15,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:00:15,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2018-11-14 17:00:15,354 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:00:15,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:00:15,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:00:15,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:00:15,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:00:15,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:00:15,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:00:15,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:00:16,046 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:00:16,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:00:16 BoogieIcfgContainer [2018-11-14 17:00:16,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:00:16,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:00:16,050 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:00:16,055 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:00:16,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:00:14" (1/3) ... [2018-11-14 17:00:16,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d2683a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:00:16, skipping insertion in model container [2018-11-14 17:00:16,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:00:15" (2/3) ... [2018-11-14 17:00:16,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d2683a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:00:16, skipping insertion in model container [2018-11-14 17:00:16,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:00:16" (3/3) ... [2018-11-14 17:00:16,063 INFO L112 eAbstractionObserver]: Analyzing ICFG array_mul_init_true-unreach-call_true-termination.i [2018-11-14 17:00:16,073 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:00:16,082 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:00:16,097 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:00:16,130 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:00:16,131 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:00:16,131 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:00:16,131 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:00:16,131 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:00:16,131 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:00:16,131 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:00:16,132 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:00:16,132 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:00:16,152 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-14 17:00:16,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 17:00:16,159 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:00:16,160 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:00:16,163 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:00:16,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:00:16,170 INFO L82 PathProgramCache]: Analyzing trace with hash 206551718, now seen corresponding path program 1 times [2018-11-14 17:00:16,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:00:16,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:00:16,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:00:16,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:00:16,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:00:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:00:16,328 INFO L256 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {35#true} is VALID [2018-11-14 17:00:16,332 INFO L273 TraceCheckUtils]: 1: Hoare triple {35#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {35#true} is VALID [2018-11-14 17:00:16,332 INFO L273 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-14 17:00:16,333 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #77#return; {35#true} is VALID [2018-11-14 17:00:16,333 INFO L256 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret11 := main(); {35#true} is VALID [2018-11-14 17:00:16,334 INFO L273 TraceCheckUtils]: 5: Hoare triple {35#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; {35#true} is VALID [2018-11-14 17:00:16,334 INFO L273 TraceCheckUtils]: 6: Hoare triple {35#true} assume !true; {36#false} is VALID [2018-11-14 17:00:16,335 INFO L273 TraceCheckUtils]: 7: Hoare triple {36#false} ~i~0 := 0; {36#false} is VALID [2018-11-14 17:00:16,335 INFO L273 TraceCheckUtils]: 8: Hoare triple {36#false} assume !true; {36#false} is VALID [2018-11-14 17:00:16,336 INFO L273 TraceCheckUtils]: 9: Hoare triple {36#false} ~i~0 := 0; {36#false} is VALID [2018-11-14 17:00:16,336 INFO L273 TraceCheckUtils]: 10: Hoare triple {36#false} assume true; {36#false} is VALID [2018-11-14 17:00:16,336 INFO L273 TraceCheckUtils]: 11: Hoare triple {36#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);#t~short10 := #t~mem5 == #t~mem6; {36#false} is VALID [2018-11-14 17:00:16,336 INFO L273 TraceCheckUtils]: 12: Hoare triple {36#false} assume #t~short10; {36#false} is VALID [2018-11-14 17:00:16,337 INFO L256 TraceCheckUtils]: 13: Hoare triple {36#false} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {36#false} is VALID [2018-11-14 17:00:16,337 INFO L273 TraceCheckUtils]: 14: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2018-11-14 17:00:16,337 INFO L273 TraceCheckUtils]: 15: Hoare triple {36#false} assume ~cond == 0; {36#false} is VALID [2018-11-14 17:00:16,338 INFO L273 TraceCheckUtils]: 16: Hoare triple {36#false} assume !false; {36#false} is VALID [2018-11-14 17:00:16,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:00:16,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:00:16,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:00:16,350 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-14 17:00:16,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:00:16,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:00:16,523 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:00:16,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:00:16,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:00:16,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:00:16,537 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-11-14 17:00:16,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:00:16,792 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2018-11-14 17:00:16,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:00:16,793 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-14 17:00:16,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:00:16,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:00:16,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2018-11-14 17:00:16,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:00:16,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2018-11-14 17:00:16,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 70 transitions. [2018-11-14 17:00:17,074 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:00:17,086 INFO L225 Difference]: With dead ends: 55 [2018-11-14 17:00:17,087 INFO L226 Difference]: Without dead ends: 27 [2018-11-14 17:00:17,090 INFO L604 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-14 17:00:17,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-14 17:00:17,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-14 17:00:17,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:00:17,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-14 17:00:17,134 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-14 17:00:17,134 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-14 17:00:17,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:00:17,139 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-14 17:00:17,139 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-14 17:00:17,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:00:17,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:00:17,141 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-14 17:00:17,141 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-14 17:00:17,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:00:17,145 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-14 17:00:17,145 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-14 17:00:17,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:00:17,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:00:17,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:00:17,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:00:17,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 17:00:17,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-14 17:00:17,152 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 17 [2018-11-14 17:00:17,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:00:17,152 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-14 17:00:17,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:00:17,152 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-14 17:00:17,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 17:00:17,153 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:00:17,154 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:00:17,154 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:00:17,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:00:17,155 INFO L82 PathProgramCache]: Analyzing trace with hash 2117587094, now seen corresponding path program 1 times [2018-11-14 17:00:17,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:00:17,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:00:17,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:00:17,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:00:17,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:00:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:00:17,251 INFO L256 TraceCheckUtils]: 0: Hoare triple {197#true} call ULTIMATE.init(); {197#true} is VALID [2018-11-14 17:00:17,251 INFO L273 TraceCheckUtils]: 1: Hoare triple {197#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {197#true} is VALID [2018-11-14 17:00:17,252 INFO L273 TraceCheckUtils]: 2: Hoare triple {197#true} assume true; {197#true} is VALID [2018-11-14 17:00:17,252 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {197#true} {197#true} #77#return; {197#true} is VALID [2018-11-14 17:00:17,252 INFO L256 TraceCheckUtils]: 4: Hoare triple {197#true} call #t~ret11 := main(); {197#true} is VALID [2018-11-14 17:00:17,260 INFO L273 TraceCheckUtils]: 5: Hoare triple {197#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; {199#(= main_~i~0 0)} is VALID [2018-11-14 17:00:17,265 INFO L273 TraceCheckUtils]: 6: Hoare triple {199#(= main_~i~0 0)} assume true; {199#(= main_~i~0 0)} is VALID [2018-11-14 17:00:17,266 INFO L273 TraceCheckUtils]: 7: Hoare triple {199#(= main_~i~0 0)} assume !(~i~0 < 100000); {198#false} is VALID [2018-11-14 17:00:17,266 INFO L273 TraceCheckUtils]: 8: Hoare triple {198#false} ~i~0 := 0; {198#false} is VALID [2018-11-14 17:00:17,266 INFO L273 TraceCheckUtils]: 9: Hoare triple {198#false} assume true; {198#false} is VALID [2018-11-14 17:00:17,267 INFO L273 TraceCheckUtils]: 10: Hoare triple {198#false} assume !(~i~0 < 100000); {198#false} is VALID [2018-11-14 17:00:17,267 INFO L273 TraceCheckUtils]: 11: Hoare triple {198#false} ~i~0 := 0; {198#false} is VALID [2018-11-14 17:00:17,267 INFO L273 TraceCheckUtils]: 12: Hoare triple {198#false} assume true; {198#false} is VALID [2018-11-14 17:00:17,268 INFO L273 TraceCheckUtils]: 13: Hoare triple {198#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);#t~short10 := #t~mem5 == #t~mem6; {198#false} is VALID [2018-11-14 17:00:17,268 INFO L273 TraceCheckUtils]: 14: Hoare triple {198#false} assume #t~short10; {198#false} is VALID [2018-11-14 17:00:17,268 INFO L256 TraceCheckUtils]: 15: Hoare triple {198#false} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {198#false} is VALID [2018-11-14 17:00:17,269 INFO L273 TraceCheckUtils]: 16: Hoare triple {198#false} ~cond := #in~cond; {198#false} is VALID [2018-11-14 17:00:17,269 INFO L273 TraceCheckUtils]: 17: Hoare triple {198#false} assume ~cond == 0; {198#false} is VALID [2018-11-14 17:00:17,269 INFO L273 TraceCheckUtils]: 18: Hoare triple {198#false} assume !false; {198#false} is VALID [2018-11-14 17:00:17,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:00:17,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:00:17,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:00:17,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-14 17:00:17,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:00:17,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:00:17,341 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:00:17,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:00:17,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:00:17,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:00:17,343 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 3 states. [2018-11-14 17:00:17,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:00:17,922 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2018-11-14 17:00:17,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:00:17,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-14 17:00:17,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:00:17,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:00:17,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2018-11-14 17:00:17,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:00:17,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2018-11-14 17:00:17,931 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2018-11-14 17:00:18,176 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:00:18,179 INFO L225 Difference]: With dead ends: 58 [2018-11-14 17:00:18,180 INFO L226 Difference]: Without dead ends: 40 [2018-11-14 17:00:18,181 INFO L604 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-14 17:00:18,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-14 17:00:18,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2018-11-14 17:00:18,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:00:18,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 31 states. [2018-11-14 17:00:18,201 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 31 states. [2018-11-14 17:00:18,201 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 31 states. [2018-11-14 17:00:18,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:00:18,206 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2018-11-14 17:00:18,206 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2018-11-14 17:00:18,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:00:18,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:00:18,207 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 40 states. [2018-11-14 17:00:18,208 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 40 states. [2018-11-14 17:00:18,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:00:18,212 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2018-11-14 17:00:18,212 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2018-11-14 17:00:18,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:00:18,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:00:18,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:00:18,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:00:18,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 17:00:18,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-14 17:00:18,216 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 19 [2018-11-14 17:00:18,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:00:18,216 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-14 17:00:18,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:00:18,217 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-14 17:00:18,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 17:00:18,218 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:00:18,218 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:00:18,218 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:00:18,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:00:18,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1257431516, now seen corresponding path program 1 times [2018-11-14 17:00:18,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:00:18,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:00:18,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:00:18,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:00:18,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:00:18,239 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:00:18,239 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:00:18,239 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:00:18,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:00:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:00:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:00:18,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:00:18,606 INFO L256 TraceCheckUtils]: 0: Hoare triple {399#true} call ULTIMATE.init(); {399#true} is VALID [2018-11-14 17:00:18,606 INFO L273 TraceCheckUtils]: 1: Hoare triple {399#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {399#true} is VALID [2018-11-14 17:00:18,606 INFO L273 TraceCheckUtils]: 2: Hoare triple {399#true} assume true; {399#true} is VALID [2018-11-14 17:00:18,607 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {399#true} {399#true} #77#return; {399#true} is VALID [2018-11-14 17:00:18,607 INFO L256 TraceCheckUtils]: 4: Hoare triple {399#true} call #t~ret11 := main(); {399#true} is VALID [2018-11-14 17:00:18,620 INFO L273 TraceCheckUtils]: 5: Hoare triple {399#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; {419#(<= main_~i~0 0)} is VALID [2018-11-14 17:00:18,622 INFO L273 TraceCheckUtils]: 6: Hoare triple {419#(<= main_~i~0 0)} assume true; {419#(<= main_~i~0 0)} is VALID [2018-11-14 17:00:18,624 INFO L273 TraceCheckUtils]: 7: Hoare triple {419#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4); {419#(<= main_~i~0 0)} is VALID [2018-11-14 17:00:18,625 INFO L273 TraceCheckUtils]: 8: Hoare triple {419#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {429#(<= main_~i~0 1)} is VALID [2018-11-14 17:00:18,625 INFO L273 TraceCheckUtils]: 9: Hoare triple {429#(<= main_~i~0 1)} assume true; {429#(<= main_~i~0 1)} is VALID [2018-11-14 17:00:18,627 INFO L273 TraceCheckUtils]: 10: Hoare triple {429#(<= main_~i~0 1)} assume !(~i~0 < 100000); {400#false} is VALID [2018-11-14 17:00:18,627 INFO L273 TraceCheckUtils]: 11: Hoare triple {400#false} ~i~0 := 0; {400#false} is VALID [2018-11-14 17:00:18,627 INFO L273 TraceCheckUtils]: 12: Hoare triple {400#false} assume true; {400#false} is VALID [2018-11-14 17:00:18,628 INFO L273 TraceCheckUtils]: 13: Hoare triple {400#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {400#false} is VALID [2018-11-14 17:00:18,628 INFO L273 TraceCheckUtils]: 14: Hoare triple {400#false} assume #t~nondet2 != 0;havoc #t~nondet2;assume -32768 <= #t~nondet3 && #t~nondet3 <= 32767;~k~0 := #t~nondet3;havoc #t~nondet3;call write~int(~k~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(~k~0 * ~k~0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4); {400#false} is VALID [2018-11-14 17:00:18,629 INFO L273 TraceCheckUtils]: 15: Hoare triple {400#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {400#false} is VALID [2018-11-14 17:00:18,629 INFO L273 TraceCheckUtils]: 16: Hoare triple {400#false} assume true; {400#false} is VALID [2018-11-14 17:00:18,630 INFO L273 TraceCheckUtils]: 17: Hoare triple {400#false} assume !(~i~0 < 100000); {400#false} is VALID [2018-11-14 17:00:18,630 INFO L273 TraceCheckUtils]: 18: Hoare triple {400#false} ~i~0 := 0; {400#false} is VALID [2018-11-14 17:00:18,631 INFO L273 TraceCheckUtils]: 19: Hoare triple {400#false} assume true; {400#false} is VALID [2018-11-14 17:00:18,631 INFO L273 TraceCheckUtils]: 20: Hoare triple {400#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);#t~short10 := #t~mem5 == #t~mem6; {400#false} is VALID [2018-11-14 17:00:18,631 INFO L273 TraceCheckUtils]: 21: Hoare triple {400#false} assume #t~short10; {400#false} is VALID [2018-11-14 17:00:18,632 INFO L256 TraceCheckUtils]: 22: Hoare triple {400#false} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {400#false} is VALID [2018-11-14 17:00:18,632 INFO L273 TraceCheckUtils]: 23: Hoare triple {400#false} ~cond := #in~cond; {400#false} is VALID [2018-11-14 17:00:18,632 INFO L273 TraceCheckUtils]: 24: Hoare triple {400#false} assume ~cond == 0; {400#false} is VALID [2018-11-14 17:00:18,633 INFO L273 TraceCheckUtils]: 25: Hoare triple {400#false} assume !false; {400#false} is VALID [2018-11-14 17:00:18,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 17:00:18,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:00:18,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-11-14 17:00:18,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-11-14 17:00:18,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:00:18,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:00:18,733 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:00:18,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:00:18,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:00:18,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:00:18,734 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 4 states. [2018-11-14 17:00:19,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:00:19,220 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2018-11-14 17:00:19,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:00:19,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-11-14 17:00:19,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:00:19,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:00:19,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2018-11-14 17:00:19,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:00:19,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2018-11-14 17:00:19,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 86 transitions. [2018-11-14 17:00:19,436 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:00:19,441 INFO L225 Difference]: With dead ends: 73 [2018-11-14 17:00:19,442 INFO L226 Difference]: Without dead ends: 53 [2018-11-14 17:00:19,442 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:00:19,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-14 17:00:19,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 38. [2018-11-14 17:00:19,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:00:19,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 38 states. [2018-11-14 17:00:19,493 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 38 states. [2018-11-14 17:00:19,493 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 38 states. [2018-11-14 17:00:19,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:00:19,498 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-11-14 17:00:19,498 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-11-14 17:00:19,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:00:19,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:00:19,499 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 53 states. [2018-11-14 17:00:19,499 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 53 states. [2018-11-14 17:00:19,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:00:19,503 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-11-14 17:00:19,504 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-11-14 17:00:19,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:00:19,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:00:19,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:00:19,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:00:19,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 17:00:19,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-11-14 17:00:19,508 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 26 [2018-11-14 17:00:19,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:00:19,508 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-14 17:00:19,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:00:19,508 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-14 17:00:19,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-14 17:00:19,509 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:00:19,510 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:00:19,510 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:00:19,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:00:19,510 INFO L82 PathProgramCache]: Analyzing trace with hash -267016696, now seen corresponding path program 2 times [2018-11-14 17:00:19,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:00:19,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:00:19,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:00:19,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:00:19,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:00:19,527 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:00:19,527 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:00:19,527 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:00:19,544 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:00:19,563 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 17:00:19,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:00:19,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:00:19,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:00:19,731 INFO L256 TraceCheckUtils]: 0: Hoare triple {732#true} call ULTIMATE.init(); {732#true} is VALID [2018-11-14 17:00:19,732 INFO L273 TraceCheckUtils]: 1: Hoare triple {732#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {732#true} is VALID [2018-11-14 17:00:19,732 INFO L273 TraceCheckUtils]: 2: Hoare triple {732#true} assume true; {732#true} is VALID [2018-11-14 17:00:19,732 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {732#true} {732#true} #77#return; {732#true} is VALID [2018-11-14 17:00:19,733 INFO L256 TraceCheckUtils]: 4: Hoare triple {732#true} call #t~ret11 := main(); {732#true} is VALID [2018-11-14 17:00:19,733 INFO L273 TraceCheckUtils]: 5: Hoare triple {732#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; {732#true} is VALID [2018-11-14 17:00:19,733 INFO L273 TraceCheckUtils]: 6: Hoare triple {732#true} assume true; {732#true} is VALID [2018-11-14 17:00:19,733 INFO L273 TraceCheckUtils]: 7: Hoare triple {732#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4); {732#true} is VALID [2018-11-14 17:00:19,734 INFO L273 TraceCheckUtils]: 8: Hoare triple {732#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {732#true} is VALID [2018-11-14 17:00:19,734 INFO L273 TraceCheckUtils]: 9: Hoare triple {732#true} assume true; {732#true} is VALID [2018-11-14 17:00:19,734 INFO L273 TraceCheckUtils]: 10: Hoare triple {732#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4); {732#true} is VALID [2018-11-14 17:00:19,734 INFO L273 TraceCheckUtils]: 11: Hoare triple {732#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {732#true} is VALID [2018-11-14 17:00:19,735 INFO L273 TraceCheckUtils]: 12: Hoare triple {732#true} assume true; {732#true} is VALID [2018-11-14 17:00:19,735 INFO L273 TraceCheckUtils]: 13: Hoare triple {732#true} assume !(~i~0 < 100000); {732#true} is VALID [2018-11-14 17:00:19,735 INFO L273 TraceCheckUtils]: 14: Hoare triple {732#true} ~i~0 := 0; {732#true} is VALID [2018-11-14 17:00:19,735 INFO L273 TraceCheckUtils]: 15: Hoare triple {732#true} assume true; {732#true} is VALID [2018-11-14 17:00:19,735 INFO L273 TraceCheckUtils]: 16: Hoare triple {732#true} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {732#true} is VALID [2018-11-14 17:00:19,736 INFO L273 TraceCheckUtils]: 17: Hoare triple {732#true} assume #t~nondet2 != 0;havoc #t~nondet2;assume -32768 <= #t~nondet3 && #t~nondet3 <= 32767;~k~0 := #t~nondet3;havoc #t~nondet3;call write~int(~k~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(~k~0 * ~k~0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4); {732#true} is VALID [2018-11-14 17:00:19,736 INFO L273 TraceCheckUtils]: 18: Hoare triple {732#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {732#true} is VALID [2018-11-14 17:00:19,736 INFO L273 TraceCheckUtils]: 19: Hoare triple {732#true} assume true; {732#true} is VALID [2018-11-14 17:00:19,737 INFO L273 TraceCheckUtils]: 20: Hoare triple {732#true} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {732#true} is VALID [2018-11-14 17:00:19,737 INFO L273 TraceCheckUtils]: 21: Hoare triple {732#true} assume #t~nondet2 != 0;havoc #t~nondet2;assume -32768 <= #t~nondet3 && #t~nondet3 <= 32767;~k~0 := #t~nondet3;havoc #t~nondet3;call write~int(~k~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(~k~0 * ~k~0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4); {732#true} is VALID [2018-11-14 17:00:19,737 INFO L273 TraceCheckUtils]: 22: Hoare triple {732#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {732#true} is VALID [2018-11-14 17:00:19,738 INFO L273 TraceCheckUtils]: 23: Hoare triple {732#true} assume true; {732#true} is VALID [2018-11-14 17:00:19,738 INFO L273 TraceCheckUtils]: 24: Hoare triple {732#true} assume !(~i~0 < 100000); {732#true} is VALID [2018-11-14 17:00:19,738 INFO L273 TraceCheckUtils]: 25: Hoare triple {732#true} ~i~0 := 0; {732#true} is VALID [2018-11-14 17:00:19,738 INFO L273 TraceCheckUtils]: 26: Hoare triple {732#true} assume true; {732#true} is VALID [2018-11-14 17:00:19,739 INFO L273 TraceCheckUtils]: 27: Hoare triple {732#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);#t~short10 := #t~mem5 == #t~mem6; {732#true} is VALID [2018-11-14 17:00:19,744 INFO L273 TraceCheckUtils]: 28: Hoare triple {732#true} assume #t~short10; {821#|main_#t~short10|} is VALID [2018-11-14 17:00:19,746 INFO L256 TraceCheckUtils]: 29: Hoare triple {821#|main_#t~short10|} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {825#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:00:19,746 INFO L273 TraceCheckUtils]: 30: Hoare triple {825#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {829#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:00:19,748 INFO L273 TraceCheckUtils]: 31: Hoare triple {829#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {733#false} is VALID [2018-11-14 17:00:19,748 INFO L273 TraceCheckUtils]: 32: Hoare triple {733#false} assume !false; {733#false} is VALID [2018-11-14 17:00:19,751 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-14 17:00:19,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:00:19,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:00:19,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-11-14 17:00:19,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:00:19,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:00:19,804 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:00:19,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:00:19,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:00:19,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:00:19,806 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 5 states. [2018-11-14 17:00:20,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:00:20,081 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-14 17:00:20,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:00:20,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-11-14 17:00:20,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:00:20,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:00:20,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2018-11-14 17:00:20,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:00:20,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2018-11-14 17:00:20,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 39 transitions. [2018-11-14 17:00:20,176 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:00:20,177 INFO L225 Difference]: With dead ends: 46 [2018-11-14 17:00:20,177 INFO L226 Difference]: Without dead ends: 44 [2018-11-14 17:00:20,178 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 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-14 17:00:20,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-14 17:00:20,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-11-14 17:00:20,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:00:20,212 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 43 states. [2018-11-14 17:00:20,212 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 43 states. [2018-11-14 17:00:20,212 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 43 states. [2018-11-14 17:00:20,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:00:20,215 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-14 17:00:20,216 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-14 17:00:20,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:00:20,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:00:20,217 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 44 states. [2018-11-14 17:00:20,217 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 44 states. [2018-11-14 17:00:20,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:00:20,220 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-14 17:00:20,220 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-14 17:00:20,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:00:20,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:00:20,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:00:20,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:00:20,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-14 17:00:20,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-14 17:00:20,225 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 33 [2018-11-14 17:00:20,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:00:20,225 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-14 17:00:20,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:00:20,226 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-14 17:00:20,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-14 17:00:20,227 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:00:20,227 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:00:20,228 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:00:20,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:00:20,228 INFO L82 PathProgramCache]: Analyzing trace with hash -265169654, now seen corresponding path program 1 times [2018-11-14 17:00:20,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:00:20,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:00:20,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:00:20,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:00:20,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:00:20,246 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:00:20,247 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:00:20,247 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:00:20,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:00:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:00:20,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:00:20,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:00:20,426 INFO L256 TraceCheckUtils]: 0: Hoare triple {1044#true} call ULTIMATE.init(); {1044#true} is VALID [2018-11-14 17:00:20,426 INFO L273 TraceCheckUtils]: 1: Hoare triple {1044#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1044#true} is VALID [2018-11-14 17:00:20,427 INFO L273 TraceCheckUtils]: 2: Hoare triple {1044#true} assume true; {1044#true} is VALID [2018-11-14 17:00:20,427 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1044#true} {1044#true} #77#return; {1044#true} is VALID [2018-11-14 17:00:20,428 INFO L256 TraceCheckUtils]: 4: Hoare triple {1044#true} call #t~ret11 := main(); {1044#true} is VALID [2018-11-14 17:00:20,429 INFO L273 TraceCheckUtils]: 5: Hoare triple {1044#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; {1064#(<= main_~i~0 0)} is VALID [2018-11-14 17:00:20,429 INFO L273 TraceCheckUtils]: 6: Hoare triple {1064#(<= main_~i~0 0)} assume true; {1064#(<= main_~i~0 0)} is VALID [2018-11-14 17:00:20,430 INFO L273 TraceCheckUtils]: 7: Hoare triple {1064#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4); {1064#(<= main_~i~0 0)} is VALID [2018-11-14 17:00:20,430 INFO L273 TraceCheckUtils]: 8: Hoare triple {1064#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1074#(<= main_~i~0 1)} is VALID [2018-11-14 17:00:20,442 INFO L273 TraceCheckUtils]: 9: Hoare triple {1074#(<= main_~i~0 1)} assume true; {1074#(<= main_~i~0 1)} is VALID [2018-11-14 17:00:20,443 INFO L273 TraceCheckUtils]: 10: Hoare triple {1074#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4); {1074#(<= main_~i~0 1)} is VALID [2018-11-14 17:00:20,447 INFO L273 TraceCheckUtils]: 11: Hoare triple {1074#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1084#(<= main_~i~0 2)} is VALID [2018-11-14 17:00:20,448 INFO L273 TraceCheckUtils]: 12: Hoare triple {1084#(<= main_~i~0 2)} assume true; {1084#(<= main_~i~0 2)} is VALID [2018-11-14 17:00:20,449 INFO L273 TraceCheckUtils]: 13: Hoare triple {1084#(<= main_~i~0 2)} assume !(~i~0 < 100000); {1045#false} is VALID [2018-11-14 17:00:20,449 INFO L273 TraceCheckUtils]: 14: Hoare triple {1045#false} ~i~0 := 0; {1045#false} is VALID [2018-11-14 17:00:20,449 INFO L273 TraceCheckUtils]: 15: Hoare triple {1045#false} assume true; {1045#false} is VALID [2018-11-14 17:00:20,449 INFO L273 TraceCheckUtils]: 16: Hoare triple {1045#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {1045#false} is VALID [2018-11-14 17:00:20,450 INFO L273 TraceCheckUtils]: 17: Hoare triple {1045#false} assume #t~nondet2 != 0;havoc #t~nondet2;assume -32768 <= #t~nondet3 && #t~nondet3 <= 32767;~k~0 := #t~nondet3;havoc #t~nondet3;call write~int(~k~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(~k~0 * ~k~0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4); {1045#false} is VALID [2018-11-14 17:00:20,450 INFO L273 TraceCheckUtils]: 18: Hoare triple {1045#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1045#false} is VALID [2018-11-14 17:00:20,450 INFO L273 TraceCheckUtils]: 19: Hoare triple {1045#false} assume true; {1045#false} is VALID [2018-11-14 17:00:20,450 INFO L273 TraceCheckUtils]: 20: Hoare triple {1045#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {1045#false} is VALID [2018-11-14 17:00:20,451 INFO L273 TraceCheckUtils]: 21: Hoare triple {1045#false} assume #t~nondet2 != 0;havoc #t~nondet2;assume -32768 <= #t~nondet3 && #t~nondet3 <= 32767;~k~0 := #t~nondet3;havoc #t~nondet3;call write~int(~k~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(~k~0 * ~k~0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4); {1045#false} is VALID [2018-11-14 17:00:20,451 INFO L273 TraceCheckUtils]: 22: Hoare triple {1045#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1045#false} is VALID [2018-11-14 17:00:20,451 INFO L273 TraceCheckUtils]: 23: Hoare triple {1045#false} assume true; {1045#false} is VALID [2018-11-14 17:00:20,451 INFO L273 TraceCheckUtils]: 24: Hoare triple {1045#false} assume !(~i~0 < 100000); {1045#false} is VALID [2018-11-14 17:00:20,452 INFO L273 TraceCheckUtils]: 25: Hoare triple {1045#false} ~i~0 := 0; {1045#false} is VALID [2018-11-14 17:00:20,452 INFO L273 TraceCheckUtils]: 26: Hoare triple {1045#false} assume true; {1045#false} is VALID [2018-11-14 17:00:20,452 INFO L273 TraceCheckUtils]: 27: Hoare triple {1045#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);#t~short10 := #t~mem5 == #t~mem6; {1045#false} is VALID [2018-11-14 17:00:20,452 INFO L273 TraceCheckUtils]: 28: Hoare triple {1045#false} assume !#t~short10;call #t~mem9 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);#t~short10 := #t~mem9 == #t~mem7 * #t~mem8; {1045#false} is VALID [2018-11-14 17:00:20,453 INFO L256 TraceCheckUtils]: 29: Hoare triple {1045#false} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {1045#false} is VALID [2018-11-14 17:00:20,453 INFO L273 TraceCheckUtils]: 30: Hoare triple {1045#false} ~cond := #in~cond; {1045#false} is VALID [2018-11-14 17:00:20,453 INFO L273 TraceCheckUtils]: 31: Hoare triple {1045#false} assume ~cond == 0; {1045#false} is VALID [2018-11-14 17:00:20,454 INFO L273 TraceCheckUtils]: 32: Hoare triple {1045#false} assume !false; {1045#false} is VALID [2018-11-14 17:00:20,456 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-14 17:00:20,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:00:20,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-14 17:00:20,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-11-14 17:00:20,482 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:00:20,482 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:00:20,522 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:00:20,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:00:20,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:00:20,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:00:20,523 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 5 states. [2018-11-14 17:00:20,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:00:20,889 INFO L93 Difference]: Finished difference Result 103 states and 125 transitions. [2018-11-14 17:00:20,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:00:20,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-11-14 17:00:20,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:00:20,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:00:20,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2018-11-14 17:00:20,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:00:20,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2018-11-14 17:00:20,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 102 transitions. [2018-11-14 17:00:21,011 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:00:21,015 INFO L225 Difference]: With dead ends: 103 [2018-11-14 17:00:21,015 INFO L226 Difference]: Without dead ends: 74 [2018-11-14 17:00:21,016 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:00:21,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-14 17:00:21,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 50. [2018-11-14 17:00:21,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:00:21,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 50 states. [2018-11-14 17:00:21,054 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 50 states. [2018-11-14 17:00:21,054 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 50 states. [2018-11-14 17:00:21,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:00:21,059 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2018-11-14 17:00:21,060 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 90 transitions. [2018-11-14 17:00:21,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:00:21,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:00:21,061 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 74 states. [2018-11-14 17:00:21,061 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 74 states. [2018-11-14 17:00:21,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:00:21,066 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2018-11-14 17:00:21,067 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 90 transitions. [2018-11-14 17:00:21,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:00:21,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:00:21,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:00:21,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:00:21,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 17:00:21,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-11-14 17:00:21,071 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 33 [2018-11-14 17:00:21,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:00:21,071 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-11-14 17:00:21,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:00:21,072 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-11-14 17:00:21,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-14 17:00:21,073 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:00:21,073 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:00:21,073 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:00:21,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:00:21,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1677259560, now seen corresponding path program 2 times [2018-11-14 17:00:21,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:00:21,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:00:21,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:00:21,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:00:21,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:00:21,096 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:00:21,096 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:00:21,096 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:00:21,115 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:00:21,151 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:00:21,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:00:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:00:21,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:00:21,390 INFO L256 TraceCheckUtils]: 0: Hoare triple {1499#true} call ULTIMATE.init(); {1499#true} is VALID [2018-11-14 17:00:21,391 INFO L273 TraceCheckUtils]: 1: Hoare triple {1499#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1499#true} is VALID [2018-11-14 17:00:21,392 INFO L273 TraceCheckUtils]: 2: Hoare triple {1499#true} assume true; {1499#true} is VALID [2018-11-14 17:00:21,392 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1499#true} {1499#true} #77#return; {1499#true} is VALID [2018-11-14 17:00:21,392 INFO L256 TraceCheckUtils]: 4: Hoare triple {1499#true} call #t~ret11 := main(); {1499#true} is VALID [2018-11-14 17:00:21,393 INFO L273 TraceCheckUtils]: 5: Hoare triple {1499#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; {1519#(<= main_~i~0 0)} is VALID [2018-11-14 17:00:21,394 INFO L273 TraceCheckUtils]: 6: Hoare triple {1519#(<= main_~i~0 0)} assume true; {1519#(<= main_~i~0 0)} is VALID [2018-11-14 17:00:21,395 INFO L273 TraceCheckUtils]: 7: Hoare triple {1519#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4); {1519#(<= main_~i~0 0)} is VALID [2018-11-14 17:00:21,395 INFO L273 TraceCheckUtils]: 8: Hoare triple {1519#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1529#(<= main_~i~0 1)} is VALID [2018-11-14 17:00:21,396 INFO L273 TraceCheckUtils]: 9: Hoare triple {1529#(<= main_~i~0 1)} assume true; {1529#(<= main_~i~0 1)} is VALID [2018-11-14 17:00:21,404 INFO L273 TraceCheckUtils]: 10: Hoare triple {1529#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4); {1529#(<= main_~i~0 1)} is VALID [2018-11-14 17:00:21,405 INFO L273 TraceCheckUtils]: 11: Hoare triple {1529#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1539#(<= main_~i~0 2)} is VALID [2018-11-14 17:00:21,405 INFO L273 TraceCheckUtils]: 12: Hoare triple {1539#(<= main_~i~0 2)} assume true; {1539#(<= main_~i~0 2)} is VALID [2018-11-14 17:00:21,406 INFO L273 TraceCheckUtils]: 13: Hoare triple {1539#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4); {1539#(<= main_~i~0 2)} is VALID [2018-11-14 17:00:21,406 INFO L273 TraceCheckUtils]: 14: Hoare triple {1539#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1549#(<= main_~i~0 3)} is VALID [2018-11-14 17:00:21,407 INFO L273 TraceCheckUtils]: 15: Hoare triple {1549#(<= main_~i~0 3)} assume true; {1549#(<= main_~i~0 3)} is VALID [2018-11-14 17:00:21,407 INFO L273 TraceCheckUtils]: 16: Hoare triple {1549#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1500#false} is VALID [2018-11-14 17:00:21,408 INFO L273 TraceCheckUtils]: 17: Hoare triple {1500#false} ~i~0 := 0; {1500#false} is VALID [2018-11-14 17:00:21,408 INFO L273 TraceCheckUtils]: 18: Hoare triple {1500#false} assume true; {1500#false} is VALID [2018-11-14 17:00:21,408 INFO L273 TraceCheckUtils]: 19: Hoare triple {1500#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {1500#false} is VALID [2018-11-14 17:00:21,408 INFO L273 TraceCheckUtils]: 20: Hoare triple {1500#false} assume #t~nondet2 != 0;havoc #t~nondet2;assume -32768 <= #t~nondet3 && #t~nondet3 <= 32767;~k~0 := #t~nondet3;havoc #t~nondet3;call write~int(~k~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(~k~0 * ~k~0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4); {1500#false} is VALID [2018-11-14 17:00:21,409 INFO L273 TraceCheckUtils]: 21: Hoare triple {1500#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1500#false} is VALID [2018-11-14 17:00:21,409 INFO L273 TraceCheckUtils]: 22: Hoare triple {1500#false} assume true; {1500#false} is VALID [2018-11-14 17:00:21,410 INFO L273 TraceCheckUtils]: 23: Hoare triple {1500#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {1500#false} is VALID [2018-11-14 17:00:21,410 INFO L273 TraceCheckUtils]: 24: Hoare triple {1500#false} assume #t~nondet2 != 0;havoc #t~nondet2;assume -32768 <= #t~nondet3 && #t~nondet3 <= 32767;~k~0 := #t~nondet3;havoc #t~nondet3;call write~int(~k~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(~k~0 * ~k~0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4); {1500#false} is VALID [2018-11-14 17:00:21,410 INFO L273 TraceCheckUtils]: 25: Hoare triple {1500#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1500#false} is VALID [2018-11-14 17:00:21,411 INFO L273 TraceCheckUtils]: 26: Hoare triple {1500#false} assume true; {1500#false} is VALID [2018-11-14 17:00:21,411 INFO L273 TraceCheckUtils]: 27: Hoare triple {1500#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {1500#false} is VALID [2018-11-14 17:00:21,411 INFO L273 TraceCheckUtils]: 28: Hoare triple {1500#false} assume #t~nondet2 != 0;havoc #t~nondet2;assume -32768 <= #t~nondet3 && #t~nondet3 <= 32767;~k~0 := #t~nondet3;havoc #t~nondet3;call write~int(~k~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(~k~0 * ~k~0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4); {1500#false} is VALID [2018-11-14 17:00:21,412 INFO L273 TraceCheckUtils]: 29: Hoare triple {1500#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1500#false} is VALID [2018-11-14 17:00:21,412 INFO L273 TraceCheckUtils]: 30: Hoare triple {1500#false} assume true; {1500#false} is VALID [2018-11-14 17:00:21,412 INFO L273 TraceCheckUtils]: 31: Hoare triple {1500#false} assume !(~i~0 < 100000); {1500#false} is VALID [2018-11-14 17:00:21,413 INFO L273 TraceCheckUtils]: 32: Hoare triple {1500#false} ~i~0 := 0; {1500#false} is VALID [2018-11-14 17:00:21,413 INFO L273 TraceCheckUtils]: 33: Hoare triple {1500#false} assume true; {1500#false} is VALID [2018-11-14 17:00:21,413 INFO L273 TraceCheckUtils]: 34: Hoare triple {1500#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);#t~short10 := #t~mem5 == #t~mem6; {1500#false} is VALID [2018-11-14 17:00:21,413 INFO L273 TraceCheckUtils]: 35: Hoare triple {1500#false} assume !#t~short10;call #t~mem9 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);#t~short10 := #t~mem9 == #t~mem7 * #t~mem8; {1500#false} is VALID [2018-11-14 17:00:21,413 INFO L256 TraceCheckUtils]: 36: Hoare triple {1500#false} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {1500#false} is VALID [2018-11-14 17:00:21,414 INFO L273 TraceCheckUtils]: 37: Hoare triple {1500#false} ~cond := #in~cond; {1500#false} is VALID [2018-11-14 17:00:21,414 INFO L273 TraceCheckUtils]: 38: Hoare triple {1500#false} assume ~cond == 0; {1500#false} is VALID [2018-11-14 17:00:21,414 INFO L273 TraceCheckUtils]: 39: Hoare triple {1500#false} assume !false; {1500#false} is VALID [2018-11-14 17:00:21,417 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 17:00:21,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:00:21,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-14 17:00:21,440 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-11-14 17:00:21,441 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:00:21,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:00:21,474 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:00:21,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:00:21,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:00:21,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:00:21,476 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 6 states. [2018-11-14 17:00:21,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:00:21,849 INFO L93 Difference]: Finished difference Result 121 states and 148 transitions. [2018-11-14 17:00:21,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:00:21,849 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-11-14 17:00:21,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:00:21,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:00:21,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2018-11-14 17:00:21,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:00:21,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2018-11-14 17:00:21,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 118 transitions. [2018-11-14 17:00:22,091 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:00:22,095 INFO L225 Difference]: With dead ends: 121 [2018-11-14 17:00:22,095 INFO L226 Difference]: Without dead ends: 88 [2018-11-14 17:00:22,096 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:00:22,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-14 17:00:22,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 57. [2018-11-14 17:00:22,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:00:22,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 57 states. [2018-11-14 17:00:22,126 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 57 states. [2018-11-14 17:00:22,127 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 57 states. [2018-11-14 17:00:22,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:00:22,132 INFO L93 Difference]: Finished difference Result 88 states and 108 transitions. [2018-11-14 17:00:22,132 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2018-11-14 17:00:22,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:00:22,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:00:22,134 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 88 states. [2018-11-14 17:00:22,134 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 88 states. [2018-11-14 17:00:22,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:00:22,139 INFO L93 Difference]: Finished difference Result 88 states and 108 transitions. [2018-11-14 17:00:22,139 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2018-11-14 17:00:22,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:00:22,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:00:22,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:00:22,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:00:22,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-14 17:00:22,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-11-14 17:00:22,143 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 40 [2018-11-14 17:00:22,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:00:22,143 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-11-14 17:00:22,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:00:22,144 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-11-14 17:00:22,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-14 17:00:22,145 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:00:22,145 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:00:22,145 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:00:22,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:00:22,146 INFO L82 PathProgramCache]: Analyzing trace with hash 297554044, now seen corresponding path program 3 times [2018-11-14 17:00:22,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:00:22,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:00:22,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:00:22,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:00:22,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:00:22,161 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:00:22,161 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:00:22,161 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:00:22,181 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:01:04,236 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-14 17:01:04,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:01:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:01:04,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:01:04,414 INFO L256 TraceCheckUtils]: 0: Hoare triple {2037#true} call ULTIMATE.init(); {2037#true} is VALID [2018-11-14 17:01:04,414 INFO L273 TraceCheckUtils]: 1: Hoare triple {2037#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2037#true} is VALID [2018-11-14 17:01:04,415 INFO L273 TraceCheckUtils]: 2: Hoare triple {2037#true} assume true; {2037#true} is VALID [2018-11-14 17:01:04,415 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2037#true} {2037#true} #77#return; {2037#true} is VALID [2018-11-14 17:01:04,415 INFO L256 TraceCheckUtils]: 4: Hoare triple {2037#true} call #t~ret11 := main(); {2037#true} is VALID [2018-11-14 17:01:04,416 INFO L273 TraceCheckUtils]: 5: Hoare triple {2037#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; {2037#true} is VALID [2018-11-14 17:01:04,416 INFO L273 TraceCheckUtils]: 6: Hoare triple {2037#true} assume true; {2037#true} is VALID [2018-11-14 17:01:04,416 INFO L273 TraceCheckUtils]: 7: Hoare triple {2037#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4); {2037#true} is VALID [2018-11-14 17:01:04,416 INFO L273 TraceCheckUtils]: 8: Hoare triple {2037#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2037#true} is VALID [2018-11-14 17:01:04,417 INFO L273 TraceCheckUtils]: 9: Hoare triple {2037#true} assume true; {2037#true} is VALID [2018-11-14 17:01:04,417 INFO L273 TraceCheckUtils]: 10: Hoare triple {2037#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4); {2037#true} is VALID [2018-11-14 17:01:04,417 INFO L273 TraceCheckUtils]: 11: Hoare triple {2037#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2037#true} is VALID [2018-11-14 17:01:04,417 INFO L273 TraceCheckUtils]: 12: Hoare triple {2037#true} assume true; {2037#true} is VALID [2018-11-14 17:01:04,417 INFO L273 TraceCheckUtils]: 13: Hoare triple {2037#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4); {2037#true} is VALID [2018-11-14 17:01:04,418 INFO L273 TraceCheckUtils]: 14: Hoare triple {2037#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2037#true} is VALID [2018-11-14 17:01:04,418 INFO L273 TraceCheckUtils]: 15: Hoare triple {2037#true} assume true; {2037#true} is VALID [2018-11-14 17:01:04,418 INFO L273 TraceCheckUtils]: 16: Hoare triple {2037#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4); {2037#true} is VALID [2018-11-14 17:01:04,418 INFO L273 TraceCheckUtils]: 17: Hoare triple {2037#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2037#true} is VALID [2018-11-14 17:01:04,418 INFO L273 TraceCheckUtils]: 18: Hoare triple {2037#true} assume true; {2037#true} is VALID [2018-11-14 17:01:04,419 INFO L273 TraceCheckUtils]: 19: Hoare triple {2037#true} assume !(~i~0 < 100000); {2037#true} is VALID [2018-11-14 17:01:04,419 INFO L273 TraceCheckUtils]: 20: Hoare triple {2037#true} ~i~0 := 0; {2102#(<= main_~i~0 0)} is VALID [2018-11-14 17:01:04,420 INFO L273 TraceCheckUtils]: 21: Hoare triple {2102#(<= main_~i~0 0)} assume true; {2102#(<= main_~i~0 0)} is VALID [2018-11-14 17:01:04,421 INFO L273 TraceCheckUtils]: 22: Hoare triple {2102#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {2102#(<= main_~i~0 0)} is VALID [2018-11-14 17:01:04,421 INFO L273 TraceCheckUtils]: 23: Hoare triple {2102#(<= main_~i~0 0)} assume #t~nondet2 != 0;havoc #t~nondet2;assume -32768 <= #t~nondet3 && #t~nondet3 <= 32767;~k~0 := #t~nondet3;havoc #t~nondet3;call write~int(~k~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(~k~0 * ~k~0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4); {2102#(<= main_~i~0 0)} is VALID [2018-11-14 17:01:04,425 INFO L273 TraceCheckUtils]: 24: Hoare triple {2102#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2115#(<= main_~i~0 1)} is VALID [2018-11-14 17:01:04,425 INFO L273 TraceCheckUtils]: 25: Hoare triple {2115#(<= main_~i~0 1)} assume true; {2115#(<= main_~i~0 1)} is VALID [2018-11-14 17:01:04,426 INFO L273 TraceCheckUtils]: 26: Hoare triple {2115#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {2115#(<= main_~i~0 1)} is VALID [2018-11-14 17:01:04,426 INFO L273 TraceCheckUtils]: 27: Hoare triple {2115#(<= main_~i~0 1)} assume #t~nondet2 != 0;havoc #t~nondet2;assume -32768 <= #t~nondet3 && #t~nondet3 <= 32767;~k~0 := #t~nondet3;havoc #t~nondet3;call write~int(~k~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(~k~0 * ~k~0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4); {2115#(<= main_~i~0 1)} is VALID [2018-11-14 17:01:04,427 INFO L273 TraceCheckUtils]: 28: Hoare triple {2115#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2128#(<= main_~i~0 2)} is VALID [2018-11-14 17:01:04,427 INFO L273 TraceCheckUtils]: 29: Hoare triple {2128#(<= main_~i~0 2)} assume true; {2128#(<= main_~i~0 2)} is VALID [2018-11-14 17:01:04,428 INFO L273 TraceCheckUtils]: 30: Hoare triple {2128#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {2128#(<= main_~i~0 2)} is VALID [2018-11-14 17:01:04,428 INFO L273 TraceCheckUtils]: 31: Hoare triple {2128#(<= main_~i~0 2)} assume #t~nondet2 != 0;havoc #t~nondet2;assume -32768 <= #t~nondet3 && #t~nondet3 <= 32767;~k~0 := #t~nondet3;havoc #t~nondet3;call write~int(~k~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(~k~0 * ~k~0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4); {2128#(<= main_~i~0 2)} is VALID [2018-11-14 17:01:04,429 INFO L273 TraceCheckUtils]: 32: Hoare triple {2128#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2141#(<= main_~i~0 3)} is VALID [2018-11-14 17:01:04,429 INFO L273 TraceCheckUtils]: 33: Hoare triple {2141#(<= main_~i~0 3)} assume true; {2141#(<= main_~i~0 3)} is VALID [2018-11-14 17:01:04,430 INFO L273 TraceCheckUtils]: 34: Hoare triple {2141#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {2141#(<= main_~i~0 3)} is VALID [2018-11-14 17:01:04,436 INFO L273 TraceCheckUtils]: 35: Hoare triple {2141#(<= main_~i~0 3)} assume #t~nondet2 != 0;havoc #t~nondet2;assume -32768 <= #t~nondet3 && #t~nondet3 <= 32767;~k~0 := #t~nondet3;havoc #t~nondet3;call write~int(~k~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(~k~0 * ~k~0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4); {2141#(<= main_~i~0 3)} is VALID [2018-11-14 17:01:04,442 INFO L273 TraceCheckUtils]: 36: Hoare triple {2141#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2154#(<= main_~i~0 4)} is VALID [2018-11-14 17:01:04,443 INFO L273 TraceCheckUtils]: 37: Hoare triple {2154#(<= main_~i~0 4)} assume true; {2154#(<= main_~i~0 4)} is VALID [2018-11-14 17:01:04,443 INFO L273 TraceCheckUtils]: 38: Hoare triple {2154#(<= main_~i~0 4)} assume !(~i~0 < 100000); {2038#false} is VALID [2018-11-14 17:01:04,444 INFO L273 TraceCheckUtils]: 39: Hoare triple {2038#false} ~i~0 := 0; {2038#false} is VALID [2018-11-14 17:01:04,444 INFO L273 TraceCheckUtils]: 40: Hoare triple {2038#false} assume true; {2038#false} is VALID [2018-11-14 17:01:04,444 INFO L273 TraceCheckUtils]: 41: Hoare triple {2038#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);#t~short10 := #t~mem5 == #t~mem6; {2038#false} is VALID [2018-11-14 17:01:04,444 INFO L273 TraceCheckUtils]: 42: Hoare triple {2038#false} assume !#t~short10;call #t~mem9 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);#t~short10 := #t~mem9 == #t~mem7 * #t~mem8; {2038#false} is VALID [2018-11-14 17:01:04,445 INFO L256 TraceCheckUtils]: 43: Hoare triple {2038#false} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {2038#false} is VALID [2018-11-14 17:01:04,445 INFO L273 TraceCheckUtils]: 44: Hoare triple {2038#false} ~cond := #in~cond; {2038#false} is VALID [2018-11-14 17:01:04,445 INFO L273 TraceCheckUtils]: 45: Hoare triple {2038#false} assume ~cond == 0; {2038#false} is VALID [2018-11-14 17:01:04,445 INFO L273 TraceCheckUtils]: 46: Hoare triple {2038#false} assume !false; {2038#false} is VALID [2018-11-14 17:01:04,449 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-14 17:01:04,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:01:04,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-14 17:01:04,483 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2018-11-14 17:01:04,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:01:04,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 17:01:04,568 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:01:04,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 17:01:04,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 17:01:04,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:01:04,569 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 7 states. [2018-11-14 17:01:05,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:01:05,149 INFO L93 Difference]: Finished difference Result 139 states and 171 transitions. [2018-11-14 17:01:05,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:01:05,149 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2018-11-14 17:01:05,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:01:05,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:01:05,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2018-11-14 17:01:05,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:01:05,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2018-11-14 17:01:05,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 134 transitions. [2018-11-14 17:01:05,377 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:01:05,381 INFO L225 Difference]: With dead ends: 139 [2018-11-14 17:01:05,382 INFO L226 Difference]: Without dead ends: 102 [2018-11-14 17:01:05,382 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 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-14 17:01:05,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-14 17:01:05,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 64. [2018-11-14 17:01:05,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:01:05,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand 64 states. [2018-11-14 17:01:05,447 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 64 states. [2018-11-14 17:01:05,447 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 64 states. [2018-11-14 17:01:05,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:01:05,452 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2018-11-14 17:01:05,452 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 126 transitions. [2018-11-14 17:01:05,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:01:05,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:01:05,454 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 102 states. [2018-11-14 17:01:05,454 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 102 states. [2018-11-14 17:01:05,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:01:05,459 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2018-11-14 17:01:05,459 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 126 transitions. [2018-11-14 17:01:05,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:01:05,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:01:05,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:01:05,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:01:05,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-14 17:01:05,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2018-11-14 17:01:05,463 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 47 [2018-11-14 17:01:05,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:01:05,463 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2018-11-14 17:01:05,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 17:01:05,463 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2018-11-14 17:01:05,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-14 17:01:05,464 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:01:05,465 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:01:05,465 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:01:05,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:01:05,465 INFO L82 PathProgramCache]: Analyzing trace with hash 356762250, now seen corresponding path program 4 times [2018-11-14 17:01:05,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:01:05,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:01:05,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:01:05,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:01:05,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:01:05,486 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:01:05,486 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:01:05,486 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:01:05,537 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:01:05,574 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:01:05,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:01:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:01:05,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:01:05,876 INFO L256 TraceCheckUtils]: 0: Hoare triple {2658#true} call ULTIMATE.init(); {2658#true} is VALID [2018-11-14 17:01:05,876 INFO L273 TraceCheckUtils]: 1: Hoare triple {2658#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2658#true} is VALID [2018-11-14 17:01:05,876 INFO L273 TraceCheckUtils]: 2: Hoare triple {2658#true} assume true; {2658#true} is VALID [2018-11-14 17:01:05,876 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2658#true} {2658#true} #77#return; {2658#true} is VALID [2018-11-14 17:01:05,877 INFO L256 TraceCheckUtils]: 4: Hoare triple {2658#true} call #t~ret11 := main(); {2658#true} is VALID [2018-11-14 17:01:05,878 INFO L273 TraceCheckUtils]: 5: Hoare triple {2658#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; {2678#(<= main_~i~0 0)} is VALID [2018-11-14 17:01:05,881 INFO L273 TraceCheckUtils]: 6: Hoare triple {2678#(<= main_~i~0 0)} assume true; {2678#(<= main_~i~0 0)} is VALID [2018-11-14 17:01:05,881 INFO L273 TraceCheckUtils]: 7: Hoare triple {2678#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4); {2678#(<= main_~i~0 0)} is VALID [2018-11-14 17:01:05,883 INFO L273 TraceCheckUtils]: 8: Hoare triple {2678#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2688#(<= main_~i~0 1)} is VALID [2018-11-14 17:01:05,883 INFO L273 TraceCheckUtils]: 9: Hoare triple {2688#(<= main_~i~0 1)} assume true; {2688#(<= main_~i~0 1)} is VALID [2018-11-14 17:01:05,884 INFO L273 TraceCheckUtils]: 10: Hoare triple {2688#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4); {2688#(<= main_~i~0 1)} is VALID [2018-11-14 17:01:05,885 INFO L273 TraceCheckUtils]: 11: Hoare triple {2688#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2698#(<= main_~i~0 2)} is VALID [2018-11-14 17:01:05,885 INFO L273 TraceCheckUtils]: 12: Hoare triple {2698#(<= main_~i~0 2)} assume true; {2698#(<= main_~i~0 2)} is VALID [2018-11-14 17:01:05,886 INFO L273 TraceCheckUtils]: 13: Hoare triple {2698#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4); {2698#(<= main_~i~0 2)} is VALID [2018-11-14 17:01:05,888 INFO L273 TraceCheckUtils]: 14: Hoare triple {2698#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2708#(<= main_~i~0 3)} is VALID [2018-11-14 17:01:05,888 INFO L273 TraceCheckUtils]: 15: Hoare triple {2708#(<= main_~i~0 3)} assume true; {2708#(<= main_~i~0 3)} is VALID [2018-11-14 17:01:05,889 INFO L273 TraceCheckUtils]: 16: Hoare triple {2708#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4); {2708#(<= main_~i~0 3)} is VALID [2018-11-14 17:01:05,890 INFO L273 TraceCheckUtils]: 17: Hoare triple {2708#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2718#(<= main_~i~0 4)} is VALID [2018-11-14 17:01:05,891 INFO L273 TraceCheckUtils]: 18: Hoare triple {2718#(<= main_~i~0 4)} assume true; {2718#(<= main_~i~0 4)} is VALID [2018-11-14 17:01:05,891 INFO L273 TraceCheckUtils]: 19: Hoare triple {2718#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4); {2718#(<= main_~i~0 4)} is VALID [2018-11-14 17:01:05,892 INFO L273 TraceCheckUtils]: 20: Hoare triple {2718#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2728#(<= main_~i~0 5)} is VALID [2018-11-14 17:01:05,893 INFO L273 TraceCheckUtils]: 21: Hoare triple {2728#(<= main_~i~0 5)} assume true; {2728#(<= main_~i~0 5)} is VALID [2018-11-14 17:01:05,894 INFO L273 TraceCheckUtils]: 22: Hoare triple {2728#(<= main_~i~0 5)} assume !(~i~0 < 100000); {2659#false} is VALID [2018-11-14 17:01:05,894 INFO L273 TraceCheckUtils]: 23: Hoare triple {2659#false} ~i~0 := 0; {2659#false} is VALID [2018-11-14 17:01:05,894 INFO L273 TraceCheckUtils]: 24: Hoare triple {2659#false} assume true; {2659#false} is VALID [2018-11-14 17:01:05,895 INFO L273 TraceCheckUtils]: 25: Hoare triple {2659#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {2659#false} is VALID [2018-11-14 17:01:05,895 INFO L273 TraceCheckUtils]: 26: Hoare triple {2659#false} assume #t~nondet2 != 0;havoc #t~nondet2;assume -32768 <= #t~nondet3 && #t~nondet3 <= 32767;~k~0 := #t~nondet3;havoc #t~nondet3;call write~int(~k~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(~k~0 * ~k~0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4); {2659#false} is VALID [2018-11-14 17:01:05,895 INFO L273 TraceCheckUtils]: 27: Hoare triple {2659#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2659#false} is VALID [2018-11-14 17:01:05,895 INFO L273 TraceCheckUtils]: 28: Hoare triple {2659#false} assume true; {2659#false} is VALID [2018-11-14 17:01:05,896 INFO L273 TraceCheckUtils]: 29: Hoare triple {2659#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {2659#false} is VALID [2018-11-14 17:01:05,896 INFO L273 TraceCheckUtils]: 30: Hoare triple {2659#false} assume #t~nondet2 != 0;havoc #t~nondet2;assume -32768 <= #t~nondet3 && #t~nondet3 <= 32767;~k~0 := #t~nondet3;havoc #t~nondet3;call write~int(~k~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(~k~0 * ~k~0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4); {2659#false} is VALID [2018-11-14 17:01:05,896 INFO L273 TraceCheckUtils]: 31: Hoare triple {2659#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2659#false} is VALID [2018-11-14 17:01:05,896 INFO L273 TraceCheckUtils]: 32: Hoare triple {2659#false} assume true; {2659#false} is VALID [2018-11-14 17:01:05,897 INFO L273 TraceCheckUtils]: 33: Hoare triple {2659#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {2659#false} is VALID [2018-11-14 17:01:05,897 INFO L273 TraceCheckUtils]: 34: Hoare triple {2659#false} assume #t~nondet2 != 0;havoc #t~nondet2;assume -32768 <= #t~nondet3 && #t~nondet3 <= 32767;~k~0 := #t~nondet3;havoc #t~nondet3;call write~int(~k~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(~k~0 * ~k~0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4); {2659#false} is VALID [2018-11-14 17:01:05,897 INFO L273 TraceCheckUtils]: 35: Hoare triple {2659#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2659#false} is VALID [2018-11-14 17:01:05,897 INFO L273 TraceCheckUtils]: 36: Hoare triple {2659#false} assume true; {2659#false} is VALID [2018-11-14 17:01:05,897 INFO L273 TraceCheckUtils]: 37: Hoare triple {2659#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {2659#false} is VALID [2018-11-14 17:01:05,898 INFO L273 TraceCheckUtils]: 38: Hoare triple {2659#false} assume #t~nondet2 != 0;havoc #t~nondet2;assume -32768 <= #t~nondet3 && #t~nondet3 <= 32767;~k~0 := #t~nondet3;havoc #t~nondet3;call write~int(~k~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(~k~0 * ~k~0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4); {2659#false} is VALID [2018-11-14 17:01:05,898 INFO L273 TraceCheckUtils]: 39: Hoare triple {2659#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2659#false} is VALID [2018-11-14 17:01:05,898 INFO L273 TraceCheckUtils]: 40: Hoare triple {2659#false} assume true; {2659#false} is VALID [2018-11-14 17:01:05,898 INFO L273 TraceCheckUtils]: 41: Hoare triple {2659#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {2659#false} is VALID [2018-11-14 17:01:05,899 INFO L273 TraceCheckUtils]: 42: Hoare triple {2659#false} assume #t~nondet2 != 0;havoc #t~nondet2;assume -32768 <= #t~nondet3 && #t~nondet3 <= 32767;~k~0 := #t~nondet3;havoc #t~nondet3;call write~int(~k~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(~k~0 * ~k~0, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4); {2659#false} is VALID [2018-11-14 17:01:05,899 INFO L273 TraceCheckUtils]: 43: Hoare triple {2659#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2659#false} is VALID [2018-11-14 17:01:05,899 INFO L273 TraceCheckUtils]: 44: Hoare triple {2659#false} assume true; {2659#false} is VALID [2018-11-14 17:01:05,899 INFO L273 TraceCheckUtils]: 45: Hoare triple {2659#false} assume !(~i~0 < 100000); {2659#false} is VALID [2018-11-14 17:01:05,900 INFO L273 TraceCheckUtils]: 46: Hoare triple {2659#false} ~i~0 := 0; {2659#false} is VALID [2018-11-14 17:01:05,900 INFO L273 TraceCheckUtils]: 47: Hoare triple {2659#false} assume true; {2659#false} is VALID [2018-11-14 17:01:05,900 INFO L273 TraceCheckUtils]: 48: Hoare triple {2659#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);#t~short10 := #t~mem5 == #t~mem6; {2659#false} is VALID [2018-11-14 17:01:05,900 INFO L273 TraceCheckUtils]: 49: Hoare triple {2659#false} assume !#t~short10;call #t~mem9 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);#t~short10 := #t~mem9 == #t~mem7 * #t~mem8; {2659#false} is VALID [2018-11-14 17:01:05,900 INFO L256 TraceCheckUtils]: 50: Hoare triple {2659#false} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {2659#false} is VALID [2018-11-14 17:01:05,901 INFO L273 TraceCheckUtils]: 51: Hoare triple {2659#false} ~cond := #in~cond; {2659#false} is VALID [2018-11-14 17:01:05,901 INFO L273 TraceCheckUtils]: 52: Hoare triple {2659#false} assume ~cond == 0; {2659#false} is VALID [2018-11-14 17:01:05,901 INFO L273 TraceCheckUtils]: 53: Hoare triple {2659#false} assume !false; {2659#false} is VALID [2018-11-14 17:01:05,903 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-14 17:01:05,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:01:05,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-14 17:01:05,925 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-11-14 17:01:05,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:01:05,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 17:01:05,957 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:01:05,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 17:01:05,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 17:01:05,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:01:05,958 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand 8 states. [2018-11-14 17:01:06,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:01:06,591 INFO L93 Difference]: Finished difference Result 157 states and 194 transitions. [2018-11-14 17:01:06,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:01:06,592 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-11-14 17:01:06,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:01:06,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:01:06,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2018-11-14 17:01:06,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:01:06,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2018-11-14 17:01:06,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 150 transitions. [2018-11-14 17:01:06,969 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:01:06,972 INFO L225 Difference]: With dead ends: 157 [2018-11-14 17:01:06,972 INFO L226 Difference]: Without dead ends: 116 [2018-11-14 17:01:06,972 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:01:06,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-14 17:01:07,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 71. [2018-11-14 17:01:07,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:01:07,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand 71 states. [2018-11-14 17:01:07,008 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 71 states. [2018-11-14 17:01:07,008 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 71 states. [2018-11-14 17:01:07,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:01:07,014 INFO L93 Difference]: Finished difference Result 116 states and 144 transitions. [2018-11-14 17:01:07,014 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 144 transitions. [2018-11-14 17:01:07,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:01:07,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:01:07,015 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 116 states. [2018-11-14 17:01:07,015 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 116 states. [2018-11-14 17:01:07,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:01:07,020 INFO L93 Difference]: Finished difference Result 116 states and 144 transitions. [2018-11-14 17:01:07,020 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 144 transitions. [2018-11-14 17:01:07,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:01:07,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:01:07,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:01:07,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:01:07,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-14 17:01:07,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2018-11-14 17:01:07,024 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 54 [2018-11-14 17:01:07,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:01:07,024 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2018-11-14 17:01:07,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 17:01:07,024 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2018-11-14 17:01:07,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-14 17:01:07,025 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:01:07,025 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:01:07,026 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:01:07,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:01:07,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1138003474, now seen corresponding path program 5 times [2018-11-14 17:01:07,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:01:07,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:01:07,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:01:07,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:01:07,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:01:07,044 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:01:07,044 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:01:07,044 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:01:07,069 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1