java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:01:48,046 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:01:48,049 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:01:48,067 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:01:48,068 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:01:48,069 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:01:48,070 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:01:48,072 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:01:48,074 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:01:48,075 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:01:48,076 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:01:48,076 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:01:48,077 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:01:48,078 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:01:48,079 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:01:48,080 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:01:48,081 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:01:48,082 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:01:48,084 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:01:48,086 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:01:48,087 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:01:48,088 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:01:48,093 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:01:48,094 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:01:48,094 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:01:48,095 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:01:48,096 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:01:48,097 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:01:48,098 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:01:48,099 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:01:48,099 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:01:48,100 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:01:48,100 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:01:48,100 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:01:48,101 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:01:48,102 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:01:48,102 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:01:48,128 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:01:48,128 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:01:48,129 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:01:48,129 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:01:48,130 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:01:48,130 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:01:48,130 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:01:48,130 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:01:48,131 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:01:48,131 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:01:48,131 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:01:48,131 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:01:48,131 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:01:48,132 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:01:48,132 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:01:48,132 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:01:48,132 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:01:48,132 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:01:48,133 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:01:48,133 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:01:48,133 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:01:48,133 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:01:48,133 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:01:48,134 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:01:48,134 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:01:48,134 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:01:48,134 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:01:48,134 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:01:48,135 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:01:48,135 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:01:48,135 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:01:48,189 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:01:48,206 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:01:48,210 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:01:48,212 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:01:48,212 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:01:48,213 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i [2018-11-23 13:01:48,285 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61958b552/c2083d7324e44d33a6b4b34c89305573/FLAGcd62f15ee [2018-11-23 13:01:48,747 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:01:48,747 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i [2018-11-23 13:01:48,753 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61958b552/c2083d7324e44d33a6b4b34c89305573/FLAGcd62f15ee [2018-11-23 13:01:49,243 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61958b552/c2083d7324e44d33a6b4b34c89305573 [2018-11-23 13:01:49,254 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:01:49,255 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:01:49,256 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:01:49,256 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:01:49,260 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:01:49,262 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:01:49" (1/1) ... [2018-11-23 13:01:49,265 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37975e9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:49, skipping insertion in model container [2018-11-23 13:01:49,265 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:01:49" (1/1) ... [2018-11-23 13:01:49,277 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:01:49,300 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:01:49,578 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:01:49,583 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:01:49,614 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:01:49,638 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:01:49,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:49 WrapperNode [2018-11-23 13:01:49,639 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:01:49,640 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:01:49,640 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:01:49,640 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:01:49,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:49" (1/1) ... [2018-11-23 13:01:49,661 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:49" (1/1) ... [2018-11-23 13:01:49,669 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:01:49,669 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:01:49,669 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:01:49,670 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:01:49,679 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:49" (1/1) ... [2018-11-23 13:01:49,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:49" (1/1) ... [2018-11-23 13:01:49,681 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:49" (1/1) ... [2018-11-23 13:01:49,681 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:49" (1/1) ... [2018-11-23 13:01:49,693 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:49" (1/1) ... [2018-11-23 13:01:49,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:49" (1/1) ... [2018-11-23 13:01:49,712 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:49" (1/1) ... [2018-11-23 13:01:49,714 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:01:49,715 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:01:49,715 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:01:49,715 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:01:49,716 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:01:49,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:01:49,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:01:49,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:01:49,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:01:49,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:01:49,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:01:49,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:01:49,835 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:01:49,835 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:01:49,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:01:49,836 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:01:49,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:01:50,431 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:01:50,432 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 13:01:50,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:01:50 BoogieIcfgContainer [2018-11-23 13:01:50,433 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:01:50,434 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:01:50,434 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:01:50,437 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:01:50,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:01:49" (1/3) ... [2018-11-23 13:01:50,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dbf741e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:01:50, skipping insertion in model container [2018-11-23 13:01:50,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:49" (2/3) ... [2018-11-23 13:01:50,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dbf741e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:01:50, skipping insertion in model container [2018-11-23 13:01:50,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:01:50" (3/3) ... [2018-11-23 13:01:50,441 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort_false-unreach-call_true-termination.i [2018-11-23 13:01:50,451 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:01:50,460 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:01:50,479 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:01:50,512 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:01:50,513 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:01:50,513 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:01:50,513 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:01:50,513 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:01:50,514 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:01:50,514 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:01:50,514 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:01:50,514 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:01:50,531 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-23 13:01:50,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:01:50,537 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:50,538 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:01:50,541 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:01:50,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:50,549 INFO L82 PathProgramCache]: Analyzing trace with hash 342854797, now seen corresponding path program 1 times [2018-11-23 13:01:50,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:50,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:50,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:50,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:50,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:51,010 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-11-23 13:01:51,259 INFO L256 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2018-11-23 13:01:51,263 INFO L273 TraceCheckUtils]: 1: Hoare triple {33#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33#true} is VALID [2018-11-23 13:01:51,263 INFO L273 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2018-11-23 13:01:51,264 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #76#return; {33#true} is VALID [2018-11-23 13:01:51,264 INFO L256 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret9 := main(); {33#true} is VALID [2018-11-23 13:01:51,278 INFO L273 TraceCheckUtils]: 5: Hoare triple {33#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 1; {35#(and (<= main_~j~0 1) (< 0 (+ (div main_~j~0 4294967296) 1)))} is VALID [2018-11-23 13:01:51,281 INFO L273 TraceCheckUtils]: 6: Hoare triple {35#(and (<= main_~j~0 1) (< 0 (+ (div main_~j~0 4294967296) 1)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {36#(<= main_~SIZE~0 (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 1))} is VALID [2018-11-23 13:01:51,283 INFO L273 TraceCheckUtils]: 7: Hoare triple {36#(<= main_~SIZE~0 (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 1))} ~k~0 := 1; {37#(and (= main_~k~0 1) (<= (+ main_~SIZE~0 (* 4294967296 (div main_~k~0 4294967296))) (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 1)))} is VALID [2018-11-23 13:01:51,287 INFO L273 TraceCheckUtils]: 8: Hoare triple {37#(and (= main_~k~0 1) (<= (+ main_~SIZE~0 (* 4294967296 (div main_~k~0 4294967296))) (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 1)))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem7 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {34#false} is VALID [2018-11-23 13:01:51,287 INFO L256 TraceCheckUtils]: 9: Hoare triple {34#false} call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); {34#false} is VALID [2018-11-23 13:01:51,288 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2018-11-23 13:01:51,288 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2018-11-23 13:01:51,288 INFO L273 TraceCheckUtils]: 12: Hoare triple {34#false} assume !false; {34#false} is VALID [2018-11-23 13:01:51,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:01:51,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:01:51,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:01:51,300 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 13:01:51,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:01:51,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:01:51,492 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:51,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:01:51,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:01:51,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:01:51,506 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 5 states. [2018-11-23 13:01:51,818 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-23 13:01:52,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:52,140 INFO L93 Difference]: Finished difference Result 67 states and 92 transitions. [2018-11-23 13:01:52,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:01:52,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 13:01:52,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:01:52,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:01:52,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2018-11-23 13:01:52,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:01:52,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2018-11-23 13:01:52,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 92 transitions. [2018-11-23 13:01:52,691 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:52,705 INFO L225 Difference]: With dead ends: 67 [2018-11-23 13:01:52,705 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 13:01:52,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:01:52,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 13:01:52,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2018-11-23 13:01:52,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:01:52,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 26 states. [2018-11-23 13:01:52,767 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 26 states. [2018-11-23 13:01:52,767 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 26 states. [2018-11-23 13:01:52,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:52,773 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2018-11-23 13:01:52,773 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2018-11-23 13:01:52,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:52,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:52,774 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 33 states. [2018-11-23 13:01:52,774 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 33 states. [2018-11-23 13:01:52,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:52,779 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2018-11-23 13:01:52,780 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2018-11-23 13:01:52,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:52,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:52,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:01:52,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:01:52,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:01:52,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-23 13:01:52,786 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 13 [2018-11-23 13:01:52,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:01:52,787 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-23 13:01:52,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:01:52,787 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 13:01:52,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:01:52,788 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:52,788 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:01:52,789 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:01:52,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:52,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1336061280, now seen corresponding path program 1 times [2018-11-23 13:01:52,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:52,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:52,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:52,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:52,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:53,280 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-23 13:01:53,997 INFO L256 TraceCheckUtils]: 0: Hoare triple {230#true} call ULTIMATE.init(); {230#true} is VALID [2018-11-23 13:01:53,998 INFO L273 TraceCheckUtils]: 1: Hoare triple {230#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {230#true} is VALID [2018-11-23 13:01:53,998 INFO L273 TraceCheckUtils]: 2: Hoare triple {230#true} assume true; {230#true} is VALID [2018-11-23 13:01:53,999 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {230#true} {230#true} #76#return; {230#true} is VALID [2018-11-23 13:01:53,999 INFO L256 TraceCheckUtils]: 4: Hoare triple {230#true} call #t~ret9 := main(); {230#true} is VALID [2018-11-23 13:01:54,001 INFO L273 TraceCheckUtils]: 5: Hoare triple {230#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 1; {232#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0))} is VALID [2018-11-23 13:01:54,002 INFO L273 TraceCheckUtils]: 6: Hoare triple {232#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem2 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~j~0 - 1; {233#(and (= 0 (+ (* 4 main_~i~0) |main_~#v~0.offset|)) (= |main_~#v~0.offset| 0) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)))} is VALID [2018-11-23 13:01:54,006 INFO L273 TraceCheckUtils]: 7: Hoare triple {233#(and (= 0 (+ (* 4 main_~i~0) |main_~#v~0.offset|)) (= |main_~#v~0.offset| 0) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)))} #t~short4 := ~i~0 >= 0; {233#(and (= 0 (+ (* 4 main_~i~0) |main_~#v~0.offset|)) (= |main_~#v~0.offset| 0) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)))} is VALID [2018-11-23 13:01:54,007 INFO L273 TraceCheckUtils]: 8: Hoare triple {233#(and (= 0 (+ (* 4 main_~i~0) |main_~#v~0.offset|)) (= |main_~#v~0.offset| 0) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)))} assume #t~short4;call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short4 := #t~mem3 > ~key~0; {234#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (or |main_#t~short4| (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0))) main_~key~0)) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)))} is VALID [2018-11-23 13:01:54,008 INFO L273 TraceCheckUtils]: 9: Hoare triple {234#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (or |main_#t~short4| (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0))) main_~key~0)) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)))} assume !#t~short4;havoc #t~short4;havoc #t~mem3; {235#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0))) main_~key~0))} is VALID [2018-11-23 13:01:54,011 INFO L273 TraceCheckUtils]: 10: Hoare triple {235#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0))) main_~key~0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {236#(and (<= main_~j~0 1) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~j~0)))) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0))} is VALID [2018-11-23 13:01:54,019 INFO L273 TraceCheckUtils]: 11: Hoare triple {236#(and (<= main_~j~0 1) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~j~0)))) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {237#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} is VALID [2018-11-23 13:01:54,021 INFO L273 TraceCheckUtils]: 12: Hoare triple {237#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {237#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} is VALID [2018-11-23 13:01:54,021 INFO L273 TraceCheckUtils]: 13: Hoare triple {237#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} ~k~0 := 1; {238#(and (= main_~k~0 1) (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0)))))} is VALID [2018-11-23 13:01:54,025 INFO L273 TraceCheckUtils]: 14: Hoare triple {238#(and (= main_~k~0 1) (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0)))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem7 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {239#(<= |main_#t~mem7| |main_#t~mem8|)} is VALID [2018-11-23 13:01:54,026 INFO L256 TraceCheckUtils]: 15: Hoare triple {239#(<= |main_#t~mem7| |main_#t~mem8|)} call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); {240#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:01:54,027 INFO L273 TraceCheckUtils]: 16: Hoare triple {240#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {241#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:01:54,027 INFO L273 TraceCheckUtils]: 17: Hoare triple {241#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {231#false} is VALID [2018-11-23 13:01:54,028 INFO L273 TraceCheckUtils]: 18: Hoare triple {231#false} assume !false; {231#false} is VALID [2018-11-23 13:01:54,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:01:54,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:01:54,032 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:01:54,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:54,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:54,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:54,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:01:54,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-23 13:01:54,723 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:54,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-11-23 13:01:54,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:54,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:54,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:01:54,840 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-11-23 13:01:54,844 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:01:54,845 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_10|, main_~i~0, main_~key~0]. (let ((.cse0 (select |v_#memory_int_10| |main_~#v~0.base|)) (.cse1 (* 4 main_~i~0))) (and (<= (select .cse0 (+ .cse1 |main_~#v~0.offset|)) main_~key~0) (<= 0 main_~i~0) (= |#memory_int| (store |v_#memory_int_10| |main_~#v~0.base| (store .cse0 (+ .cse1 |main_~#v~0.offset| 4) main_~key~0))) (= |main_~#v~0.offset| 0) (<= main_~i~0 0))) [2018-11-23 13:01:54,845 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~i~0]. (and (<= 0 main_~i~0) (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (let ((.cse0 (select |#memory_int| |main_~#v~0.base|)) (.cse1 (* 4 main_~i~0))) (<= (select .cse0 (+ .cse1 |main_~#v~0.offset|)) (select .cse0 (+ .cse1 |main_~#v~0.offset| 4))))) [2018-11-23 13:01:54,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-11-23 13:01:54,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-23 13:01:54,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:54,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:54,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:54,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-23 13:01:54,980 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:01:54,980 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#v~0.base|]. (let ((.cse2 (select |#memory_int| |main_~#v~0.base|))) (let ((.cse0 (select .cse2 4)) (.cse1 (select .cse2 0))) (and (<= .cse0 |main_#t~mem8|) (<= .cse1 .cse0) (<= |main_#t~mem7| .cse1)))) [2018-11-23 13:01:54,980 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (<= |main_#t~mem7| |main_#t~mem8|) [2018-11-23 13:01:55,024 INFO L256 TraceCheckUtils]: 0: Hoare triple {230#true} call ULTIMATE.init(); {230#true} is VALID [2018-11-23 13:01:55,024 INFO L273 TraceCheckUtils]: 1: Hoare triple {230#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {230#true} is VALID [2018-11-23 13:01:55,025 INFO L273 TraceCheckUtils]: 2: Hoare triple {230#true} assume true; {230#true} is VALID [2018-11-23 13:01:55,025 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {230#true} {230#true} #76#return; {230#true} is VALID [2018-11-23 13:01:55,025 INFO L256 TraceCheckUtils]: 4: Hoare triple {230#true} call #t~ret9 := main(); {230#true} is VALID [2018-11-23 13:01:55,026 INFO L273 TraceCheckUtils]: 5: Hoare triple {230#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 1; {260#(and (<= main_~j~0 1) (= |main_~#v~0.offset| 0))} is VALID [2018-11-23 13:01:55,027 INFO L273 TraceCheckUtils]: 6: Hoare triple {260#(and (<= main_~j~0 1) (= |main_~#v~0.offset| 0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem2 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~j~0 - 1; {264#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0))} is VALID [2018-11-23 13:01:55,028 INFO L273 TraceCheckUtils]: 7: Hoare triple {264#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0))} #t~short4 := ~i~0 >= 0; {268#(and (or (and (<= 0 main_~i~0) |main_#t~short4|) (and (not |main_#t~short4|) (< main_~i~0 0))) (= |main_~#v~0.offset| 0) (<= main_~i~0 0))} is VALID [2018-11-23 13:01:55,042 INFO L273 TraceCheckUtils]: 8: Hoare triple {268#(and (or (and (<= 0 main_~i~0) |main_#t~short4|) (and (not |main_#t~short4|) (< main_~i~0 0))) (= |main_~#v~0.offset| 0) (<= main_~i~0 0))} assume #t~short4;call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short4 := #t~mem3 > ~key~0; {272#(and (<= 0 main_~i~0) (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset|)) main_~key~0) |main_#t~short4|))} is VALID [2018-11-23 13:01:55,043 INFO L273 TraceCheckUtils]: 9: Hoare triple {272#(and (<= 0 main_~i~0) (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset|)) main_~key~0) |main_#t~short4|))} assume !#t~short4;havoc #t~short4;havoc #t~mem3; {276#(and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset|)) main_~key~0) (<= 0 main_~i~0) (= |main_~#v~0.offset| 0) (<= main_~i~0 0))} is VALID [2018-11-23 13:01:55,044 INFO L273 TraceCheckUtils]: 10: Hoare triple {276#(and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset|)) main_~key~0) (<= 0 main_~i~0) (= |main_~#v~0.offset| 0) (<= main_~i~0 0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {237#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} is VALID [2018-11-23 13:01:55,045 INFO L273 TraceCheckUtils]: 11: Hoare triple {237#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {237#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} is VALID [2018-11-23 13:01:55,046 INFO L273 TraceCheckUtils]: 12: Hoare triple {237#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {237#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} is VALID [2018-11-23 13:01:55,047 INFO L273 TraceCheckUtils]: 13: Hoare triple {237#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} ~k~0 := 1; {238#(and (= main_~k~0 1) (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0)))))} is VALID [2018-11-23 13:01:55,048 INFO L273 TraceCheckUtils]: 14: Hoare triple {238#(and (= main_~k~0 1) (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0)))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem7 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {239#(<= |main_#t~mem7| |main_#t~mem8|)} is VALID [2018-11-23 13:01:55,049 INFO L256 TraceCheckUtils]: 15: Hoare triple {239#(<= |main_#t~mem7| |main_#t~mem8|)} call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); {240#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:01:55,050 INFO L273 TraceCheckUtils]: 16: Hoare triple {240#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {241#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:01:55,051 INFO L273 TraceCheckUtils]: 17: Hoare triple {241#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {231#false} is VALID [2018-11-23 13:01:55,051 INFO L273 TraceCheckUtils]: 18: Hoare triple {231#false} assume !false; {231#false} is VALID [2018-11-23 13:01:55,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:01:55,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:01:55,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-11-23 13:01:55,087 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 19 [2018-11-23 13:01:55,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:01:55,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 13:01:55,131 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:55,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 13:01:55,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 13:01:55,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:01:55,133 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 17 states. [2018-11-23 13:01:57,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:57,188 INFO L93 Difference]: Finished difference Result 86 states and 109 transitions. [2018-11-23 13:01:57,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 13:01:57,189 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 19 [2018-11-23 13:01:57,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:01:57,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:01:57,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 109 transitions. [2018-11-23 13:01:57,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:01:57,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 109 transitions. [2018-11-23 13:01:57,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 109 transitions. [2018-11-23 13:01:57,370 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:57,374 INFO L225 Difference]: With dead ends: 86 [2018-11-23 13:01:57,374 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 13:01:57,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2018-11-23 13:01:57,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 13:01:57,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 44. [2018-11-23 13:01:57,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:01:57,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 44 states. [2018-11-23 13:01:57,440 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 44 states. [2018-11-23 13:01:57,440 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 44 states. [2018-11-23 13:01:57,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:57,447 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2018-11-23 13:01:57,447 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2018-11-23 13:01:57,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:57,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:57,448 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 67 states. [2018-11-23 13:01:57,448 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 67 states. [2018-11-23 13:01:57,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:57,454 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2018-11-23 13:01:57,454 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2018-11-23 13:01:57,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:57,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:57,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:01:57,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:01:57,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 13:01:57,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-11-23 13:01:57,459 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 19 [2018-11-23 13:01:57,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:01:57,459 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-11-23 13:01:57,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 13:01:57,460 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-23 13:01:57,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 13:01:57,461 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:57,461 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:01:57,461 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:01:57,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:57,462 INFO L82 PathProgramCache]: Analyzing trace with hash -455852680, now seen corresponding path program 1 times [2018-11-23 13:01:57,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:57,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:57,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:57,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:57,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:58,933 INFO L256 TraceCheckUtils]: 0: Hoare triple {632#true} call ULTIMATE.init(); {632#true} is VALID [2018-11-23 13:01:58,934 INFO L273 TraceCheckUtils]: 1: Hoare triple {632#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {632#true} is VALID [2018-11-23 13:01:58,934 INFO L273 TraceCheckUtils]: 2: Hoare triple {632#true} assume true; {632#true} is VALID [2018-11-23 13:01:58,934 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {632#true} {632#true} #76#return; {632#true} is VALID [2018-11-23 13:01:58,934 INFO L256 TraceCheckUtils]: 4: Hoare triple {632#true} call #t~ret9 := main(); {632#true} is VALID [2018-11-23 13:01:58,939 INFO L273 TraceCheckUtils]: 5: Hoare triple {632#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 1; {634#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0))} is VALID [2018-11-23 13:01:58,943 INFO L273 TraceCheckUtils]: 6: Hoare triple {634#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem2 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~j~0 - 1; {635#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)))} is VALID [2018-11-23 13:01:58,944 INFO L273 TraceCheckUtils]: 7: Hoare triple {635#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)))} #t~short4 := ~i~0 >= 0; {636#(and (= |main_~#v~0.offset| 0) (or (and (<= main_~j~0 1) (<= 1 main_~j~0) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4))) (not |main_#t~short4|)))} is VALID [2018-11-23 13:01:58,945 INFO L273 TraceCheckUtils]: 8: Hoare triple {636#(and (= |main_~#v~0.offset| 0) (or (and (<= main_~j~0 1) (<= 1 main_~j~0) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4))) (not |main_#t~short4|)))} assume #t~short4;call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short4 := #t~mem3 > ~key~0; {637#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (or (not |main_#t~short4|) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0))))) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)))} is VALID [2018-11-23 13:01:58,962 INFO L273 TraceCheckUtils]: 9: Hoare triple {637#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (or (not |main_#t~short4|) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0))))) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)))} assume !!#t~short4;havoc #t~short4;havoc #t~mem3; {638#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0)))) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)))} is VALID [2018-11-23 13:01:58,976 INFO L273 TraceCheckUtils]: 10: Hoare triple {638#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0)))) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)))} assume ~i~0 < 2;call #t~mem5 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem5; {639#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0) 4))) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)))} is VALID [2018-11-23 13:01:58,985 INFO L273 TraceCheckUtils]: 11: Hoare triple {639#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0) 4))) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)))} ~i~0 := ~i~0 - 1; {640#(and (= |main_~#v~0.offset| 0) (or (and (<= main_~j~0 1) (<= 1 main_~j~0) (<= (+ main_~key~0 1) (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset| 4) main_~key~0) (+ |main_~#v~0.offset| (* 4 main_~j~0))))) (not (= (+ (* 4 main_~i~0) |main_~#v~0.offset| 4) 0))) (< 0 (+ (* 4 main_~i~0) |main_~#v~0.offset| 5)))} is VALID [2018-11-23 13:01:58,999 INFO L273 TraceCheckUtils]: 12: Hoare triple {640#(and (= |main_~#v~0.offset| 0) (or (and (<= main_~j~0 1) (<= 1 main_~j~0) (<= (+ main_~key~0 1) (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset| 4) main_~key~0) (+ |main_~#v~0.offset| (* 4 main_~j~0))))) (not (= (+ (* 4 main_~i~0) |main_~#v~0.offset| 4) 0))) (< 0 (+ (* 4 main_~i~0) |main_~#v~0.offset| 5)))} #t~short4 := ~i~0 >= 0; {641#(and (= |main_~#v~0.offset| 0) (or (and (<= main_~j~0 1) (<= 1 main_~j~0) (<= (+ main_~key~0 1) (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset| 4) main_~key~0) (+ |main_~#v~0.offset| (* 4 main_~j~0))))) (not (= (+ (* 4 main_~i~0) |main_~#v~0.offset| 4) 0))) (or |main_#t~short4| (and (< 0 (+ (* 4 main_~i~0) |main_~#v~0.offset| 5)) (<= (+ main_~i~0 1) 0))))} is VALID [2018-11-23 13:01:59,008 INFO L273 TraceCheckUtils]: 13: Hoare triple {641#(and (= |main_~#v~0.offset| 0) (or (and (<= main_~j~0 1) (<= 1 main_~j~0) (<= (+ main_~key~0 1) (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset| 4) main_~key~0) (+ |main_~#v~0.offset| (* 4 main_~j~0))))) (not (= (+ (* 4 main_~i~0) |main_~#v~0.offset| 4) 0))) (or |main_#t~short4| (and (< 0 (+ (* 4 main_~i~0) |main_~#v~0.offset| 5)) (<= (+ main_~i~0 1) 0))))} assume !#t~short4; {642#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (<= (+ main_~key~0 1) (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset| 4) main_~key~0) (+ |main_~#v~0.offset| (* 4 main_~j~0)))) (< 0 (+ (* 4 main_~i~0) |main_~#v~0.offset| 5)) (<= (+ main_~i~0 1) 0))} is VALID [2018-11-23 13:01:59,021 INFO L273 TraceCheckUtils]: 14: Hoare triple {642#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (<= (+ main_~key~0 1) (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset| 4) main_~key~0) (+ |main_~#v~0.offset| (* 4 main_~j~0)))) (< 0 (+ (* 4 main_~i~0) |main_~#v~0.offset| 5)) (<= (+ main_~i~0 1) 0))} assume !#t~short4;havoc #t~short4;havoc #t~mem3; {642#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (<= (+ main_~key~0 1) (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset| 4) main_~key~0) (+ |main_~#v~0.offset| (* 4 main_~j~0)))) (< 0 (+ (* 4 main_~i~0) |main_~#v~0.offset| 5)) (<= (+ main_~i~0 1) 0))} is VALID [2018-11-23 13:01:59,034 INFO L273 TraceCheckUtils]: 15: Hoare triple {642#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (<= (+ main_~key~0 1) (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset| 4) main_~key~0) (+ |main_~#v~0.offset| (* 4 main_~j~0)))) (< 0 (+ (* 4 main_~i~0) |main_~#v~0.offset| 5)) (<= (+ main_~i~0 1) 0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {643#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~j~0)))))} is VALID [2018-11-23 13:01:59,047 INFO L273 TraceCheckUtils]: 16: Hoare triple {643#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~j~0)))))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {644#(and (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))) (= |main_~#v~0.offset| 0))} is VALID [2018-11-23 13:01:59,060 INFO L273 TraceCheckUtils]: 17: Hoare triple {644#(and (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))) (= |main_~#v~0.offset| 0))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {644#(and (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))) (= |main_~#v~0.offset| 0))} is VALID [2018-11-23 13:01:59,080 INFO L273 TraceCheckUtils]: 18: Hoare triple {644#(and (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))) (= |main_~#v~0.offset| 0))} ~k~0 := 1; {645#(and (= main_~k~0 1) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0) (- 4))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0)))) (= |main_~#v~0.offset| 0))} is VALID [2018-11-23 13:01:59,089 INFO L273 TraceCheckUtils]: 19: Hoare triple {645#(and (= main_~k~0 1) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0) (- 4))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0)))) (= |main_~#v~0.offset| 0))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem7 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {646#(<= (+ |main_#t~mem7| 1) |main_#t~mem8|)} is VALID [2018-11-23 13:01:59,102 INFO L256 TraceCheckUtils]: 20: Hoare triple {646#(<= (+ |main_#t~mem7| 1) |main_#t~mem8|)} call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); {647#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:01:59,115 INFO L273 TraceCheckUtils]: 21: Hoare triple {647#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {648#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:01:59,127 INFO L273 TraceCheckUtils]: 22: Hoare triple {648#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {633#false} is VALID [2018-11-23 13:01:59,127 INFO L273 TraceCheckUtils]: 23: Hoare triple {633#false} assume !false; {633#false} is VALID [2018-11-23 13:01:59,131 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:01:59,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:01:59,131 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:01:59,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:59,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:01:59,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-11-23 13:01:59,476 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:59,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 47 [2018-11-23 13:01:59,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:59,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:59,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:59,498 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-11-23 13:01:59,814 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:59,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-11-23 13:01:59,826 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:59,828 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:59,829 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:01:59,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 72 [2018-11-23 13:01:59,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:59,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:59,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:01:59,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2018-11-23 13:01:59,876 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:01:59,876 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_12|, main_~i~0, main_~key~0, v_main_~i~0_10]. (let ((.cse1 (select |v_#memory_int_12| |main_~#v~0.base|)) (.cse2 (* 4 v_main_~i~0_10))) (let ((.cse0 (select .cse1 (+ |main_~#v~0.offset| .cse2)))) (and (<= 0 v_main_~i~0_10) (= .cse0 (select .cse1 (+ |main_~#v~0.offset| .cse2 4))) (<= (+ main_~key~0 1) .cse0) (= (store |v_#memory_int_12| |main_~#v~0.base| (store .cse1 (+ (* 4 main_~i~0) |main_~#v~0.offset| 4) main_~key~0)) |#memory_int|) (<= v_main_~i~0_10 0) (<= v_main_~i~0_10 (+ main_~i~0 1)) (< main_~i~0 0)))) [2018-11-23 13:01:59,876 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~i~0_10]. (and (<= 0 v_main_~i~0_10) (<= v_main_~i~0_10 0) (let ((.cse0 (select |#memory_int| |main_~#v~0.base|)) (.cse1 (* 4 v_main_~i~0_10))) (<= (+ (select .cse0 (+ |main_~#v~0.offset| .cse1)) 1) (select .cse0 (+ |main_~#v~0.offset| .cse1 4))))) [2018-11-23 13:02:00,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-11-23 13:02:00,182 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:02:00,183 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:02:00,184 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:02:00,185 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:02:00,204 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:02:00,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 49 [2018-11-23 13:02:00,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:02:00,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:02:00,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:02:00,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-11-23 13:02:00,254 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:02:00,254 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#v~0.base|, |main_~#v~0.offset|, v_main_~i~0_10]. (let ((.cse0 (select |#memory_int| |main_~#v~0.base|))) (and (<= 0 v_main_~i~0_10) (<= v_main_~i~0_10 0) (<= |main_#t~mem7| (select .cse0 |main_~#v~0.offset|)) (let ((.cse1 (* 4 v_main_~i~0_10))) (<= (+ (select .cse0 (+ |main_~#v~0.offset| .cse1)) 1) (select .cse0 (+ |main_~#v~0.offset| .cse1 4)))) (<= (select .cse0 (+ |main_~#v~0.offset| 4)) |main_#t~mem8|))) [2018-11-23 13:02:00,254 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (<= (+ |main_#t~mem7| 1) |main_#t~mem8|) [2018-11-23 13:02:00,281 INFO L256 TraceCheckUtils]: 0: Hoare triple {632#true} call ULTIMATE.init(); {632#true} is VALID [2018-11-23 13:02:00,282 INFO L273 TraceCheckUtils]: 1: Hoare triple {632#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {632#true} is VALID [2018-11-23 13:02:00,282 INFO L273 TraceCheckUtils]: 2: Hoare triple {632#true} assume true; {632#true} is VALID [2018-11-23 13:02:00,282 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {632#true} {632#true} #76#return; {632#true} is VALID [2018-11-23 13:02:00,282 INFO L256 TraceCheckUtils]: 4: Hoare triple {632#true} call #t~ret9 := main(); {632#true} is VALID [2018-11-23 13:02:00,283 INFO L273 TraceCheckUtils]: 5: Hoare triple {632#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 1; {667#(<= main_~j~0 1)} is VALID [2018-11-23 13:02:00,284 INFO L273 TraceCheckUtils]: 6: Hoare triple {667#(<= main_~j~0 1)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem2 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~j~0 - 1; {671#(<= main_~i~0 0)} is VALID [2018-11-23 13:02:00,285 INFO L273 TraceCheckUtils]: 7: Hoare triple {671#(<= main_~i~0 0)} #t~short4 := ~i~0 >= 0; {675#(and (or (and (<= 0 main_~i~0) |main_#t~short4|) (and (not |main_#t~short4|) (< main_~i~0 0))) (<= main_~i~0 0))} is VALID [2018-11-23 13:02:00,286 INFO L273 TraceCheckUtils]: 8: Hoare triple {675#(and (or (and (<= 0 main_~i~0) |main_#t~short4|) (and (not |main_#t~short4|) (< main_~i~0 0))) (<= main_~i~0 0))} assume #t~short4;call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short4 := #t~mem3 > ~key~0; {679#(and (<= 0 main_~i~0) (or (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset|))) (not |main_#t~short4|)) (<= main_~i~0 0))} is VALID [2018-11-23 13:02:00,286 INFO L273 TraceCheckUtils]: 9: Hoare triple {679#(and (<= 0 main_~i~0) (or (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset|))) (not |main_#t~short4|)) (<= main_~i~0 0))} assume !!#t~short4;havoc #t~short4;havoc #t~mem3; {683#(and (<= 0 main_~i~0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset|))) (<= main_~i~0 0))} is VALID [2018-11-23 13:02:00,288 INFO L273 TraceCheckUtils]: 10: Hoare triple {683#(and (<= 0 main_~i~0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset|))) (<= main_~i~0 0))} assume ~i~0 < 2;call #t~mem5 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem5; {687#(and (<= 0 main_~i~0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset|))) (= (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset|))) (<= main_~i~0 0))} is VALID [2018-11-23 13:02:00,290 INFO L273 TraceCheckUtils]: 11: Hoare triple {687#(and (<= 0 main_~i~0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset|))) (= (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset|))) (<= main_~i~0 0))} ~i~0 := ~i~0 - 1; {691#(exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10)))) (<= v_main_~i~0_10 0) (<= v_main_~i~0_10 (+ main_~i~0 1)) (= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10))))))} is VALID [2018-11-23 13:02:00,294 INFO L273 TraceCheckUtils]: 12: Hoare triple {691#(exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10)))) (<= v_main_~i~0_10 0) (<= v_main_~i~0_10 (+ main_~i~0 1)) (= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10))))))} #t~short4 := ~i~0 >= 0; {695#(or (and (<= 0 main_~i~0) (exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10)))) (<= v_main_~i~0_10 0) (<= v_main_~i~0_10 (+ main_~i~0 1)) (= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10)))))) |main_#t~short4|) (and (exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10)))) (<= v_main_~i~0_10 0) (<= v_main_~i~0_10 (+ main_~i~0 1)) (= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10)))))) (not |main_#t~short4|) (< main_~i~0 0)))} is VALID [2018-11-23 13:02:00,295 INFO L273 TraceCheckUtils]: 13: Hoare triple {695#(or (and (<= 0 main_~i~0) (exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10)))) (<= v_main_~i~0_10 0) (<= v_main_~i~0_10 (+ main_~i~0 1)) (= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10)))))) |main_#t~short4|) (and (exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10)))) (<= v_main_~i~0_10 0) (<= v_main_~i~0_10 (+ main_~i~0 1)) (= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10)))))) (not |main_#t~short4|) (< main_~i~0 0)))} assume !#t~short4; {699#(and (exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10)))) (<= v_main_~i~0_10 0) (<= v_main_~i~0_10 (+ main_~i~0 1)) (= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10)))))) (< main_~i~0 0))} is VALID [2018-11-23 13:02:00,296 INFO L273 TraceCheckUtils]: 14: Hoare triple {699#(and (exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10)))) (<= v_main_~i~0_10 0) (<= v_main_~i~0_10 (+ main_~i~0 1)) (= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10)))))) (< main_~i~0 0))} assume !#t~short4;havoc #t~short4;havoc #t~mem3; {699#(and (exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10)))) (<= v_main_~i~0_10 0) (<= v_main_~i~0_10 (+ main_~i~0 1)) (= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10)))))) (< main_~i~0 0))} is VALID [2018-11-23 13:02:00,298 INFO L273 TraceCheckUtils]: 15: Hoare triple {699#(and (exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10)))) (<= v_main_~i~0_10 0) (<= v_main_~i~0_10 (+ main_~i~0 1)) (= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10)))))) (< main_~i~0 0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {706#(exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= v_main_~i~0_10 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4)))))} is VALID [2018-11-23 13:02:00,298 INFO L273 TraceCheckUtils]: 16: Hoare triple {706#(exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= v_main_~i~0_10 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4)))))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {706#(exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= v_main_~i~0_10 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4)))))} is VALID [2018-11-23 13:02:00,303 INFO L273 TraceCheckUtils]: 17: Hoare triple {706#(exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= v_main_~i~0_10 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4)))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {706#(exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= v_main_~i~0_10 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4)))))} is VALID [2018-11-23 13:02:00,304 INFO L273 TraceCheckUtils]: 18: Hoare triple {706#(exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= v_main_~i~0_10 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4)))))} ~k~0 := 1; {716#(and (= main_~k~0 1) (exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= v_main_~i~0_10 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4))))))} is VALID [2018-11-23 13:02:00,306 INFO L273 TraceCheckUtils]: 19: Hoare triple {716#(and (= main_~k~0 1) (exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= v_main_~i~0_10 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4))))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem7 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {646#(<= (+ |main_#t~mem7| 1) |main_#t~mem8|)} is VALID [2018-11-23 13:02:00,307 INFO L256 TraceCheckUtils]: 20: Hoare triple {646#(<= (+ |main_#t~mem7| 1) |main_#t~mem8|)} call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); {647#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:02:00,308 INFO L273 TraceCheckUtils]: 21: Hoare triple {647#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {648#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:02:00,308 INFO L273 TraceCheckUtils]: 22: Hoare triple {648#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {633#false} is VALID [2018-11-23 13:02:00,309 INFO L273 TraceCheckUtils]: 23: Hoare triple {633#false} assume !false; {633#false} is VALID [2018-11-23 13:02:00,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:00,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:02:00,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 28 [2018-11-23 13:02:00,331 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 24 [2018-11-23 13:02:00,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:00,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 13:02:00,390 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:00,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 13:02:00,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 13:02:00,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2018-11-23 13:02:00,391 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 28 states. [2018-11-23 13:02:03,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:03,807 INFO L93 Difference]: Finished difference Result 130 states and 165 transitions. [2018-11-23 13:02:03,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 13:02:03,807 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 24 [2018-11-23 13:02:03,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:03,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:02:03,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 125 transitions. [2018-11-23 13:02:03,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:02:03,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 125 transitions. [2018-11-23 13:02:03,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 125 transitions. [2018-11-23 13:02:04,012 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:04,017 INFO L225 Difference]: With dead ends: 130 [2018-11-23 13:02:04,017 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 13:02:04,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=260, Invalid=1546, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 13:02:04,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 13:02:04,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 58. [2018-11-23 13:02:04,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:04,159 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 58 states. [2018-11-23 13:02:04,159 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 58 states. [2018-11-23 13:02:04,159 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 58 states. [2018-11-23 13:02:04,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:04,165 INFO L93 Difference]: Finished difference Result 95 states and 114 transitions. [2018-11-23 13:02:04,165 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2018-11-23 13:02:04,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:04,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:04,167 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 95 states. [2018-11-23 13:02:04,167 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 95 states. [2018-11-23 13:02:04,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:04,173 INFO L93 Difference]: Finished difference Result 95 states and 114 transitions. [2018-11-23 13:02:04,173 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2018-11-23 13:02:04,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:04,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:04,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:04,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:04,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 13:02:04,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2018-11-23 13:02:04,178 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 24 [2018-11-23 13:02:04,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:04,178 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2018-11-23 13:02:04,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 13:02:04,178 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2018-11-23 13:02:04,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 13:02:04,180 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:04,180 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:04,180 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:04,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:04,180 INFO L82 PathProgramCache]: Analyzing trace with hash 2042668019, now seen corresponding path program 2 times [2018-11-23 13:02:04,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:04,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:04,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:04,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:04,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:05,030 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: zero is neutral element of plus operator at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:87) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 13:02:05,034 INFO L168 Benchmark]: Toolchain (without parser) took 15779.46 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 855.1 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -230.1 MB). Peak memory consumption was 625.1 MB. Max. memory is 7.1 GB. [2018-11-23 13:02:05,036 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:02:05,037 INFO L168 Benchmark]: CACSL2BoogieTranslator took 383.48 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:02:05,037 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.81 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:02:05,038 INFO L168 Benchmark]: Boogie Preprocessor took 45.02 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:02:05,038 INFO L168 Benchmark]: RCFGBuilder took 718.28 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 726.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -764.6 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2018-11-23 13:02:05,039 INFO L168 Benchmark]: TraceAbstraction took 14598.95 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 128.5 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 524.0 MB). Peak memory consumption was 652.5 MB. Max. memory is 7.1 GB. [2018-11-23 13:02:05,044 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 383.48 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 28.81 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.02 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 718.28 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 726.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -764.6 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14598.95 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 128.5 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 524.0 MB). Peak memory consumption was 652.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: zero is neutral element of plus operator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: zero is neutral element of plus operator: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:87) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...