java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/array-crafted/zero_sum_const1_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:57:21,297 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:57:21,299 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:57:21,315 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:57:21,316 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:57:21,317 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:57:21,318 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:57:21,320 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:57:21,324 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:57:21,325 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:57:21,330 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:57:21,330 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:57:21,331 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:57:21,335 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:57:21,336 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:57:21,337 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:57:21,338 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:57:21,341 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:57:21,343 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:57:21,346 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:57:21,348 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:57:21,349 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:57:21,352 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:57:21,352 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:57:21,352 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:57:21,356 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:57:21,356 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:57:21,359 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:57:21,360 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:57:21,361 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:57:21,361 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:57:21,362 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:57:21,362 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:57:21,362 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:57:21,364 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:57:21,365 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:57:21,365 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 18:57:21,389 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:57:21,389 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:57:21,390 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:57:21,390 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:57:21,395 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:57:21,395 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:57:21,395 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:57:21,395 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:57:21,396 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:57:21,397 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 18:57:21,397 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:57:21,397 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:57:21,397 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:57:21,397 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:57:21,398 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:57:21,398 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:57:21,398 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:57:21,398 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:57:21,398 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:57:21,399 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:57:21,399 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:57:21,399 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:57:21,399 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:57:21,399 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:57:21,401 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:57:21,401 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:57:21,401 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:57:21,401 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 18:57:21,402 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:57:21,402 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 18:57:21,402 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:57:21,451 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:57:21,465 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:57:21,469 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:57:21,471 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:57:21,471 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:57:21,472 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/zero_sum_const1_true-unreach-call.c [2018-11-14 18:57:21,541 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3d9442aa/03a5dc020ed14877bd86e2affb2bcd2a/FLAGa9017501e [2018-11-14 18:57:21,967 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:57:21,968 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/zero_sum_const1_true-unreach-call.c [2018-11-14 18:57:21,974 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3d9442aa/03a5dc020ed14877bd86e2affb2bcd2a/FLAGa9017501e [2018-11-14 18:57:21,989 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3d9442aa/03a5dc020ed14877bd86e2affb2bcd2a [2018-11-14 18:57:21,998 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:57:22,000 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:57:22,001 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:57:22,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:57:22,005 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:57:22,006 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:57:21" (1/1) ... [2018-11-14 18:57:22,013 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5742dfac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:57:22, skipping insertion in model container [2018-11-14 18:57:22,013 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:57:21" (1/1) ... [2018-11-14 18:57:22,023 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:57:22,045 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:57:22,268 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:57:22,273 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:57:22,299 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:57:22,322 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:57:22,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:57:22 WrapperNode [2018-11-14 18:57:22,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:57:22,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:57:22,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:57:22,324 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:57:22,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:57:22" (1/1) ... [2018-11-14 18:57:22,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:57:22" (1/1) ... [2018-11-14 18:57:22,345 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:57:22" (1/1) ... [2018-11-14 18:57:22,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:57:22" (1/1) ... [2018-11-14 18:57:22,354 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:57:22" (1/1) ... [2018-11-14 18:57:22,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:57:22" (1/1) ... [2018-11-14 18:57:22,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:57:22" (1/1) ... [2018-11-14 18:57:22,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:57:22,364 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:57:22,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:57:22,364 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:57:22,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:57:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:57:22,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:57:22,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:57:22,480 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 18:57:22,480 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:57:22,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:57:22,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 18:57:22,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 18:57:22,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2018-11-14 18:57:22,481 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:57:22,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:57:22,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 18:57:22,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 18:57:22,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:57:22,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:57:22,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:57:22,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 18:57:23,028 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:57:23,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:57:23 BoogieIcfgContainer [2018-11-14 18:57:23,029 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:57:23,030 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:57:23,030 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:57:23,034 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:57:23,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:57:21" (1/3) ... [2018-11-14 18:57:23,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aad5e82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:57:23, skipping insertion in model container [2018-11-14 18:57:23,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:57:22" (2/3) ... [2018-11-14 18:57:23,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aad5e82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:57:23, skipping insertion in model container [2018-11-14 18:57:23,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:57:23" (3/3) ... [2018-11-14 18:57:23,037 INFO L112 eAbstractionObserver]: Analyzing ICFG zero_sum_const1_true-unreach-call.c [2018-11-14 18:57:23,047 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:57:23,055 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:57:23,073 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:57:23,105 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:57:23,106 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:57:23,106 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:57:23,106 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:57:23,106 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:57:23,107 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:57:23,107 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:57:23,107 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:57:23,107 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:57:23,126 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-14 18:57:23,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 18:57:23,133 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:57:23,134 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:57:23,136 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:57:23,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:57:23,142 INFO L82 PathProgramCache]: Analyzing trace with hash -968654057, now seen corresponding path program 1 times [2018-11-14 18:57:23,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:57:23,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:57:23,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:57:23,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:57:23,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:57:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:57:23,325 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-14 18:57:23,329 INFO L273 TraceCheckUtils]: 1: Hoare triple {34#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {34#true} is VALID [2018-11-14 18:57:23,329 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-14 18:57:23,329 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #72#return; {34#true} is VALID [2018-11-14 18:57:23,330 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret7 := main(); {34#true} is VALID [2018-11-14 18:57:23,330 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {34#true} is VALID [2018-11-14 18:57:23,330 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~SIZE~0 * 4);~sum~0 := 0;~i~0 := 0; {34#true} is VALID [2018-11-14 18:57:23,331 INFO L273 TraceCheckUtils]: 7: Hoare triple {34#true} assume !true; {35#false} is VALID [2018-11-14 18:57:23,331 INFO L273 TraceCheckUtils]: 8: Hoare triple {35#false} ~i~0 := 0; {35#false} is VALID [2018-11-14 18:57:23,332 INFO L273 TraceCheckUtils]: 9: Hoare triple {35#false} assume !true; {35#false} is VALID [2018-11-14 18:57:23,332 INFO L273 TraceCheckUtils]: 10: Hoare triple {35#false} ~i~0 := 0; {35#false} is VALID [2018-11-14 18:57:23,332 INFO L273 TraceCheckUtils]: 11: Hoare triple {35#false} assume !true; {35#false} is VALID [2018-11-14 18:57:23,333 INFO L256 TraceCheckUtils]: 12: Hoare triple {35#false} call __VERIFIER_assert((if ~sum~0 == 0 then 1 else 0)); {35#false} is VALID [2018-11-14 18:57:23,333 INFO L273 TraceCheckUtils]: 13: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2018-11-14 18:57:23,333 INFO L273 TraceCheckUtils]: 14: Hoare triple {35#false} assume ~cond == 0; {35#false} is VALID [2018-11-14 18:57:23,334 INFO L273 TraceCheckUtils]: 15: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-14 18:57:23,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:57:23,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:57:23,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:57:23,345 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 18:57:23,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:57:23,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:57:23,510 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:57:23,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:57:23,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:57:23,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:57:23,522 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-14 18:57:23,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:23,820 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2018-11-14 18:57:23,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:57:23,823 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 18:57:23,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:57:23,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:57:23,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 64 transitions. [2018-11-14 18:57:23,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:57:23,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 64 transitions. [2018-11-14 18:57:23,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 64 transitions. [2018-11-14 18:57:24,287 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:57:24,299 INFO L225 Difference]: With dead ends: 52 [2018-11-14 18:57:24,299 INFO L226 Difference]: Without dead ends: 23 [2018-11-14 18:57:24,303 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:57:24,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-14 18:57:24,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-14 18:57:24,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:57:24,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2018-11-14 18:57:24,349 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-14 18:57:24,349 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-14 18:57:24,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:24,353 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-14 18:57:24,353 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-14 18:57:24,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:57:24,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:57:24,355 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-14 18:57:24,355 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-14 18:57:24,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:24,359 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-14 18:57:24,359 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-14 18:57:24,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:57:24,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:57:24,360 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:57:24,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:57:24,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 18:57:24,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-14 18:57:24,368 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 16 [2018-11-14 18:57:24,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:57:24,369 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-14 18:57:24,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:57:24,369 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-14 18:57:24,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 18:57:24,373 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:57:24,374 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:57:24,374 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:57:24,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:57:24,375 INFO L82 PathProgramCache]: Analyzing trace with hash 754285424, now seen corresponding path program 1 times [2018-11-14 18:57:24,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:57:24,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:57:24,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:57:24,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:57:24,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:57:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:57:24,542 INFO L256 TraceCheckUtils]: 0: Hoare triple {181#true} call ULTIMATE.init(); {181#true} is VALID [2018-11-14 18:57:24,543 INFO L273 TraceCheckUtils]: 1: Hoare triple {181#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {181#true} is VALID [2018-11-14 18:57:24,543 INFO L273 TraceCheckUtils]: 2: Hoare triple {181#true} assume true; {181#true} is VALID [2018-11-14 18:57:24,543 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {181#true} {181#true} #72#return; {181#true} is VALID [2018-11-14 18:57:24,544 INFO L256 TraceCheckUtils]: 4: Hoare triple {181#true} call #t~ret7 := main(); {181#true} is VALID [2018-11-14 18:57:24,544 INFO L273 TraceCheckUtils]: 5: Hoare triple {181#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {181#true} is VALID [2018-11-14 18:57:24,561 INFO L273 TraceCheckUtils]: 6: Hoare triple {181#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~SIZE~0 * 4);~sum~0 := 0;~i~0 := 0; {183#(= main_~sum~0 0)} is VALID [2018-11-14 18:57:24,576 INFO L273 TraceCheckUtils]: 7: Hoare triple {183#(= main_~sum~0 0)} assume true; {183#(= main_~sum~0 0)} is VALID [2018-11-14 18:57:24,592 INFO L273 TraceCheckUtils]: 8: Hoare triple {183#(= main_~sum~0 0)} assume !(~i~0 < ~SIZE~0); {183#(= main_~sum~0 0)} is VALID [2018-11-14 18:57:24,597 INFO L273 TraceCheckUtils]: 9: Hoare triple {183#(= main_~sum~0 0)} ~i~0 := 0; {183#(= main_~sum~0 0)} is VALID [2018-11-14 18:57:24,604 INFO L273 TraceCheckUtils]: 10: Hoare triple {183#(= main_~sum~0 0)} assume true; {183#(= main_~sum~0 0)} is VALID [2018-11-14 18:57:24,606 INFO L273 TraceCheckUtils]: 11: Hoare triple {183#(= main_~sum~0 0)} assume !(~i~0 < ~SIZE~0); {183#(= main_~sum~0 0)} is VALID [2018-11-14 18:57:24,617 INFO L273 TraceCheckUtils]: 12: Hoare triple {183#(= main_~sum~0 0)} ~i~0 := 0; {183#(= main_~sum~0 0)} is VALID [2018-11-14 18:57:24,619 INFO L273 TraceCheckUtils]: 13: Hoare triple {183#(= main_~sum~0 0)} assume true; {183#(= main_~sum~0 0)} is VALID [2018-11-14 18:57:24,620 INFO L273 TraceCheckUtils]: 14: Hoare triple {183#(= main_~sum~0 0)} assume !(~i~0 < ~SIZE~0); {183#(= main_~sum~0 0)} is VALID [2018-11-14 18:57:24,629 INFO L256 TraceCheckUtils]: 15: Hoare triple {183#(= main_~sum~0 0)} call __VERIFIER_assert((if ~sum~0 == 0 then 1 else 0)); {184#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 18:57:24,630 INFO L273 TraceCheckUtils]: 16: Hoare triple {184#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {185#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 18:57:24,630 INFO L273 TraceCheckUtils]: 17: Hoare triple {185#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {182#false} is VALID [2018-11-14 18:57:24,631 INFO L273 TraceCheckUtils]: 18: Hoare triple {182#false} assume !false; {182#false} is VALID [2018-11-14 18:57:24,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:57:24,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:57:24,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 18:57:24,635 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-14 18:57:24,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:57:24,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:57:24,675 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:57:24,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:57:24,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:57:24,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:57:24,677 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 5 states. [2018-11-14 18:57:25,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:25,292 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-11-14 18:57:25,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:57:25,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-14 18:57:25,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:57:25,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:57:25,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2018-11-14 18:57:25,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:57:25,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2018-11-14 18:57:25,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2018-11-14 18:57:25,363 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:57:25,366 INFO L225 Difference]: With dead ends: 33 [2018-11-14 18:57:25,366 INFO L226 Difference]: Without dead ends: 28 [2018-11-14 18:57:25,367 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:57:25,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-14 18:57:25,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-14 18:57:25,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:57:25,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-14 18:57:25,383 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 18:57:25,383 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 18:57:25,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:25,387 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-14 18:57:25,387 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-14 18:57:25,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:57:25,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:57:25,388 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 18:57:25,388 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 18:57:25,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:25,391 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-14 18:57:25,391 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-14 18:57:25,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:57:25,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:57:25,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:57:25,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:57:25,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 18:57:25,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-14 18:57:25,395 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 19 [2018-11-14 18:57:25,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:57:25,395 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-14 18:57:25,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:57:25,395 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-14 18:57:25,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 18:57:25,396 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:57:25,397 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:57:25,397 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:57:25,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:57:25,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1199501403, now seen corresponding path program 1 times [2018-11-14 18:57:25,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:57:25,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:57:25,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:57:25,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:57:25,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:57:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:57:25,501 INFO L256 TraceCheckUtils]: 0: Hoare triple {331#true} call ULTIMATE.init(); {331#true} is VALID [2018-11-14 18:57:25,502 INFO L273 TraceCheckUtils]: 1: Hoare triple {331#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {331#true} is VALID [2018-11-14 18:57:25,502 INFO L273 TraceCheckUtils]: 2: Hoare triple {331#true} assume true; {331#true} is VALID [2018-11-14 18:57:25,502 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {331#true} {331#true} #72#return; {331#true} is VALID [2018-11-14 18:57:25,503 INFO L256 TraceCheckUtils]: 4: Hoare triple {331#true} call #t~ret7 := main(); {331#true} is VALID [2018-11-14 18:57:25,503 INFO L273 TraceCheckUtils]: 5: Hoare triple {331#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {331#true} is VALID [2018-11-14 18:57:25,504 INFO L273 TraceCheckUtils]: 6: Hoare triple {331#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~SIZE~0 * 4);~sum~0 := 0;~i~0 := 0; {333#(and (<= 2 ~SIZE~0) (= main_~i~0 0))} is VALID [2018-11-14 18:57:25,506 INFO L273 TraceCheckUtils]: 7: Hoare triple {333#(and (<= 2 ~SIZE~0) (= main_~i~0 0))} assume true; {333#(and (<= 2 ~SIZE~0) (= main_~i~0 0))} is VALID [2018-11-14 18:57:25,509 INFO L273 TraceCheckUtils]: 8: Hoare triple {333#(and (<= 2 ~SIZE~0) (= main_~i~0 0))} assume !(~i~0 < ~SIZE~0); {332#false} is VALID [2018-11-14 18:57:25,509 INFO L273 TraceCheckUtils]: 9: Hoare triple {332#false} ~i~0 := 0; {332#false} is VALID [2018-11-14 18:57:25,510 INFO L273 TraceCheckUtils]: 10: Hoare triple {332#false} assume true; {332#false} is VALID [2018-11-14 18:57:25,510 INFO L273 TraceCheckUtils]: 11: Hoare triple {332#false} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~sum~0 := ~sum~0 + #t~mem4;havoc #t~mem4; {332#false} is VALID [2018-11-14 18:57:25,510 INFO L273 TraceCheckUtils]: 12: Hoare triple {332#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {332#false} is VALID [2018-11-14 18:57:25,511 INFO L273 TraceCheckUtils]: 13: Hoare triple {332#false} assume true; {332#false} is VALID [2018-11-14 18:57:25,511 INFO L273 TraceCheckUtils]: 14: Hoare triple {332#false} assume !(~i~0 < ~SIZE~0); {332#false} is VALID [2018-11-14 18:57:25,511 INFO L273 TraceCheckUtils]: 15: Hoare triple {332#false} ~i~0 := 0; {332#false} is VALID [2018-11-14 18:57:25,511 INFO L273 TraceCheckUtils]: 16: Hoare triple {332#false} assume true; {332#false} is VALID [2018-11-14 18:57:25,512 INFO L273 TraceCheckUtils]: 17: Hoare triple {332#false} assume !(~i~0 < ~SIZE~0); {332#false} is VALID [2018-11-14 18:57:25,512 INFO L256 TraceCheckUtils]: 18: Hoare triple {332#false} call __VERIFIER_assert((if ~sum~0 == 0 then 1 else 0)); {332#false} is VALID [2018-11-14 18:57:25,512 INFO L273 TraceCheckUtils]: 19: Hoare triple {332#false} ~cond := #in~cond; {332#false} is VALID [2018-11-14 18:57:25,513 INFO L273 TraceCheckUtils]: 20: Hoare triple {332#false} assume ~cond == 0; {332#false} is VALID [2018-11-14 18:57:25,513 INFO L273 TraceCheckUtils]: 21: Hoare triple {332#false} assume !false; {332#false} is VALID [2018-11-14 18:57:25,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:57:25,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:57:25,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:57:25,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-14 18:57:25,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:57:25,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:57:25,566 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:57:25,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:57:25,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:57:25,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:57:25,568 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 3 states. [2018-11-14 18:57:25,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:25,723 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-11-14 18:57:25,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:57:25,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-14 18:57:25,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:57:25,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:57:25,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2018-11-14 18:57:25,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:57:25,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2018-11-14 18:57:25,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 43 transitions. [2018-11-14 18:57:25,819 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:57:25,821 INFO L225 Difference]: With dead ends: 49 [2018-11-14 18:57:25,821 INFO L226 Difference]: Without dead ends: 31 [2018-11-14 18:57:25,822 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:57:25,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-14 18:57:25,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-14 18:57:25,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:57:25,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 30 states. [2018-11-14 18:57:25,843 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 30 states. [2018-11-14 18:57:25,843 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 30 states. [2018-11-14 18:57:25,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:25,846 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-14 18:57:25,846 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-14 18:57:25,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:57:25,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:57:25,847 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 31 states. [2018-11-14 18:57:25,847 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 31 states. [2018-11-14 18:57:25,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:25,850 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-14 18:57:25,850 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-14 18:57:25,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:57:25,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:57:25,851 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:57:25,851 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:57:25,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 18:57:25,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-11-14 18:57:25,853 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 22 [2018-11-14 18:57:25,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:57:25,853 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-11-14 18:57:25,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:57:25,854 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-14 18:57:25,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 18:57:25,854 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:57:25,855 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:57:25,855 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:57:25,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:57:25,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1481274093, now seen corresponding path program 1 times [2018-11-14 18:57:25,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:57:25,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:57:25,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:57:25,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:57:25,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:57:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:57:26,003 INFO L256 TraceCheckUtils]: 0: Hoare triple {507#true} call ULTIMATE.init(); {507#true} is VALID [2018-11-14 18:57:26,004 INFO L273 TraceCheckUtils]: 1: Hoare triple {507#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {507#true} is VALID [2018-11-14 18:57:26,004 INFO L273 TraceCheckUtils]: 2: Hoare triple {507#true} assume true; {507#true} is VALID [2018-11-14 18:57:26,005 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {507#true} {507#true} #72#return; {507#true} is VALID [2018-11-14 18:57:26,005 INFO L256 TraceCheckUtils]: 4: Hoare triple {507#true} call #t~ret7 := main(); {507#true} is VALID [2018-11-14 18:57:26,005 INFO L273 TraceCheckUtils]: 5: Hoare triple {507#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {507#true} is VALID [2018-11-14 18:57:26,015 INFO L273 TraceCheckUtils]: 6: Hoare triple {507#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~SIZE~0 * 4);~sum~0 := 0;~i~0 := 0; {509#(and (<= 2 ~SIZE~0) (= main_~i~0 0))} is VALID [2018-11-14 18:57:26,020 INFO L273 TraceCheckUtils]: 7: Hoare triple {509#(and (<= 2 ~SIZE~0) (= main_~i~0 0))} assume true; {509#(and (<= 2 ~SIZE~0) (= main_~i~0 0))} is VALID [2018-11-14 18:57:26,030 INFO L273 TraceCheckUtils]: 8: Hoare triple {509#(and (<= 2 ~SIZE~0) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call write~int(1, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {509#(and (<= 2 ~SIZE~0) (= main_~i~0 0))} is VALID [2018-11-14 18:57:26,031 INFO L273 TraceCheckUtils]: 9: Hoare triple {509#(and (<= 2 ~SIZE~0) (= main_~i~0 0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {510#(<= (+ main_~i~0 1) ~SIZE~0)} is VALID [2018-11-14 18:57:26,032 INFO L273 TraceCheckUtils]: 10: Hoare triple {510#(<= (+ main_~i~0 1) ~SIZE~0)} assume true; {510#(<= (+ main_~i~0 1) ~SIZE~0)} is VALID [2018-11-14 18:57:26,033 INFO L273 TraceCheckUtils]: 11: Hoare triple {510#(<= (+ main_~i~0 1) ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {508#false} is VALID [2018-11-14 18:57:26,033 INFO L273 TraceCheckUtils]: 12: Hoare triple {508#false} ~i~0 := 0; {508#false} is VALID [2018-11-14 18:57:26,033 INFO L273 TraceCheckUtils]: 13: Hoare triple {508#false} assume true; {508#false} is VALID [2018-11-14 18:57:26,034 INFO L273 TraceCheckUtils]: 14: Hoare triple {508#false} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~sum~0 := ~sum~0 + #t~mem4;havoc #t~mem4; {508#false} is VALID [2018-11-14 18:57:26,034 INFO L273 TraceCheckUtils]: 15: Hoare triple {508#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {508#false} is VALID [2018-11-14 18:57:26,034 INFO L273 TraceCheckUtils]: 16: Hoare triple {508#false} assume true; {508#false} is VALID [2018-11-14 18:57:26,035 INFO L273 TraceCheckUtils]: 17: Hoare triple {508#false} assume !(~i~0 < ~SIZE~0); {508#false} is VALID [2018-11-14 18:57:26,035 INFO L273 TraceCheckUtils]: 18: Hoare triple {508#false} ~i~0 := 0; {508#false} is VALID [2018-11-14 18:57:26,036 INFO L273 TraceCheckUtils]: 19: Hoare triple {508#false} assume true; {508#false} is VALID [2018-11-14 18:57:26,036 INFO L273 TraceCheckUtils]: 20: Hoare triple {508#false} assume !(~i~0 < ~SIZE~0); {508#false} is VALID [2018-11-14 18:57:26,036 INFO L256 TraceCheckUtils]: 21: Hoare triple {508#false} call __VERIFIER_assert((if ~sum~0 == 0 then 1 else 0)); {508#false} is VALID [2018-11-14 18:57:26,037 INFO L273 TraceCheckUtils]: 22: Hoare triple {508#false} ~cond := #in~cond; {508#false} is VALID [2018-11-14 18:57:26,037 INFO L273 TraceCheckUtils]: 23: Hoare triple {508#false} assume ~cond == 0; {508#false} is VALID [2018-11-14 18:57:26,037 INFO L273 TraceCheckUtils]: 24: Hoare triple {508#false} assume !false; {508#false} is VALID [2018-11-14 18:57:26,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:57:26,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:57:26,039 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-14 18:57:26,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:57:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:57:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:57:26,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:57:26,291 INFO L256 TraceCheckUtils]: 0: Hoare triple {507#true} call ULTIMATE.init(); {507#true} is VALID [2018-11-14 18:57:26,291 INFO L273 TraceCheckUtils]: 1: Hoare triple {507#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {507#true} is VALID [2018-11-14 18:57:26,292 INFO L273 TraceCheckUtils]: 2: Hoare triple {507#true} assume true; {507#true} is VALID [2018-11-14 18:57:26,292 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {507#true} {507#true} #72#return; {507#true} is VALID [2018-11-14 18:57:26,293 INFO L256 TraceCheckUtils]: 4: Hoare triple {507#true} call #t~ret7 := main(); {507#true} is VALID [2018-11-14 18:57:26,293 INFO L273 TraceCheckUtils]: 5: Hoare triple {507#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {507#true} is VALID [2018-11-14 18:57:26,294 INFO L273 TraceCheckUtils]: 6: Hoare triple {507#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~SIZE~0 * 4);~sum~0 := 0;~i~0 := 0; {532#(and (< 1 ~SIZE~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:57:26,294 INFO L273 TraceCheckUtils]: 7: Hoare triple {532#(and (< 1 ~SIZE~0) (<= main_~i~0 0))} assume true; {532#(and (< 1 ~SIZE~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:57:26,295 INFO L273 TraceCheckUtils]: 8: Hoare triple {532#(and (< 1 ~SIZE~0) (<= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call write~int(1, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {532#(and (< 1 ~SIZE~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:57:26,296 INFO L273 TraceCheckUtils]: 9: Hoare triple {532#(and (< 1 ~SIZE~0) (<= main_~i~0 0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {542#(and (< 1 ~SIZE~0) (<= main_~i~0 1))} is VALID [2018-11-14 18:57:26,296 INFO L273 TraceCheckUtils]: 10: Hoare triple {542#(and (< 1 ~SIZE~0) (<= main_~i~0 1))} assume true; {542#(and (< 1 ~SIZE~0) (<= main_~i~0 1))} is VALID [2018-11-14 18:57:26,297 INFO L273 TraceCheckUtils]: 11: Hoare triple {542#(and (< 1 ~SIZE~0) (<= main_~i~0 1))} assume !(~i~0 < ~SIZE~0); {508#false} is VALID [2018-11-14 18:57:26,297 INFO L273 TraceCheckUtils]: 12: Hoare triple {508#false} ~i~0 := 0; {508#false} is VALID [2018-11-14 18:57:26,298 INFO L273 TraceCheckUtils]: 13: Hoare triple {508#false} assume true; {508#false} is VALID [2018-11-14 18:57:26,298 INFO L273 TraceCheckUtils]: 14: Hoare triple {508#false} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~sum~0 := ~sum~0 + #t~mem4;havoc #t~mem4; {508#false} is VALID [2018-11-14 18:57:26,298 INFO L273 TraceCheckUtils]: 15: Hoare triple {508#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {508#false} is VALID [2018-11-14 18:57:26,299 INFO L273 TraceCheckUtils]: 16: Hoare triple {508#false} assume true; {508#false} is VALID [2018-11-14 18:57:26,299 INFO L273 TraceCheckUtils]: 17: Hoare triple {508#false} assume !(~i~0 < ~SIZE~0); {508#false} is VALID [2018-11-14 18:57:26,300 INFO L273 TraceCheckUtils]: 18: Hoare triple {508#false} ~i~0 := 0; {508#false} is VALID [2018-11-14 18:57:26,300 INFO L273 TraceCheckUtils]: 19: Hoare triple {508#false} assume true; {508#false} is VALID [2018-11-14 18:57:26,300 INFO L273 TraceCheckUtils]: 20: Hoare triple {508#false} assume !(~i~0 < ~SIZE~0); {508#false} is VALID [2018-11-14 18:57:26,301 INFO L256 TraceCheckUtils]: 21: Hoare triple {508#false} call __VERIFIER_assert((if ~sum~0 == 0 then 1 else 0)); {508#false} is VALID [2018-11-14 18:57:26,301 INFO L273 TraceCheckUtils]: 22: Hoare triple {508#false} ~cond := #in~cond; {508#false} is VALID [2018-11-14 18:57:26,301 INFO L273 TraceCheckUtils]: 23: Hoare triple {508#false} assume ~cond == 0; {508#false} is VALID [2018-11-14 18:57:26,301 INFO L273 TraceCheckUtils]: 24: Hoare triple {508#false} assume !false; {508#false} is VALID [2018-11-14 18:57:26,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:57:26,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:57:26,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 18:57:26,325 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-11-14 18:57:26,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:57:26,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:57:26,476 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:57:26,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:57:26,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:57:26,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:57:26,477 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 6 states. [2018-11-14 18:57:26,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:26,729 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-11-14 18:57:26,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:57:26,729 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-11-14 18:57:26,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:57:26,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:57:26,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2018-11-14 18:57:26,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:57:26,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2018-11-14 18:57:26,735 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 46 transitions. [2018-11-14 18:57:26,856 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:57:26,859 INFO L225 Difference]: With dead ends: 52 [2018-11-14 18:57:26,859 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 18:57:26,859 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:57:26,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 18:57:26,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-14 18:57:26,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:57:26,876 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-14 18:57:26,876 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-14 18:57:26,877 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-14 18:57:26,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:26,880 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-14 18:57:26,880 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-14 18:57:26,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:57:26,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:57:26,881 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-14 18:57:26,882 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-14 18:57:26,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:26,884 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-14 18:57:26,884 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-14 18:57:26,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:57:26,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:57:26,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:57:26,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:57:26,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 18:57:26,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-14 18:57:26,887 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 25 [2018-11-14 18:57:26,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:57:26,888 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-14 18:57:26,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:57:26,888 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-14 18:57:26,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 18:57:26,889 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:57:26,889 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:57:26,889 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:57:26,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:57:26,890 INFO L82 PathProgramCache]: Analyzing trace with hash -452793691, now seen corresponding path program 2 times [2018-11-14 18:57:26,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:57:26,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:57:26,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:57:26,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:57:26,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:57:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:57:26,994 INFO L256 TraceCheckUtils]: 0: Hoare triple {772#true} call ULTIMATE.init(); {772#true} is VALID [2018-11-14 18:57:26,994 INFO L273 TraceCheckUtils]: 1: Hoare triple {772#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {772#true} is VALID [2018-11-14 18:57:26,995 INFO L273 TraceCheckUtils]: 2: Hoare triple {772#true} assume true; {772#true} is VALID [2018-11-14 18:57:26,995 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {772#true} {772#true} #72#return; {772#true} is VALID [2018-11-14 18:57:26,995 INFO L256 TraceCheckUtils]: 4: Hoare triple {772#true} call #t~ret7 := main(); {772#true} is VALID [2018-11-14 18:57:26,995 INFO L273 TraceCheckUtils]: 5: Hoare triple {772#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {772#true} is VALID [2018-11-14 18:57:27,000 INFO L273 TraceCheckUtils]: 6: Hoare triple {772#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~SIZE~0 * 4);~sum~0 := 0;~i~0 := 0; {774#(<= 2 ~SIZE~0)} is VALID [2018-11-14 18:57:27,001 INFO L273 TraceCheckUtils]: 7: Hoare triple {774#(<= 2 ~SIZE~0)} assume true; {774#(<= 2 ~SIZE~0)} is VALID [2018-11-14 18:57:27,005 INFO L273 TraceCheckUtils]: 8: Hoare triple {774#(<= 2 ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);call write~int(1, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {774#(<= 2 ~SIZE~0)} is VALID [2018-11-14 18:57:27,005 INFO L273 TraceCheckUtils]: 9: Hoare triple {774#(<= 2 ~SIZE~0)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {774#(<= 2 ~SIZE~0)} is VALID [2018-11-14 18:57:27,008 INFO L273 TraceCheckUtils]: 10: Hoare triple {774#(<= 2 ~SIZE~0)} assume true; {774#(<= 2 ~SIZE~0)} is VALID [2018-11-14 18:57:27,008 INFO L273 TraceCheckUtils]: 11: Hoare triple {774#(<= 2 ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);call write~int(1, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {774#(<= 2 ~SIZE~0)} is VALID [2018-11-14 18:57:27,009 INFO L273 TraceCheckUtils]: 12: Hoare triple {774#(<= 2 ~SIZE~0)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {774#(<= 2 ~SIZE~0)} is VALID [2018-11-14 18:57:27,011 INFO L273 TraceCheckUtils]: 13: Hoare triple {774#(<= 2 ~SIZE~0)} assume true; {774#(<= 2 ~SIZE~0)} is VALID [2018-11-14 18:57:27,025 INFO L273 TraceCheckUtils]: 14: Hoare triple {774#(<= 2 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {774#(<= 2 ~SIZE~0)} is VALID [2018-11-14 18:57:27,026 INFO L273 TraceCheckUtils]: 15: Hoare triple {774#(<= 2 ~SIZE~0)} ~i~0 := 0; {775#(and (<= 2 ~SIZE~0) (= main_~i~0 0))} is VALID [2018-11-14 18:57:27,026 INFO L273 TraceCheckUtils]: 16: Hoare triple {775#(and (<= 2 ~SIZE~0) (= main_~i~0 0))} assume true; {775#(and (<= 2 ~SIZE~0) (= main_~i~0 0))} is VALID [2018-11-14 18:57:27,028 INFO L273 TraceCheckUtils]: 17: Hoare triple {775#(and (<= 2 ~SIZE~0) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~sum~0 := ~sum~0 + #t~mem4;havoc #t~mem4; {775#(and (<= 2 ~SIZE~0) (= main_~i~0 0))} is VALID [2018-11-14 18:57:27,029 INFO L273 TraceCheckUtils]: 18: Hoare triple {775#(and (<= 2 ~SIZE~0) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {776#(<= (+ main_~i~0 1) ~SIZE~0)} is VALID [2018-11-14 18:57:27,030 INFO L273 TraceCheckUtils]: 19: Hoare triple {776#(<= (+ main_~i~0 1) ~SIZE~0)} assume true; {776#(<= (+ main_~i~0 1) ~SIZE~0)} is VALID [2018-11-14 18:57:27,033 INFO L273 TraceCheckUtils]: 20: Hoare triple {776#(<= (+ main_~i~0 1) ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {773#false} is VALID [2018-11-14 18:57:27,033 INFO L273 TraceCheckUtils]: 21: Hoare triple {773#false} ~i~0 := 0; {773#false} is VALID [2018-11-14 18:57:27,034 INFO L273 TraceCheckUtils]: 22: Hoare triple {773#false} assume true; {773#false} is VALID [2018-11-14 18:57:27,034 INFO L273 TraceCheckUtils]: 23: Hoare triple {773#false} assume !(~i~0 < ~SIZE~0); {773#false} is VALID [2018-11-14 18:57:27,035 INFO L256 TraceCheckUtils]: 24: Hoare triple {773#false} call __VERIFIER_assert((if ~sum~0 == 0 then 1 else 0)); {773#false} is VALID [2018-11-14 18:57:27,035 INFO L273 TraceCheckUtils]: 25: Hoare triple {773#false} ~cond := #in~cond; {773#false} is VALID [2018-11-14 18:57:27,036 INFO L273 TraceCheckUtils]: 26: Hoare triple {773#false} assume ~cond == 0; {773#false} is VALID [2018-11-14 18:57:27,036 INFO L273 TraceCheckUtils]: 27: Hoare triple {773#false} assume !false; {773#false} is VALID [2018-11-14 18:57:27,038 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-14 18:57:27,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:57:27,038 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-14 18:57:27,059 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:57:27,080 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 18:57:27,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:57:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:57:27,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:57:27,418 INFO L256 TraceCheckUtils]: 0: Hoare triple {772#true} call ULTIMATE.init(); {772#true} is VALID [2018-11-14 18:57:27,418 INFO L273 TraceCheckUtils]: 1: Hoare triple {772#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {772#true} is VALID [2018-11-14 18:57:27,418 INFO L273 TraceCheckUtils]: 2: Hoare triple {772#true} assume true; {772#true} is VALID [2018-11-14 18:57:27,419 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {772#true} {772#true} #72#return; {772#true} is VALID [2018-11-14 18:57:27,419 INFO L256 TraceCheckUtils]: 4: Hoare triple {772#true} call #t~ret7 := main(); {772#true} is VALID [2018-11-14 18:57:27,419 INFO L273 TraceCheckUtils]: 5: Hoare triple {772#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {772#true} is VALID [2018-11-14 18:57:27,429 INFO L273 TraceCheckUtils]: 6: Hoare triple {772#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~SIZE~0 * 4);~sum~0 := 0;~i~0 := 0; {774#(<= 2 ~SIZE~0)} is VALID [2018-11-14 18:57:27,430 INFO L273 TraceCheckUtils]: 7: Hoare triple {774#(<= 2 ~SIZE~0)} assume true; {774#(<= 2 ~SIZE~0)} is VALID [2018-11-14 18:57:27,437 INFO L273 TraceCheckUtils]: 8: Hoare triple {774#(<= 2 ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);call write~int(1, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {774#(<= 2 ~SIZE~0)} is VALID [2018-11-14 18:57:27,439 INFO L273 TraceCheckUtils]: 9: Hoare triple {774#(<= 2 ~SIZE~0)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {774#(<= 2 ~SIZE~0)} is VALID [2018-11-14 18:57:27,439 INFO L273 TraceCheckUtils]: 10: Hoare triple {774#(<= 2 ~SIZE~0)} assume true; {774#(<= 2 ~SIZE~0)} is VALID [2018-11-14 18:57:27,442 INFO L273 TraceCheckUtils]: 11: Hoare triple {774#(<= 2 ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);call write~int(1, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {774#(<= 2 ~SIZE~0)} is VALID [2018-11-14 18:57:27,442 INFO L273 TraceCheckUtils]: 12: Hoare triple {774#(<= 2 ~SIZE~0)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {774#(<= 2 ~SIZE~0)} is VALID [2018-11-14 18:57:27,443 INFO L273 TraceCheckUtils]: 13: Hoare triple {774#(<= 2 ~SIZE~0)} assume true; {774#(<= 2 ~SIZE~0)} is VALID [2018-11-14 18:57:27,443 INFO L273 TraceCheckUtils]: 14: Hoare triple {774#(<= 2 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {774#(<= 2 ~SIZE~0)} is VALID [2018-11-14 18:57:27,445 INFO L273 TraceCheckUtils]: 15: Hoare triple {774#(<= 2 ~SIZE~0)} ~i~0 := 0; {774#(<= 2 ~SIZE~0)} is VALID [2018-11-14 18:57:27,445 INFO L273 TraceCheckUtils]: 16: Hoare triple {774#(<= 2 ~SIZE~0)} assume true; {774#(<= 2 ~SIZE~0)} is VALID [2018-11-14 18:57:27,446 INFO L273 TraceCheckUtils]: 17: Hoare triple {774#(<= 2 ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~sum~0 := ~sum~0 + #t~mem4;havoc #t~mem4; {774#(<= 2 ~SIZE~0)} is VALID [2018-11-14 18:57:27,446 INFO L273 TraceCheckUtils]: 18: Hoare triple {774#(<= 2 ~SIZE~0)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {774#(<= 2 ~SIZE~0)} is VALID [2018-11-14 18:57:27,447 INFO L273 TraceCheckUtils]: 19: Hoare triple {774#(<= 2 ~SIZE~0)} assume true; {774#(<= 2 ~SIZE~0)} is VALID [2018-11-14 18:57:27,448 INFO L273 TraceCheckUtils]: 20: Hoare triple {774#(<= 2 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {774#(<= 2 ~SIZE~0)} is VALID [2018-11-14 18:57:27,449 INFO L273 TraceCheckUtils]: 21: Hoare triple {774#(<= 2 ~SIZE~0)} ~i~0 := 0; {843#(and (<= main_~i~0 0) (<= 2 ~SIZE~0))} is VALID [2018-11-14 18:57:27,450 INFO L273 TraceCheckUtils]: 22: Hoare triple {843#(and (<= main_~i~0 0) (<= 2 ~SIZE~0))} assume true; {843#(and (<= main_~i~0 0) (<= 2 ~SIZE~0))} is VALID [2018-11-14 18:57:27,451 INFO L273 TraceCheckUtils]: 23: Hoare triple {843#(and (<= main_~i~0 0) (<= 2 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {773#false} is VALID [2018-11-14 18:57:27,451 INFO L256 TraceCheckUtils]: 24: Hoare triple {773#false} call __VERIFIER_assert((if ~sum~0 == 0 then 1 else 0)); {773#false} is VALID [2018-11-14 18:57:27,451 INFO L273 TraceCheckUtils]: 25: Hoare triple {773#false} ~cond := #in~cond; {773#false} is VALID [2018-11-14 18:57:27,452 INFO L273 TraceCheckUtils]: 26: Hoare triple {773#false} assume ~cond == 0; {773#false} is VALID [2018-11-14 18:57:27,452 INFO L273 TraceCheckUtils]: 27: Hoare triple {773#false} assume !false; {773#false} is VALID [2018-11-14 18:57:27,454 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-14 18:57:27,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 18:57:27,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2018-11-14 18:57:27,478 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-14 18:57:27,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:57:27,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:57:27,513 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:57:27,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:57:27,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:57:27,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:57:27,514 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 6 states. [2018-11-14 18:57:27,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:27,762 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-11-14 18:57:27,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:57:27,762 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-14 18:57:27,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:57:27,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:57:27,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-11-14 18:57:27,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:57:27,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-11-14 18:57:27,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2018-11-14 18:57:27,916 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:57:27,918 INFO L225 Difference]: With dead ends: 50 [2018-11-14 18:57:27,918 INFO L226 Difference]: Without dead ends: 38 [2018-11-14 18:57:27,919 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:57:27,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-14 18:57:27,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-14 18:57:27,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:57:27,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2018-11-14 18:57:27,949 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-14 18:57:27,950 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-14 18:57:27,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:27,952 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-11-14 18:57:27,952 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-14 18:57:27,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:57:27,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:57:27,954 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-14 18:57:27,954 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-14 18:57:27,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:27,958 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-11-14 18:57:27,958 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-14 18:57:27,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:57:27,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:57:27,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:57:27,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:57:27,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 18:57:27,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-11-14 18:57:27,963 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 28 [2018-11-14 18:57:27,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:57:27,963 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-14 18:57:27,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:57:27,964 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-14 18:57:27,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 18:57:27,965 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:57:27,965 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:57:27,965 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:57:27,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:57:27,966 INFO L82 PathProgramCache]: Analyzing trace with hash 113779024, now seen corresponding path program 1 times [2018-11-14 18:57:27,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:57:27,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:57:27,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:57:27,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:57:27,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:57:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:57:28,818 WARN L179 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2018-11-14 18:57:29,107 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2018-11-14 18:57:30,785 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 25 [2018-11-14 18:57:30,986 INFO L256 TraceCheckUtils]: 0: Hoare triple {1061#true} call ULTIMATE.init(); {1061#true} is VALID [2018-11-14 18:57:30,986 INFO L273 TraceCheckUtils]: 1: Hoare triple {1061#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1061#true} is VALID [2018-11-14 18:57:30,987 INFO L273 TraceCheckUtils]: 2: Hoare triple {1061#true} assume true; {1061#true} is VALID [2018-11-14 18:57:30,987 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1061#true} {1061#true} #72#return; {1061#true} is VALID [2018-11-14 18:57:30,987 INFO L256 TraceCheckUtils]: 4: Hoare triple {1061#true} call #t~ret7 := main(); {1061#true} is VALID [2018-11-14 18:57:30,988 INFO L273 TraceCheckUtils]: 5: Hoare triple {1061#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1061#true} is VALID [2018-11-14 18:57:30,989 INFO L273 TraceCheckUtils]: 6: Hoare triple {1061#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~SIZE~0 * 4);~sum~0 := 0;~i~0 := 0; {1063#(and (or (and (= main_~sum~0 0) (= main_~i~0 0)) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 1) 0)) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:30,990 INFO L273 TraceCheckUtils]: 7: Hoare triple {1063#(and (or (and (= main_~sum~0 0) (= main_~i~0 0)) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 1) 0)) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} assume true; {1063#(and (or (and (= main_~sum~0 0) (= main_~i~0 0)) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 1) 0)) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:30,992 INFO L273 TraceCheckUtils]: 8: Hoare triple {1063#(and (or (and (= main_~sum~0 0) (= main_~i~0 0)) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 1) 0)) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call write~int(1, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1064#(and (or (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 1) 0) (and (= main_~sum~0 0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (= main_~i~0 0))) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:30,994 INFO L273 TraceCheckUtils]: 9: Hoare triple {1064#(and (or (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 1) 0) (and (= main_~sum~0 0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (= main_~i~0 0))) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1065#(and (or (and (= main_~sum~0 0) (<= main_~i~0 1) (= 1 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) 1) 0))) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 5) (* 4 ~SIZE~0))) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:30,995 INFO L273 TraceCheckUtils]: 10: Hoare triple {1065#(and (or (and (= main_~sum~0 0) (<= main_~i~0 1) (= 1 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) 1) 0))) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 5) (* 4 ~SIZE~0))) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} assume true; {1065#(and (or (and (= main_~sum~0 0) (<= main_~i~0 1) (= 1 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) 1) 0))) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 5) (* 4 ~SIZE~0))) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:30,997 INFO L273 TraceCheckUtils]: 11: Hoare triple {1065#(and (or (and (= main_~sum~0 0) (<= main_~i~0 1) (= 1 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) 1) 0))) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 5) (* 4 ~SIZE~0))) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call write~int(1, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1066#(and (or (and (= main_~sum~0 0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) 0)) (<= main_~i~0 1) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))))) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 5) (* 4 ~SIZE~0))) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:30,998 INFO L273 TraceCheckUtils]: 12: Hoare triple {1066#(and (or (and (= main_~sum~0 0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) 0)) (<= main_~i~0 1) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))))) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 5) (* 4 ~SIZE~0))) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1067#(and (or (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) (* 4 ~SIZE~0)) (and (= main_~sum~0 0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 1)))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) 0)) (<= main_~i~0 ~SIZE~0))) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:31,000 INFO L273 TraceCheckUtils]: 13: Hoare triple {1067#(and (or (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) (* 4 ~SIZE~0)) (and (= main_~sum~0 0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 1)))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) 0)) (<= main_~i~0 ~SIZE~0))) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} assume true; {1067#(and (or (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) (* 4 ~SIZE~0)) (and (= main_~sum~0 0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 1)))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) 0)) (<= main_~i~0 ~SIZE~0))) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:31,001 INFO L273 TraceCheckUtils]: 14: Hoare triple {1067#(and (or (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) (* 4 ~SIZE~0)) (and (= main_~sum~0 0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 1)))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) 0)) (<= main_~i~0 ~SIZE~0))) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} assume !(~i~0 < ~SIZE~0); {1068#(and (= main_~sum~0 0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 1)))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) 0)) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:31,002 INFO L273 TraceCheckUtils]: 15: Hoare triple {1068#(and (= main_~sum~0 0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 1)))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) 0)) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {1069#(and (= main_~sum~0 0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 1)))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (<= 2 ~SIZE~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:31,004 INFO L273 TraceCheckUtils]: 16: Hoare triple {1069#(and (= main_~sum~0 0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 1)))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (<= 2 ~SIZE~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume true; {1069#(and (= main_~sum~0 0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 1)))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (<= 2 ~SIZE~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:31,005 INFO L273 TraceCheckUtils]: 17: Hoare triple {1069#(and (= main_~sum~0 0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 1)))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (<= 2 ~SIZE~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~sum~0 := ~sum~0 + #t~mem4;havoc #t~mem4; {1070#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 1)))) (<= main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (<= 2 ~SIZE~0) (= main_~i~0 0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) main_~sum~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:31,007 INFO L273 TraceCheckUtils]: 18: Hoare triple {1070#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 1)))) (<= main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (<= 2 ~SIZE~0) (= main_~i~0 0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) main_~sum~0) (= |main_~#a~0.offset| 0))} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1071#(and (or (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) 1) (<= main_~sum~0 1) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 1)))) (<= 1 main_~sum~0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) 0)) (<= 2 ~SIZE~0)) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 5) (* 4 ~SIZE~0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:31,008 INFO L273 TraceCheckUtils]: 19: Hoare triple {1071#(and (or (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) 1) (<= main_~sum~0 1) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 1)))) (<= 1 main_~sum~0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) 0)) (<= 2 ~SIZE~0)) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 5) (* 4 ~SIZE~0))) (= |main_~#a~0.offset| 0))} assume true; {1071#(and (or (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) 1) (<= main_~sum~0 1) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 1)))) (<= 1 main_~sum~0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) 0)) (<= 2 ~SIZE~0)) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 5) (* 4 ~SIZE~0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:31,014 INFO L273 TraceCheckUtils]: 20: Hoare triple {1071#(and (or (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) 1) (<= main_~sum~0 1) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 1)))) (<= 1 main_~sum~0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) 0)) (<= 2 ~SIZE~0)) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 5) (* 4 ~SIZE~0))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~sum~0 := ~sum~0 + #t~mem4;havoc #t~mem4; {1072#(and (or (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) 1) (<= (+ (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) 1) main_~sum~0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 1)))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) 0)) (<= main_~sum~0 (+ (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) 1)) (<= 2 ~SIZE~0)) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 5) (* 4 ~SIZE~0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:31,015 INFO L273 TraceCheckUtils]: 21: Hoare triple {1072#(and (or (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) 1) (<= (+ (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) 1) main_~sum~0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 1)))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) 0)) (<= main_~sum~0 (+ (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) 1)) (<= 2 ~SIZE~0)) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 5) (* 4 ~SIZE~0))) (= |main_~#a~0.offset| 0))} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1073#(and (or (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 1) (* 4 ~SIZE~0)) (and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 1)))) (<= main_~sum~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) 0)) (<= 2 ~SIZE~0) (<= 2 main_~sum~0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:31,016 INFO L273 TraceCheckUtils]: 22: Hoare triple {1073#(and (or (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 1) (* 4 ~SIZE~0)) (and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 1)))) (<= main_~sum~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) 0)) (<= 2 ~SIZE~0) (<= 2 main_~sum~0))) (= |main_~#a~0.offset| 0))} assume true; {1073#(and (or (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 1) (* 4 ~SIZE~0)) (and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 1)))) (<= main_~sum~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) 0)) (<= 2 ~SIZE~0) (<= 2 main_~sum~0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:31,017 INFO L273 TraceCheckUtils]: 23: Hoare triple {1073#(and (or (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 1) (* 4 ~SIZE~0)) (and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 1)))) (<= main_~sum~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) 0)) (<= 2 ~SIZE~0) (<= 2 main_~sum~0))) (= |main_~#a~0.offset| 0))} assume !(~i~0 < ~SIZE~0); {1074#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 1)))) (<= main_~sum~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) 0)) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0) (<= 2 main_~sum~0))} is VALID [2018-11-14 18:57:31,035 INFO L273 TraceCheckUtils]: 24: Hoare triple {1074#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 1)))) (<= main_~sum~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) 0)) (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0) (<= 2 main_~sum~0))} ~i~0 := 0; {1075#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) 1) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 1)))) (<= main_~sum~0 2) (= |main_~#a~0.offset| 0) (= main_~i~0 0) (<= 2 main_~sum~0))} is VALID [2018-11-14 18:57:31,050 INFO L273 TraceCheckUtils]: 25: Hoare triple {1075#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) 1) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 1)))) (<= main_~sum~0 2) (= |main_~#a~0.offset| 0) (= main_~i~0 0) (<= 2 main_~sum~0))} assume true; {1075#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) 1) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 1)))) (<= main_~sum~0 2) (= |main_~#a~0.offset| 0) (= main_~i~0 0) (<= 2 main_~sum~0))} is VALID [2018-11-14 18:57:31,062 INFO L273 TraceCheckUtils]: 26: Hoare triple {1075#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) 1) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 1)))) (<= main_~sum~0 2) (= |main_~#a~0.offset| 0) (= main_~i~0 0) (<= 2 main_~sum~0))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~sum~0 := ~sum~0 - #t~mem6;havoc #t~mem6; {1076#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) 1) (<= (+ (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) main_~sum~0) 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 1)))) (<= 2 (+ (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) main_~sum~0)) (= |main_~#a~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 18:57:31,064 INFO L273 TraceCheckUtils]: 27: Hoare triple {1076#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) 1) (<= (+ (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) main_~sum~0) 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 1)))) (<= 2 (+ (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) main_~sum~0)) (= |main_~#a~0.offset| 0) (= main_~i~0 0))} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {1077#(and (or (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) 1) (<= main_~sum~0 1) (<= 1 main_~sum~0)) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 5) (* 4 ~SIZE~0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:31,064 INFO L273 TraceCheckUtils]: 28: Hoare triple {1077#(and (or (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) 1) (<= main_~sum~0 1) (<= 1 main_~sum~0)) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 5) (* 4 ~SIZE~0))) (= |main_~#a~0.offset| 0))} assume true; {1077#(and (or (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) 1) (<= main_~sum~0 1) (<= 1 main_~sum~0)) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 5) (* 4 ~SIZE~0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:31,066 INFO L273 TraceCheckUtils]: 29: Hoare triple {1077#(and (or (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))) 1) (<= main_~sum~0 1) (<= 1 main_~sum~0)) (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 5) (* 4 ~SIZE~0))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~sum~0 := ~sum~0 - #t~mem6;havoc #t~mem6; {1078#(or (<= (+ main_~i~0 2) ~SIZE~0) (and (< 0 (+ main_~sum~0 1)) (<= main_~sum~0 0)))} is VALID [2018-11-14 18:57:31,067 INFO L273 TraceCheckUtils]: 30: Hoare triple {1078#(or (<= (+ main_~i~0 2) ~SIZE~0) (and (< 0 (+ main_~sum~0 1)) (<= main_~sum~0 0)))} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {1079#(or (<= (+ main_~i~0 1) ~SIZE~0) (and (< 0 (+ main_~sum~0 1)) (<= main_~sum~0 0)))} is VALID [2018-11-14 18:57:31,067 INFO L273 TraceCheckUtils]: 31: Hoare triple {1079#(or (<= (+ main_~i~0 1) ~SIZE~0) (and (< 0 (+ main_~sum~0 1)) (<= main_~sum~0 0)))} assume true; {1079#(or (<= (+ main_~i~0 1) ~SIZE~0) (and (< 0 (+ main_~sum~0 1)) (<= main_~sum~0 0)))} is VALID [2018-11-14 18:57:31,068 INFO L273 TraceCheckUtils]: 32: Hoare triple {1079#(or (<= (+ main_~i~0 1) ~SIZE~0) (and (< 0 (+ main_~sum~0 1)) (<= main_~sum~0 0)))} assume !(~i~0 < ~SIZE~0); {1080#(and (< 0 (+ main_~sum~0 1)) (<= main_~sum~0 0))} is VALID [2018-11-14 18:57:31,069 INFO L256 TraceCheckUtils]: 33: Hoare triple {1080#(and (< 0 (+ main_~sum~0 1)) (<= main_~sum~0 0))} call __VERIFIER_assert((if ~sum~0 == 0 then 1 else 0)); {1081#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 18:57:31,069 INFO L273 TraceCheckUtils]: 34: Hoare triple {1081#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1082#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 18:57:31,070 INFO L273 TraceCheckUtils]: 35: Hoare triple {1082#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {1062#false} is VALID [2018-11-14 18:57:31,070 INFO L273 TraceCheckUtils]: 36: Hoare triple {1062#false} assume !false; {1062#false} is VALID [2018-11-14 18:57:31,085 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:57:31,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:57:31,085 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:57:31,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:57:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:57:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:57:31,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:57:31,415 INFO L477 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 13 treesize of output 10 [2018-11-14 18:57:31,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-14 18:57:31,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:57:31,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:57:31,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:57:31,429 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-14 18:57:32,124 INFO L256 TraceCheckUtils]: 0: Hoare triple {1061#true} call ULTIMATE.init(); {1061#true} is VALID [2018-11-14 18:57:32,124 INFO L273 TraceCheckUtils]: 1: Hoare triple {1061#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1061#true} is VALID [2018-11-14 18:57:32,124 INFO L273 TraceCheckUtils]: 2: Hoare triple {1061#true} assume true; {1061#true} is VALID [2018-11-14 18:57:32,124 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1061#true} {1061#true} #72#return; {1061#true} is VALID [2018-11-14 18:57:32,125 INFO L256 TraceCheckUtils]: 4: Hoare triple {1061#true} call #t~ret7 := main(); {1061#true} is VALID [2018-11-14 18:57:32,125 INFO L273 TraceCheckUtils]: 5: Hoare triple {1061#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1061#true} is VALID [2018-11-14 18:57:32,131 INFO L273 TraceCheckUtils]: 6: Hoare triple {1061#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~SIZE~0 * 4);~sum~0 := 0;~i~0 := 0; {1104#(and (= main_~sum~0 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:32,131 INFO L273 TraceCheckUtils]: 7: Hoare triple {1104#(and (= main_~sum~0 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume true; {1104#(and (= main_~sum~0 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:32,132 INFO L273 TraceCheckUtils]: 8: Hoare triple {1104#(and (= main_~sum~0 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call write~int(1, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1104#(and (= main_~sum~0 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:32,133 INFO L273 TraceCheckUtils]: 9: Hoare triple {1104#(and (= main_~sum~0 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1114#(and (= main_~sum~0 0) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:32,133 INFO L273 TraceCheckUtils]: 10: Hoare triple {1114#(and (= main_~sum~0 0) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume true; {1114#(and (= main_~sum~0 0) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:32,134 INFO L273 TraceCheckUtils]: 11: Hoare triple {1114#(and (= main_~sum~0 0) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call write~int(1, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1121#(and (= main_~sum~0 0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:32,134 INFO L273 TraceCheckUtils]: 12: Hoare triple {1121#(and (= main_~sum~0 0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1121#(and (= main_~sum~0 0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:32,135 INFO L273 TraceCheckUtils]: 13: Hoare triple {1121#(and (= main_~sum~0 0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} assume true; {1121#(and (= main_~sum~0 0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:32,135 INFO L273 TraceCheckUtils]: 14: Hoare triple {1121#(and (= main_~sum~0 0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} assume !(~i~0 < ~SIZE~0); {1121#(and (= main_~sum~0 0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:32,137 INFO L273 TraceCheckUtils]: 15: Hoare triple {1121#(and (= main_~sum~0 0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {1134#(and (= main_~sum~0 0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:32,140 INFO L273 TraceCheckUtils]: 16: Hoare triple {1134#(and (= main_~sum~0 0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume true; {1134#(and (= main_~sum~0 0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:32,140 INFO L273 TraceCheckUtils]: 17: Hoare triple {1134#(and (= main_~sum~0 0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~sum~0 := ~sum~0 + #t~mem4;havoc #t~mem4; {1141#(and (= main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:32,141 INFO L273 TraceCheckUtils]: 18: Hoare triple {1141#(and (= main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1145#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 1) (= main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:32,142 INFO L273 TraceCheckUtils]: 19: Hoare triple {1145#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 1) (= main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} assume true; {1145#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 1) (= main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:32,142 INFO L273 TraceCheckUtils]: 20: Hoare triple {1145#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 1) (= main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~sum~0 := ~sum~0 + #t~mem4;havoc #t~mem4; {1152#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~sum~0 (+ (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:32,143 INFO L273 TraceCheckUtils]: 21: Hoare triple {1152#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~sum~0 (+ (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1152#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~sum~0 (+ (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:32,153 INFO L273 TraceCheckUtils]: 22: Hoare triple {1152#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~sum~0 (+ (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} assume true; {1152#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~sum~0 (+ (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:32,154 INFO L273 TraceCheckUtils]: 23: Hoare triple {1152#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~sum~0 (+ (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} assume !(~i~0 < ~SIZE~0); {1152#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~sum~0 (+ (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:32,155 INFO L273 TraceCheckUtils]: 24: Hoare triple {1152#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~sum~0 (+ (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {1165#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~sum~0 (+ (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:32,155 INFO L273 TraceCheckUtils]: 25: Hoare triple {1165#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~sum~0 (+ (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume true; {1165#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~sum~0 (+ (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:32,156 INFO L273 TraceCheckUtils]: 26: Hoare triple {1165#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~sum~0 (+ (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~sum~0 := ~sum~0 - #t~mem6;havoc #t~mem6; {1172#(and (= (+ (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)) main_~sum~0) (+ (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:32,157 INFO L273 TraceCheckUtils]: 27: Hoare triple {1172#(and (= (+ (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)) main_~sum~0) (+ (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {1176#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 1) (= main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:32,158 INFO L273 TraceCheckUtils]: 28: Hoare triple {1176#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 1) (= main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} assume true; {1176#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 1) (= main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 18:57:32,159 INFO L273 TraceCheckUtils]: 29: Hoare triple {1176#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~i~0 1) (= main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~sum~0 := ~sum~0 - #t~mem6;havoc #t~mem6; {1080#(and (< 0 (+ main_~sum~0 1)) (<= main_~sum~0 0))} is VALID [2018-11-14 18:57:32,160 INFO L273 TraceCheckUtils]: 30: Hoare triple {1080#(and (< 0 (+ main_~sum~0 1)) (<= main_~sum~0 0))} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {1080#(and (< 0 (+ main_~sum~0 1)) (<= main_~sum~0 0))} is VALID [2018-11-14 18:57:32,161 INFO L273 TraceCheckUtils]: 31: Hoare triple {1080#(and (< 0 (+ main_~sum~0 1)) (<= main_~sum~0 0))} assume true; {1080#(and (< 0 (+ main_~sum~0 1)) (<= main_~sum~0 0))} is VALID [2018-11-14 18:57:32,161 INFO L273 TraceCheckUtils]: 32: Hoare triple {1080#(and (< 0 (+ main_~sum~0 1)) (<= main_~sum~0 0))} assume !(~i~0 < ~SIZE~0); {1080#(and (< 0 (+ main_~sum~0 1)) (<= main_~sum~0 0))} is VALID [2018-11-14 18:57:32,163 INFO L256 TraceCheckUtils]: 33: Hoare triple {1080#(and (< 0 (+ main_~sum~0 1)) (<= main_~sum~0 0))} call __VERIFIER_assert((if ~sum~0 == 0 then 1 else 0)); {1081#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 18:57:32,163 INFO L273 TraceCheckUtils]: 34: Hoare triple {1081#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1082#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 18:57:32,164 INFO L273 TraceCheckUtils]: 35: Hoare triple {1082#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {1062#false} is VALID [2018-11-14 18:57:32,164 INFO L273 TraceCheckUtils]: 36: Hoare triple {1062#false} assume !false; {1062#false} is VALID [2018-11-14 18:57:32,171 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:57:32,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:57:32,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15] total 32 [2018-11-14 18:57:32,200 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 37 [2018-11-14 18:57:32,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:57:32,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-14 18:57:32,420 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:57:32,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-14 18:57:32,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-14 18:57:32,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=842, Unknown=0, NotChecked=0, Total=992 [2018-11-14 18:57:32,421 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 32 states. [2018-11-14 18:57:36,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:36,079 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2018-11-14 18:57:36,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-14 18:57:36,079 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 37 [2018-11-14 18:57:36,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:57:36,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 18:57:36,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 83 transitions. [2018-11-14 18:57:36,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 18:57:36,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 83 transitions. [2018-11-14 18:57:36,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 83 transitions. [2018-11-14 18:57:36,197 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:57:36,200 INFO L225 Difference]: With dead ends: 82 [2018-11-14 18:57:36,200 INFO L226 Difference]: Without dead ends: 76 [2018-11-14 18:57:36,202 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=379, Invalid=2171, Unknown=0, NotChecked=0, Total=2550 [2018-11-14 18:57:36,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-14 18:57:36,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 45. [2018-11-14 18:57:36,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:57:36,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 45 states. [2018-11-14 18:57:36,332 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 45 states. [2018-11-14 18:57:36,333 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 45 states. [2018-11-14 18:57:36,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:36,336 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2018-11-14 18:57:36,336 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2018-11-14 18:57:36,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:57:36,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:57:36,337 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 76 states. [2018-11-14 18:57:36,337 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 76 states. [2018-11-14 18:57:36,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:36,341 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2018-11-14 18:57:36,341 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2018-11-14 18:57:36,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:57:36,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:57:36,342 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:57:36,342 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:57:36,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-14 18:57:36,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-11-14 18:57:36,344 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 37 [2018-11-14 18:57:36,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:57:36,344 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-11-14 18:57:36,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-14 18:57:36,344 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-11-14 18:57:36,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-14 18:57:36,345 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:57:36,345 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:57:36,346 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:57:36,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:57:36,346 INFO L82 PathProgramCache]: Analyzing trace with hash 467854341, now seen corresponding path program 2 times [2018-11-14 18:57:36,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:57:36,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:57:36,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:57:36,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:57:36,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:57:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:57:36,513 INFO L256 TraceCheckUtils]: 0: Hoare triple {1566#true} call ULTIMATE.init(); {1566#true} is VALID [2018-11-14 18:57:36,514 INFO L273 TraceCheckUtils]: 1: Hoare triple {1566#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1566#true} is VALID [2018-11-14 18:57:36,514 INFO L273 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2018-11-14 18:57:36,514 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} #72#return; {1566#true} is VALID [2018-11-14 18:57:36,515 INFO L256 TraceCheckUtils]: 4: Hoare triple {1566#true} call #t~ret7 := main(); {1566#true} is VALID [2018-11-14 18:57:36,515 INFO L273 TraceCheckUtils]: 5: Hoare triple {1566#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1566#true} is VALID [2018-11-14 18:57:36,516 INFO L273 TraceCheckUtils]: 6: Hoare triple {1566#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~SIZE~0 * 4);~sum~0 := 0;~i~0 := 0; {1568#(= main_~i~0 0)} is VALID [2018-11-14 18:57:36,516 INFO L273 TraceCheckUtils]: 7: Hoare triple {1568#(= main_~i~0 0)} assume true; {1568#(= main_~i~0 0)} is VALID [2018-11-14 18:57:36,516 INFO L273 TraceCheckUtils]: 8: Hoare triple {1568#(= main_~i~0 0)} assume !!(~i~0 < ~SIZE~0);call write~int(1, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1568#(= main_~i~0 0)} is VALID [2018-11-14 18:57:36,517 INFO L273 TraceCheckUtils]: 9: Hoare triple {1568#(= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1569#(<= main_~i~0 1)} is VALID [2018-11-14 18:57:36,517 INFO L273 TraceCheckUtils]: 10: Hoare triple {1569#(<= main_~i~0 1)} assume true; {1569#(<= main_~i~0 1)} is VALID [2018-11-14 18:57:36,518 INFO L273 TraceCheckUtils]: 11: Hoare triple {1569#(<= main_~i~0 1)} assume !!(~i~0 < ~SIZE~0);call write~int(1, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1569#(<= main_~i~0 1)} is VALID [2018-11-14 18:57:36,520 INFO L273 TraceCheckUtils]: 12: Hoare triple {1569#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1570#(<= main_~i~0 2)} is VALID [2018-11-14 18:57:36,521 INFO L273 TraceCheckUtils]: 13: Hoare triple {1570#(<= main_~i~0 2)} assume true; {1570#(<= main_~i~0 2)} is VALID [2018-11-14 18:57:36,521 INFO L273 TraceCheckUtils]: 14: Hoare triple {1570#(<= main_~i~0 2)} assume !(~i~0 < ~SIZE~0); {1571#(<= ~SIZE~0 2)} is VALID [2018-11-14 18:57:36,522 INFO L273 TraceCheckUtils]: 15: Hoare triple {1571#(<= ~SIZE~0 2)} ~i~0 := 0; {1572#(and (<= ~SIZE~0 2) (= main_~i~0 0))} is VALID [2018-11-14 18:57:36,523 INFO L273 TraceCheckUtils]: 16: Hoare triple {1572#(and (<= ~SIZE~0 2) (= main_~i~0 0))} assume true; {1572#(and (<= ~SIZE~0 2) (= main_~i~0 0))} is VALID [2018-11-14 18:57:36,526 INFO L273 TraceCheckUtils]: 17: Hoare triple {1572#(and (<= ~SIZE~0 2) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~sum~0 := ~sum~0 + #t~mem4;havoc #t~mem4; {1572#(and (<= ~SIZE~0 2) (= main_~i~0 0))} is VALID [2018-11-14 18:57:36,529 INFO L273 TraceCheckUtils]: 18: Hoare triple {1572#(and (<= ~SIZE~0 2) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1573#(<= ~SIZE~0 (+ main_~i~0 1))} is VALID [2018-11-14 18:57:36,531 INFO L273 TraceCheckUtils]: 19: Hoare triple {1573#(<= ~SIZE~0 (+ main_~i~0 1))} assume true; {1573#(<= ~SIZE~0 (+ main_~i~0 1))} is VALID [2018-11-14 18:57:36,531 INFO L273 TraceCheckUtils]: 20: Hoare triple {1573#(<= ~SIZE~0 (+ main_~i~0 1))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~sum~0 := ~sum~0 + #t~mem4;havoc #t~mem4; {1573#(<= ~SIZE~0 (+ main_~i~0 1))} is VALID [2018-11-14 18:57:36,532 INFO L273 TraceCheckUtils]: 21: Hoare triple {1573#(<= ~SIZE~0 (+ main_~i~0 1))} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1574#(<= ~SIZE~0 main_~i~0)} is VALID [2018-11-14 18:57:36,532 INFO L273 TraceCheckUtils]: 22: Hoare triple {1574#(<= ~SIZE~0 main_~i~0)} assume true; {1574#(<= ~SIZE~0 main_~i~0)} is VALID [2018-11-14 18:57:36,533 INFO L273 TraceCheckUtils]: 23: Hoare triple {1574#(<= ~SIZE~0 main_~i~0)} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~sum~0 := ~sum~0 + #t~mem4;havoc #t~mem4; {1567#false} is VALID [2018-11-14 18:57:36,533 INFO L273 TraceCheckUtils]: 24: Hoare triple {1567#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1567#false} is VALID [2018-11-14 18:57:36,533 INFO L273 TraceCheckUtils]: 25: Hoare triple {1567#false} assume true; {1567#false} is VALID [2018-11-14 18:57:36,533 INFO L273 TraceCheckUtils]: 26: Hoare triple {1567#false} assume !(~i~0 < ~SIZE~0); {1567#false} is VALID [2018-11-14 18:57:36,533 INFO L273 TraceCheckUtils]: 27: Hoare triple {1567#false} ~i~0 := 0; {1567#false} is VALID [2018-11-14 18:57:36,533 INFO L273 TraceCheckUtils]: 28: Hoare triple {1567#false} assume true; {1567#false} is VALID [2018-11-14 18:57:36,533 INFO L273 TraceCheckUtils]: 29: Hoare triple {1567#false} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~sum~0 := ~sum~0 - #t~mem6;havoc #t~mem6; {1567#false} is VALID [2018-11-14 18:57:36,534 INFO L273 TraceCheckUtils]: 30: Hoare triple {1567#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {1567#false} is VALID [2018-11-14 18:57:36,534 INFO L273 TraceCheckUtils]: 31: Hoare triple {1567#false} assume true; {1567#false} is VALID [2018-11-14 18:57:36,534 INFO L273 TraceCheckUtils]: 32: Hoare triple {1567#false} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~sum~0 := ~sum~0 - #t~mem6;havoc #t~mem6; {1567#false} is VALID [2018-11-14 18:57:36,534 INFO L273 TraceCheckUtils]: 33: Hoare triple {1567#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {1567#false} is VALID [2018-11-14 18:57:36,534 INFO L273 TraceCheckUtils]: 34: Hoare triple {1567#false} assume true; {1567#false} is VALID [2018-11-14 18:57:36,534 INFO L273 TraceCheckUtils]: 35: Hoare triple {1567#false} assume !(~i~0 < ~SIZE~0); {1567#false} is VALID [2018-11-14 18:57:36,535 INFO L256 TraceCheckUtils]: 36: Hoare triple {1567#false} call __VERIFIER_assert((if ~sum~0 == 0 then 1 else 0)); {1567#false} is VALID [2018-11-14 18:57:36,535 INFO L273 TraceCheckUtils]: 37: Hoare triple {1567#false} ~cond := #in~cond; {1567#false} is VALID [2018-11-14 18:57:36,535 INFO L273 TraceCheckUtils]: 38: Hoare triple {1567#false} assume ~cond == 0; {1567#false} is VALID [2018-11-14 18:57:36,535 INFO L273 TraceCheckUtils]: 39: Hoare triple {1567#false} assume !false; {1567#false} is VALID [2018-11-14 18:57:36,537 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-14 18:57:36,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:57:36,537 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:57:36,546 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:57:36,562 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:57:36,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:57:36,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:57:36,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:57:36,784 INFO L256 TraceCheckUtils]: 0: Hoare triple {1566#true} call ULTIMATE.init(); {1566#true} is VALID [2018-11-14 18:57:36,784 INFO L273 TraceCheckUtils]: 1: Hoare triple {1566#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1566#true} is VALID [2018-11-14 18:57:36,784 INFO L273 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2018-11-14 18:57:36,785 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} #72#return; {1566#true} is VALID [2018-11-14 18:57:36,785 INFO L256 TraceCheckUtils]: 4: Hoare triple {1566#true} call #t~ret7 := main(); {1566#true} is VALID [2018-11-14 18:57:36,785 INFO L273 TraceCheckUtils]: 5: Hoare triple {1566#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1566#true} is VALID [2018-11-14 18:57:36,786 INFO L273 TraceCheckUtils]: 6: Hoare triple {1566#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~SIZE~0 * 4);~sum~0 := 0;~i~0 := 0; {1596#(<= main_~i~0 0)} is VALID [2018-11-14 18:57:36,787 INFO L273 TraceCheckUtils]: 7: Hoare triple {1596#(<= main_~i~0 0)} assume true; {1596#(<= main_~i~0 0)} is VALID [2018-11-14 18:57:36,787 INFO L273 TraceCheckUtils]: 8: Hoare triple {1596#(<= main_~i~0 0)} assume !!(~i~0 < ~SIZE~0);call write~int(1, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1596#(<= main_~i~0 0)} is VALID [2018-11-14 18:57:36,788 INFO L273 TraceCheckUtils]: 9: Hoare triple {1596#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1569#(<= main_~i~0 1)} is VALID [2018-11-14 18:57:36,788 INFO L273 TraceCheckUtils]: 10: Hoare triple {1569#(<= main_~i~0 1)} assume true; {1569#(<= main_~i~0 1)} is VALID [2018-11-14 18:57:36,789 INFO L273 TraceCheckUtils]: 11: Hoare triple {1569#(<= main_~i~0 1)} assume !!(~i~0 < ~SIZE~0);call write~int(1, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1569#(<= main_~i~0 1)} is VALID [2018-11-14 18:57:36,789 INFO L273 TraceCheckUtils]: 12: Hoare triple {1569#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1570#(<= main_~i~0 2)} is VALID [2018-11-14 18:57:36,790 INFO L273 TraceCheckUtils]: 13: Hoare triple {1570#(<= main_~i~0 2)} assume true; {1570#(<= main_~i~0 2)} is VALID [2018-11-14 18:57:36,791 INFO L273 TraceCheckUtils]: 14: Hoare triple {1570#(<= main_~i~0 2)} assume !(~i~0 < ~SIZE~0); {1571#(<= ~SIZE~0 2)} is VALID [2018-11-14 18:57:36,791 INFO L273 TraceCheckUtils]: 15: Hoare triple {1571#(<= ~SIZE~0 2)} ~i~0 := 0; {1624#(and (<= 0 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-14 18:57:36,792 INFO L273 TraceCheckUtils]: 16: Hoare triple {1624#(and (<= 0 main_~i~0) (<= ~SIZE~0 2))} assume true; {1624#(and (<= 0 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-14 18:57:36,793 INFO L273 TraceCheckUtils]: 17: Hoare triple {1624#(and (<= 0 main_~i~0) (<= ~SIZE~0 2))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~sum~0 := ~sum~0 + #t~mem4;havoc #t~mem4; {1624#(and (<= 0 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-14 18:57:36,794 INFO L273 TraceCheckUtils]: 18: Hoare triple {1624#(and (<= 0 main_~i~0) (<= ~SIZE~0 2))} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1634#(and (<= 1 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-14 18:57:36,794 INFO L273 TraceCheckUtils]: 19: Hoare triple {1634#(and (<= 1 main_~i~0) (<= ~SIZE~0 2))} assume true; {1634#(and (<= 1 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-14 18:57:36,795 INFO L273 TraceCheckUtils]: 20: Hoare triple {1634#(and (<= 1 main_~i~0) (<= ~SIZE~0 2))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~sum~0 := ~sum~0 + #t~mem4;havoc #t~mem4; {1634#(and (<= 1 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-14 18:57:36,796 INFO L273 TraceCheckUtils]: 21: Hoare triple {1634#(and (<= 1 main_~i~0) (<= ~SIZE~0 2))} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1644#(and (<= 2 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-14 18:57:36,799 INFO L273 TraceCheckUtils]: 22: Hoare triple {1644#(and (<= 2 main_~i~0) (<= ~SIZE~0 2))} assume true; {1644#(and (<= 2 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-14 18:57:36,799 INFO L273 TraceCheckUtils]: 23: Hoare triple {1644#(and (<= 2 main_~i~0) (<= ~SIZE~0 2))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~sum~0 := ~sum~0 + #t~mem4;havoc #t~mem4; {1567#false} is VALID [2018-11-14 18:57:36,800 INFO L273 TraceCheckUtils]: 24: Hoare triple {1567#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1567#false} is VALID [2018-11-14 18:57:36,800 INFO L273 TraceCheckUtils]: 25: Hoare triple {1567#false} assume true; {1567#false} is VALID [2018-11-14 18:57:36,800 INFO L273 TraceCheckUtils]: 26: Hoare triple {1567#false} assume !(~i~0 < ~SIZE~0); {1567#false} is VALID [2018-11-14 18:57:36,800 INFO L273 TraceCheckUtils]: 27: Hoare triple {1567#false} ~i~0 := 0; {1567#false} is VALID [2018-11-14 18:57:36,800 INFO L273 TraceCheckUtils]: 28: Hoare triple {1567#false} assume true; {1567#false} is VALID [2018-11-14 18:57:36,801 INFO L273 TraceCheckUtils]: 29: Hoare triple {1567#false} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~sum~0 := ~sum~0 - #t~mem6;havoc #t~mem6; {1567#false} is VALID [2018-11-14 18:57:36,801 INFO L273 TraceCheckUtils]: 30: Hoare triple {1567#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {1567#false} is VALID [2018-11-14 18:57:36,801 INFO L273 TraceCheckUtils]: 31: Hoare triple {1567#false} assume true; {1567#false} is VALID [2018-11-14 18:57:36,801 INFO L273 TraceCheckUtils]: 32: Hoare triple {1567#false} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~sum~0 := ~sum~0 - #t~mem6;havoc #t~mem6; {1567#false} is VALID [2018-11-14 18:57:36,801 INFO L273 TraceCheckUtils]: 33: Hoare triple {1567#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {1567#false} is VALID [2018-11-14 18:57:36,802 INFO L273 TraceCheckUtils]: 34: Hoare triple {1567#false} assume true; {1567#false} is VALID [2018-11-14 18:57:36,802 INFO L273 TraceCheckUtils]: 35: Hoare triple {1567#false} assume !(~i~0 < ~SIZE~0); {1567#false} is VALID [2018-11-14 18:57:36,802 INFO L256 TraceCheckUtils]: 36: Hoare triple {1567#false} call __VERIFIER_assert((if ~sum~0 == 0 then 1 else 0)); {1567#false} is VALID [2018-11-14 18:57:36,802 INFO L273 TraceCheckUtils]: 37: Hoare triple {1567#false} ~cond := #in~cond; {1567#false} is VALID [2018-11-14 18:57:36,803 INFO L273 TraceCheckUtils]: 38: Hoare triple {1567#false} assume ~cond == 0; {1567#false} is VALID [2018-11-14 18:57:36,803 INFO L273 TraceCheckUtils]: 39: Hoare triple {1567#false} assume !false; {1567#false} is VALID [2018-11-14 18:57:36,805 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-14 18:57:36,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:57:36,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-11-14 18:57:36,827 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-11-14 18:57:36,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:57:36,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 18:57:36,876 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:57:36,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 18:57:36,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 18:57:36,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-11-14 18:57:36,877 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 13 states. [2018-11-14 18:57:37,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:37,443 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2018-11-14 18:57:37,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 18:57:37,443 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-11-14 18:57:37,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:57:37,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:57:37,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 92 transitions. [2018-11-14 18:57:37,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:57:37,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 92 transitions. [2018-11-14 18:57:37,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 92 transitions. [2018-11-14 18:57:37,592 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-14 18:57:37,595 INFO L225 Difference]: With dead ends: 91 [2018-11-14 18:57:37,595 INFO L226 Difference]: Without dead ends: 55 [2018-11-14 18:57:37,596 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-11-14 18:57:37,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-14 18:57:37,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 44. [2018-11-14 18:57:37,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:57:37,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 44 states. [2018-11-14 18:57:37,682 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 44 states. [2018-11-14 18:57:37,682 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 44 states. [2018-11-14 18:57:37,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:37,686 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-11-14 18:57:37,686 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-11-14 18:57:37,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:57:37,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:57:37,687 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 55 states. [2018-11-14 18:57:37,687 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 55 states. [2018-11-14 18:57:37,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:37,689 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-11-14 18:57:37,689 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-11-14 18:57:37,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:57:37,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:57:37,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:57:37,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:57:37,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 18:57:37,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-11-14 18:57:37,692 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 40 [2018-11-14 18:57:37,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:57:37,692 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-11-14 18:57:37,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 18:57:37,692 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-14 18:57:37,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-14 18:57:37,693 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:57:37,694 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:57:37,694 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:57:37,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:57:37,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1998914893, now seen corresponding path program 3 times [2018-11-14 18:57:37,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:57:37,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:57:37,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:57:37,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:57:37,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:57:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:57:37,887 INFO L256 TraceCheckUtils]: 0: Hoare triple {1998#true} call ULTIMATE.init(); {1998#true} is VALID [2018-11-14 18:57:37,887 INFO L273 TraceCheckUtils]: 1: Hoare triple {1998#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1998#true} is VALID [2018-11-14 18:57:37,887 INFO L273 TraceCheckUtils]: 2: Hoare triple {1998#true} assume true; {1998#true} is VALID [2018-11-14 18:57:37,888 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1998#true} {1998#true} #72#return; {1998#true} is VALID [2018-11-14 18:57:37,888 INFO L256 TraceCheckUtils]: 4: Hoare triple {1998#true} call #t~ret7 := main(); {1998#true} is VALID [2018-11-14 18:57:37,888 INFO L273 TraceCheckUtils]: 5: Hoare triple {1998#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1998#true} is VALID [2018-11-14 18:57:37,889 INFO L273 TraceCheckUtils]: 6: Hoare triple {1998#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~SIZE~0 * 4);~sum~0 := 0;~i~0 := 0; {2000#(= main_~i~0 0)} is VALID [2018-11-14 18:57:37,889 INFO L273 TraceCheckUtils]: 7: Hoare triple {2000#(= main_~i~0 0)} assume true; {2000#(= main_~i~0 0)} is VALID [2018-11-14 18:57:37,890 INFO L273 TraceCheckUtils]: 8: Hoare triple {2000#(= main_~i~0 0)} assume !!(~i~0 < ~SIZE~0);call write~int(1, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2000#(= main_~i~0 0)} is VALID [2018-11-14 18:57:37,890 INFO L273 TraceCheckUtils]: 9: Hoare triple {2000#(= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2001#(<= 1 main_~i~0)} is VALID [2018-11-14 18:57:37,891 INFO L273 TraceCheckUtils]: 10: Hoare triple {2001#(<= 1 main_~i~0)} assume true; {2001#(<= 1 main_~i~0)} is VALID [2018-11-14 18:57:37,891 INFO L273 TraceCheckUtils]: 11: Hoare triple {2001#(<= 1 main_~i~0)} assume !!(~i~0 < ~SIZE~0);call write~int(1, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2001#(<= 1 main_~i~0)} is VALID [2018-11-14 18:57:37,891 INFO L273 TraceCheckUtils]: 12: Hoare triple {2001#(<= 1 main_~i~0)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2002#(<= 2 main_~i~0)} is VALID [2018-11-14 18:57:37,892 INFO L273 TraceCheckUtils]: 13: Hoare triple {2002#(<= 2 main_~i~0)} assume true; {2002#(<= 2 main_~i~0)} is VALID [2018-11-14 18:57:37,892 INFO L273 TraceCheckUtils]: 14: Hoare triple {2002#(<= 2 main_~i~0)} assume !!(~i~0 < ~SIZE~0);call write~int(1, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2003#(<= 3 ~SIZE~0)} is VALID [2018-11-14 18:57:37,893 INFO L273 TraceCheckUtils]: 15: Hoare triple {2003#(<= 3 ~SIZE~0)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2003#(<= 3 ~SIZE~0)} is VALID [2018-11-14 18:57:37,893 INFO L273 TraceCheckUtils]: 16: Hoare triple {2003#(<= 3 ~SIZE~0)} assume true; {2003#(<= 3 ~SIZE~0)} is VALID [2018-11-14 18:57:37,894 INFO L273 TraceCheckUtils]: 17: Hoare triple {2003#(<= 3 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {2003#(<= 3 ~SIZE~0)} is VALID [2018-11-14 18:57:37,895 INFO L273 TraceCheckUtils]: 18: Hoare triple {2003#(<= 3 ~SIZE~0)} ~i~0 := 0; {2003#(<= 3 ~SIZE~0)} is VALID [2018-11-14 18:57:37,895 INFO L273 TraceCheckUtils]: 19: Hoare triple {2003#(<= 3 ~SIZE~0)} assume true; {2003#(<= 3 ~SIZE~0)} is VALID [2018-11-14 18:57:37,896 INFO L273 TraceCheckUtils]: 20: Hoare triple {2003#(<= 3 ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~sum~0 := ~sum~0 + #t~mem4;havoc #t~mem4; {2003#(<= 3 ~SIZE~0)} is VALID [2018-11-14 18:57:37,905 INFO L273 TraceCheckUtils]: 21: Hoare triple {2003#(<= 3 ~SIZE~0)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2003#(<= 3 ~SIZE~0)} is VALID [2018-11-14 18:57:37,906 INFO L273 TraceCheckUtils]: 22: Hoare triple {2003#(<= 3 ~SIZE~0)} assume true; {2003#(<= 3 ~SIZE~0)} is VALID [2018-11-14 18:57:37,906 INFO L273 TraceCheckUtils]: 23: Hoare triple {2003#(<= 3 ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~sum~0 := ~sum~0 + #t~mem4;havoc #t~mem4; {2003#(<= 3 ~SIZE~0)} is VALID [2018-11-14 18:57:37,906 INFO L273 TraceCheckUtils]: 24: Hoare triple {2003#(<= 3 ~SIZE~0)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2003#(<= 3 ~SIZE~0)} is VALID [2018-11-14 18:57:37,912 INFO L273 TraceCheckUtils]: 25: Hoare triple {2003#(<= 3 ~SIZE~0)} assume true; {2003#(<= 3 ~SIZE~0)} is VALID [2018-11-14 18:57:37,912 INFO L273 TraceCheckUtils]: 26: Hoare triple {2003#(<= 3 ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~sum~0 := ~sum~0 + #t~mem4;havoc #t~mem4; {2003#(<= 3 ~SIZE~0)} is VALID [2018-11-14 18:57:37,912 INFO L273 TraceCheckUtils]: 27: Hoare triple {2003#(<= 3 ~SIZE~0)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2003#(<= 3 ~SIZE~0)} is VALID [2018-11-14 18:57:37,913 INFO L273 TraceCheckUtils]: 28: Hoare triple {2003#(<= 3 ~SIZE~0)} assume true; {2003#(<= 3 ~SIZE~0)} is VALID [2018-11-14 18:57:37,913 INFO L273 TraceCheckUtils]: 29: Hoare triple {2003#(<= 3 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {2003#(<= 3 ~SIZE~0)} is VALID [2018-11-14 18:57:37,913 INFO L273 TraceCheckUtils]: 30: Hoare triple {2003#(<= 3 ~SIZE~0)} ~i~0 := 0; {2004#(and (<= 3 ~SIZE~0) (= main_~i~0 0))} is VALID [2018-11-14 18:57:37,914 INFO L273 TraceCheckUtils]: 31: Hoare triple {2004#(and (<= 3 ~SIZE~0) (= main_~i~0 0))} assume true; {2004#(and (<= 3 ~SIZE~0) (= main_~i~0 0))} is VALID [2018-11-14 18:57:37,914 INFO L273 TraceCheckUtils]: 32: Hoare triple {2004#(and (<= 3 ~SIZE~0) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~sum~0 := ~sum~0 - #t~mem6;havoc #t~mem6; {2004#(and (<= 3 ~SIZE~0) (= main_~i~0 0))} is VALID [2018-11-14 18:57:37,915 INFO L273 TraceCheckUtils]: 33: Hoare triple {2004#(and (<= 3 ~SIZE~0) (= main_~i~0 0))} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {2005#(<= (+ main_~i~0 2) ~SIZE~0)} is VALID [2018-11-14 18:57:37,915 INFO L273 TraceCheckUtils]: 34: Hoare triple {2005#(<= (+ main_~i~0 2) ~SIZE~0)} assume true; {2005#(<= (+ main_~i~0 2) ~SIZE~0)} is VALID [2018-11-14 18:57:37,916 INFO L273 TraceCheckUtils]: 35: Hoare triple {2005#(<= (+ main_~i~0 2) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~sum~0 := ~sum~0 - #t~mem6;havoc #t~mem6; {2005#(<= (+ main_~i~0 2) ~SIZE~0)} is VALID [2018-11-14 18:57:37,916 INFO L273 TraceCheckUtils]: 36: Hoare triple {2005#(<= (+ main_~i~0 2) ~SIZE~0)} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {2006#(<= (+ main_~i~0 1) ~SIZE~0)} is VALID [2018-11-14 18:57:37,917 INFO L273 TraceCheckUtils]: 37: Hoare triple {2006#(<= (+ main_~i~0 1) ~SIZE~0)} assume true; {2006#(<= (+ main_~i~0 1) ~SIZE~0)} is VALID [2018-11-14 18:57:37,917 INFO L273 TraceCheckUtils]: 38: Hoare triple {2006#(<= (+ main_~i~0 1) ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {1999#false} is VALID [2018-11-14 18:57:37,918 INFO L256 TraceCheckUtils]: 39: Hoare triple {1999#false} call __VERIFIER_assert((if ~sum~0 == 0 then 1 else 0)); {1999#false} is VALID [2018-11-14 18:57:37,918 INFO L273 TraceCheckUtils]: 40: Hoare triple {1999#false} ~cond := #in~cond; {1999#false} is VALID [2018-11-14 18:57:37,918 INFO L273 TraceCheckUtils]: 41: Hoare triple {1999#false} assume ~cond == 0; {1999#false} is VALID [2018-11-14 18:57:37,918 INFO L273 TraceCheckUtils]: 42: Hoare triple {1999#false} assume !false; {1999#false} is VALID [2018-11-14 18:57:37,920 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-14 18:57:37,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:57:37,921 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:57:37,938 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:57:38,011 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-14 18:57:38,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:57:38,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:57:38,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:57:38,605 INFO L256 TraceCheckUtils]: 0: Hoare triple {1998#true} call ULTIMATE.init(); {1998#true} is VALID [2018-11-14 18:57:38,606 INFO L273 TraceCheckUtils]: 1: Hoare triple {1998#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1998#true} is VALID [2018-11-14 18:57:38,606 INFO L273 TraceCheckUtils]: 2: Hoare triple {1998#true} assume true; {1998#true} is VALID [2018-11-14 18:57:38,606 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1998#true} {1998#true} #72#return; {1998#true} is VALID [2018-11-14 18:57:38,606 INFO L256 TraceCheckUtils]: 4: Hoare triple {1998#true} call #t~ret7 := main(); {1998#true} is VALID [2018-11-14 18:57:38,607 INFO L273 TraceCheckUtils]: 5: Hoare triple {1998#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1998#true} is VALID [2018-11-14 18:57:38,607 INFO L273 TraceCheckUtils]: 6: Hoare triple {1998#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~SIZE~0 * 4);~sum~0 := 0;~i~0 := 0; {1998#true} is VALID [2018-11-14 18:57:38,607 INFO L273 TraceCheckUtils]: 7: Hoare triple {1998#true} assume true; {1998#true} is VALID [2018-11-14 18:57:38,607 INFO L273 TraceCheckUtils]: 8: Hoare triple {1998#true} assume !!(~i~0 < ~SIZE~0);call write~int(1, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1998#true} is VALID [2018-11-14 18:57:38,608 INFO L273 TraceCheckUtils]: 9: Hoare triple {1998#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1998#true} is VALID [2018-11-14 18:57:38,608 INFO L273 TraceCheckUtils]: 10: Hoare triple {1998#true} assume true; {1998#true} is VALID [2018-11-14 18:57:38,608 INFO L273 TraceCheckUtils]: 11: Hoare triple {1998#true} assume !!(~i~0 < ~SIZE~0);call write~int(1, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1998#true} is VALID [2018-11-14 18:57:38,609 INFO L273 TraceCheckUtils]: 12: Hoare triple {1998#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1998#true} is VALID [2018-11-14 18:57:38,609 INFO L273 TraceCheckUtils]: 13: Hoare triple {1998#true} assume true; {1998#true} is VALID [2018-11-14 18:57:38,609 INFO L273 TraceCheckUtils]: 14: Hoare triple {1998#true} assume !!(~i~0 < ~SIZE~0);call write~int(1, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1998#true} is VALID [2018-11-14 18:57:38,609 INFO L273 TraceCheckUtils]: 15: Hoare triple {1998#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1998#true} is VALID [2018-11-14 18:57:38,609 INFO L273 TraceCheckUtils]: 16: Hoare triple {1998#true} assume true; {1998#true} is VALID [2018-11-14 18:57:38,609 INFO L273 TraceCheckUtils]: 17: Hoare triple {1998#true} assume !(~i~0 < ~SIZE~0); {1998#true} is VALID [2018-11-14 18:57:38,611 INFO L273 TraceCheckUtils]: 18: Hoare triple {1998#true} ~i~0 := 0; {2064#(<= 0 main_~i~0)} is VALID [2018-11-14 18:57:38,611 INFO L273 TraceCheckUtils]: 19: Hoare triple {2064#(<= 0 main_~i~0)} assume true; {2064#(<= 0 main_~i~0)} is VALID [2018-11-14 18:57:38,611 INFO L273 TraceCheckUtils]: 20: Hoare triple {2064#(<= 0 main_~i~0)} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~sum~0 := ~sum~0 + #t~mem4;havoc #t~mem4; {2064#(<= 0 main_~i~0)} is VALID [2018-11-14 18:57:38,612 INFO L273 TraceCheckUtils]: 21: Hoare triple {2064#(<= 0 main_~i~0)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2001#(<= 1 main_~i~0)} is VALID [2018-11-14 18:57:38,612 INFO L273 TraceCheckUtils]: 22: Hoare triple {2001#(<= 1 main_~i~0)} assume true; {2001#(<= 1 main_~i~0)} is VALID [2018-11-14 18:57:38,613 INFO L273 TraceCheckUtils]: 23: Hoare triple {2001#(<= 1 main_~i~0)} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~sum~0 := ~sum~0 + #t~mem4;havoc #t~mem4; {2001#(<= 1 main_~i~0)} is VALID [2018-11-14 18:57:38,615 INFO L273 TraceCheckUtils]: 24: Hoare triple {2001#(<= 1 main_~i~0)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2002#(<= 2 main_~i~0)} is VALID [2018-11-14 18:57:38,616 INFO L273 TraceCheckUtils]: 25: Hoare triple {2002#(<= 2 main_~i~0)} assume true; {2002#(<= 2 main_~i~0)} is VALID [2018-11-14 18:57:38,617 INFO L273 TraceCheckUtils]: 26: Hoare triple {2002#(<= 2 main_~i~0)} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~sum~0 := ~sum~0 + #t~mem4;havoc #t~mem4; {2003#(<= 3 ~SIZE~0)} is VALID [2018-11-14 18:57:38,617 INFO L273 TraceCheckUtils]: 27: Hoare triple {2003#(<= 3 ~SIZE~0)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2003#(<= 3 ~SIZE~0)} is VALID [2018-11-14 18:57:38,618 INFO L273 TraceCheckUtils]: 28: Hoare triple {2003#(<= 3 ~SIZE~0)} assume true; {2003#(<= 3 ~SIZE~0)} is VALID [2018-11-14 18:57:38,618 INFO L273 TraceCheckUtils]: 29: Hoare triple {2003#(<= 3 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {2003#(<= 3 ~SIZE~0)} is VALID [2018-11-14 18:57:38,637 INFO L273 TraceCheckUtils]: 30: Hoare triple {2003#(<= 3 ~SIZE~0)} ~i~0 := 0; {2101#(and (<= main_~i~0 0) (<= 3 ~SIZE~0))} is VALID [2018-11-14 18:57:38,651 INFO L273 TraceCheckUtils]: 31: Hoare triple {2101#(and (<= main_~i~0 0) (<= 3 ~SIZE~0))} assume true; {2101#(and (<= main_~i~0 0) (<= 3 ~SIZE~0))} is VALID [2018-11-14 18:57:38,656 INFO L273 TraceCheckUtils]: 32: Hoare triple {2101#(and (<= main_~i~0 0) (<= 3 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~sum~0 := ~sum~0 - #t~mem6;havoc #t~mem6; {2101#(and (<= main_~i~0 0) (<= 3 ~SIZE~0))} is VALID [2018-11-14 18:57:38,657 INFO L273 TraceCheckUtils]: 33: Hoare triple {2101#(and (<= main_~i~0 0) (<= 3 ~SIZE~0))} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {2111#(and (<= main_~i~0 1) (<= 3 ~SIZE~0))} is VALID [2018-11-14 18:57:38,658 INFO L273 TraceCheckUtils]: 34: Hoare triple {2111#(and (<= main_~i~0 1) (<= 3 ~SIZE~0))} assume true; {2111#(and (<= main_~i~0 1) (<= 3 ~SIZE~0))} is VALID [2018-11-14 18:57:38,658 INFO L273 TraceCheckUtils]: 35: Hoare triple {2111#(and (<= main_~i~0 1) (<= 3 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~sum~0 := ~sum~0 - #t~mem6;havoc #t~mem6; {2111#(and (<= main_~i~0 1) (<= 3 ~SIZE~0))} is VALID [2018-11-14 18:57:38,659 INFO L273 TraceCheckUtils]: 36: Hoare triple {2111#(and (<= main_~i~0 1) (<= 3 ~SIZE~0))} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {2121#(and (<= main_~i~0 2) (<= 3 ~SIZE~0))} is VALID [2018-11-14 18:57:38,659 INFO L273 TraceCheckUtils]: 37: Hoare triple {2121#(and (<= main_~i~0 2) (<= 3 ~SIZE~0))} assume true; {2121#(and (<= main_~i~0 2) (<= 3 ~SIZE~0))} is VALID [2018-11-14 18:57:38,660 INFO L273 TraceCheckUtils]: 38: Hoare triple {2121#(and (<= main_~i~0 2) (<= 3 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {1999#false} is VALID [2018-11-14 18:57:38,660 INFO L256 TraceCheckUtils]: 39: Hoare triple {1999#false} call __VERIFIER_assert((if ~sum~0 == 0 then 1 else 0)); {1999#false} is VALID [2018-11-14 18:57:38,661 INFO L273 TraceCheckUtils]: 40: Hoare triple {1999#false} ~cond := #in~cond; {1999#false} is VALID [2018-11-14 18:57:38,661 INFO L273 TraceCheckUtils]: 41: Hoare triple {1999#false} assume ~cond == 0; {1999#false} is VALID [2018-11-14 18:57:38,661 INFO L273 TraceCheckUtils]: 42: Hoare triple {1999#false} assume !false; {1999#false} is VALID [2018-11-14 18:57:38,664 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-14 18:57:38,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:57:38,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-11-14 18:57:38,685 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-11-14 18:57:38,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:57:38,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 18:57:38,787 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:57:38,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 18:57:38,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 18:57:38,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-11-14 18:57:38,788 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 13 states. [2018-11-14 18:57:39,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:39,376 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-11-14 18:57:39,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 18:57:39,376 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-11-14 18:57:39,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:57:39,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:57:39,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 56 transitions. [2018-11-14 18:57:39,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:57:39,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 56 transitions. [2018-11-14 18:57:39,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 56 transitions. [2018-11-14 18:57:39,526 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:57:39,527 INFO L225 Difference]: With dead ends: 54 [2018-11-14 18:57:39,528 INFO L226 Difference]: Without dead ends: 49 [2018-11-14 18:57:39,529 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2018-11-14 18:57:39,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-14 18:57:39,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-14 18:57:39,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:57:39,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 47 states. [2018-11-14 18:57:39,699 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 47 states. [2018-11-14 18:57:39,699 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 47 states. [2018-11-14 18:57:39,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:39,702 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2018-11-14 18:57:39,702 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-11-14 18:57:39,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:57:39,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:57:39,702 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 49 states. [2018-11-14 18:57:39,703 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 49 states. [2018-11-14 18:57:39,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:39,704 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2018-11-14 18:57:39,704 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-11-14 18:57:39,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:57:39,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:57:39,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:57:39,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:57:39,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 18:57:39,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-11-14 18:57:39,707 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 43 [2018-11-14 18:57:39,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:57:39,707 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-11-14 18:57:39,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 18:57:39,707 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-11-14 18:57:39,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-14 18:57:39,707 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:57:39,708 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:57:39,708 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:57:39,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:57:39,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1305789259, now seen corresponding path program 4 times [2018-11-14 18:57:39,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:57:39,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:57:39,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:57:39,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:57:39,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:57:39,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:57:40,135 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:83) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:128) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:151) 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:152) 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:429) 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:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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-14 18:57:40,141 INFO L168 Benchmark]: Toolchain (without parser) took 18142.05 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -927.4 MB). Peak memory consumption was 141.1 MB. Max. memory is 7.1 GB. [2018-11-14 18:57:40,142 INFO L168 Benchmark]: CDTParser took 0.26 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-14 18:57:40,142 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.04 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-14 18:57:40,143 INFO L168 Benchmark]: Boogie Preprocessor took 40.36 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-14 18:57:40,143 INFO L168 Benchmark]: RCFGBuilder took 665.48 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -759.4 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. [2018-11-14 18:57:40,144 INFO L168 Benchmark]: TraceAbstraction took 17109.20 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 337.6 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -178.5 MB). Peak memory consumption was 159.1 MB. Max. memory is 7.1 GB. [2018-11-14 18:57:40,147 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.26 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 322.04 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 Preprocessor took 40.36 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 665.48 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -759.4 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17109.20 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 337.6 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -178.5 MB). Peak memory consumption was 159.1 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:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...