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/bAnd5_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:54:42,281 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:54:42,283 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:54:42,301 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:54:42,301 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:54:42,303 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:54:42,304 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:54:42,307 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:54:42,309 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:54:42,311 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:54:42,313 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:54:42,313 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:54:42,314 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:54:42,316 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:54:42,323 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:54:42,324 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:54:42,328 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:54:42,330 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:54:42,331 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:54:42,333 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:54:42,334 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:54:42,335 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:54:42,337 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:54:42,337 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:54:42,337 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:54:42,338 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:54:42,339 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:54:42,340 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:54:42,340 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:54:42,341 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:54:42,341 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:54:42,342 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:54:42,342 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:54:42,343 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:54:42,344 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:54:42,344 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:54:42,345 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:54:42,359 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:54:42,359 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:54:42,360 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:54:42,361 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:54:42,361 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:54:42,361 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:54:42,362 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:54:42,362 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:54:42,362 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:54:42,362 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 18:54:42,363 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:54:42,363 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:54:42,363 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:54:42,363 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:54:42,363 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:54:42,364 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:54:42,364 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:54:42,364 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:54:42,364 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:54:42,364 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:54:42,365 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:54:42,365 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:54:42,365 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:54:42,365 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:54:42,365 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:54:42,366 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:54:42,366 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:54:42,366 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 18:54:42,366 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:54:42,366 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 18:54:42,367 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:54:42,410 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:54:42,427 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:54:42,431 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:54:42,433 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:54:42,433 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:54:42,434 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/bAnd5_true-unreach-call.i [2018-11-14 18:54:42,498 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/041b7c3ec/c064be51db3a4c8db732ed53d2264ad5/FLAG5f3d60fb8 [2018-11-14 18:54:43,013 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:54:43,014 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/bAnd5_true-unreach-call.i [2018-11-14 18:54:43,021 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/041b7c3ec/c064be51db3a4c8db732ed53d2264ad5/FLAG5f3d60fb8 [2018-11-14 18:54:43,036 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/041b7c3ec/c064be51db3a4c8db732ed53d2264ad5 [2018-11-14 18:54:43,046 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:54:43,048 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:54:43,049 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:54:43,049 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:54:43,053 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:54:43,055 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:54:43" (1/1) ... [2018-11-14 18:54:43,058 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ed12ad6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:54:43, skipping insertion in model container [2018-11-14 18:54:43,058 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:54:43" (1/1) ... [2018-11-14 18:54:43,068 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:54:43,096 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:54:43,309 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:54:43,321 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:54:43,348 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:54:43,367 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:54:43,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:54:43 WrapperNode [2018-11-14 18:54:43,368 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:54:43,369 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:54:43,369 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:54:43,369 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:54:43,383 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:54:43" (1/1) ... [2018-11-14 18:54:43,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:54:43" (1/1) ... [2018-11-14 18:54:43,396 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:54:43" (1/1) ... [2018-11-14 18:54:43,396 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:54:43" (1/1) ... [2018-11-14 18:54:43,411 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:54:43" (1/1) ... [2018-11-14 18:54:43,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:54:43" (1/1) ... [2018-11-14 18:54:43,422 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:54:43" (1/1) ... [2018-11-14 18:54:43,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:54:43,431 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:54:43,431 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:54:43,432 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:54:43,433 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:54:43" (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:54:43,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:54:43,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:54:43,569 INFO L138 BoogieDeclarations]: Found implementation of procedure bAnd [2018-11-14 18:54:43,569 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:54:43,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:54:43,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:54:43,570 INFO L130 BoogieDeclarations]: Found specification of procedure bAnd [2018-11-14 18:54:43,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 18:54:43,570 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:54:43,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:54:43,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 18:54:43,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:54:43,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:54:43,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:54:43,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 18:54:44,241 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:54:44,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:54:44 BoogieIcfgContainer [2018-11-14 18:54:44,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:54:44,243 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:54:44,243 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:54:44,246 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:54:44,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:54:43" (1/3) ... [2018-11-14 18:54:44,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39fb9db3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:54:44, skipping insertion in model container [2018-11-14 18:54:44,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:54:43" (2/3) ... [2018-11-14 18:54:44,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39fb9db3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:54:44, skipping insertion in model container [2018-11-14 18:54:44,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:54:44" (3/3) ... [2018-11-14 18:54:44,250 INFO L112 eAbstractionObserver]: Analyzing ICFG bAnd5_true-unreach-call.i [2018-11-14 18:54:44,262 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:54:44,272 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:54:44,288 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:54:44,323 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:54:44,324 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:54:44,324 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:54:44,324 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:54:44,324 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:54:44,324 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:54:44,325 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:54:44,325 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:54:44,325 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:54:44,356 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-14 18:54:44,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 18:54:44,363 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:54:44,364 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:54:44,367 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:54:44,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:54:44,373 INFO L82 PathProgramCache]: Analyzing trace with hash 865985591, now seen corresponding path program 1 times [2018-11-14 18:54:44,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:54:44,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:54:44,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:44,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:54:44,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:44,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:44,613 INFO L256 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2018-11-14 18:54:44,617 INFO L273 TraceCheckUtils]: 1: Hoare triple {36#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {36#true} is VALID [2018-11-14 18:54:44,617 INFO L273 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2018-11-14 18:54:44,618 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #62#return; {36#true} is VALID [2018-11-14 18:54:44,618 INFO L256 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret12 := main(); {36#true} is VALID [2018-11-14 18:54:44,619 INFO L273 TraceCheckUtils]: 5: Hoare triple {36#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~N~0 := #t~nondet3;havoc #t~nondet3; {36#true} is VALID [2018-11-14 18:54:44,619 INFO L273 TraceCheckUtils]: 6: Hoare triple {36#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~N~0 * 4);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0; {36#true} is VALID [2018-11-14 18:54:44,619 INFO L256 TraceCheckUtils]: 7: Hoare triple {36#true} call #t~ret4 := bAnd(~#x~0.base, ~#x~0.offset); {36#true} is VALID [2018-11-14 18:54:44,620 INFO L273 TraceCheckUtils]: 8: Hoare triple {36#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {36#true} is VALID [2018-11-14 18:54:44,621 INFO L273 TraceCheckUtils]: 9: Hoare triple {36#true} assume !true; {37#false} is VALID [2018-11-14 18:54:44,621 INFO L273 TraceCheckUtils]: 10: Hoare triple {37#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {37#false} is VALID [2018-11-14 18:54:44,622 INFO L273 TraceCheckUtils]: 11: Hoare triple {37#false} assume true; {37#false} is VALID [2018-11-14 18:54:44,622 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {37#false} {36#true} #66#return; {37#false} is VALID [2018-11-14 18:54:44,622 INFO L273 TraceCheckUtils]: 13: Hoare triple {37#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~0 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {37#false} is VALID [2018-11-14 18:54:44,623 INFO L256 TraceCheckUtils]: 14: Hoare triple {37#false} call #t~ret7 := bAnd(~#x~0.base, ~#x~0.offset); {36#true} is VALID [2018-11-14 18:54:44,624 INFO L273 TraceCheckUtils]: 15: Hoare triple {36#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {36#true} is VALID [2018-11-14 18:54:44,624 INFO L273 TraceCheckUtils]: 16: Hoare triple {36#true} assume !true; {36#true} is VALID [2018-11-14 18:54:44,624 INFO L273 TraceCheckUtils]: 17: Hoare triple {36#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {36#true} is VALID [2018-11-14 18:54:44,624 INFO L273 TraceCheckUtils]: 18: Hoare triple {36#true} assume true; {36#true} is VALID [2018-11-14 18:54:44,625 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {36#true} {37#false} #68#return; {37#false} is VALID [2018-11-14 18:54:44,625 INFO L273 TraceCheckUtils]: 20: Hoare triple {37#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~1 := 0; {37#false} is VALID [2018-11-14 18:54:44,625 INFO L273 TraceCheckUtils]: 21: Hoare triple {37#false} assume !true; {37#false} is VALID [2018-11-14 18:54:44,626 INFO L273 TraceCheckUtils]: 22: Hoare triple {37#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + (~N~0 - 1) * 4, 4); {37#false} is VALID [2018-11-14 18:54:44,626 INFO L256 TraceCheckUtils]: 23: Hoare triple {37#false} call #t~ret11 := bAnd(~#x~0.base, ~#x~0.offset); {36#true} is VALID [2018-11-14 18:54:44,626 INFO L273 TraceCheckUtils]: 24: Hoare triple {36#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {36#true} is VALID [2018-11-14 18:54:44,627 INFO L273 TraceCheckUtils]: 25: Hoare triple {36#true} assume !true; {36#true} is VALID [2018-11-14 18:54:44,627 INFO L273 TraceCheckUtils]: 26: Hoare triple {36#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {36#true} is VALID [2018-11-14 18:54:44,627 INFO L273 TraceCheckUtils]: 27: Hoare triple {36#true} assume true; {36#true} is VALID [2018-11-14 18:54:44,628 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {36#true} {37#false} #70#return; {37#false} is VALID [2018-11-14 18:54:44,628 INFO L273 TraceCheckUtils]: 29: Hoare triple {37#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {37#false} is VALID [2018-11-14 18:54:44,629 INFO L273 TraceCheckUtils]: 30: Hoare triple {37#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {37#false} is VALID [2018-11-14 18:54:44,629 INFO L273 TraceCheckUtils]: 31: Hoare triple {37#false} assume !false; {37#false} is VALID [2018-11-14 18:54:44,635 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-14 18:54:44,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:54:44,638 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:54:44,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:54:44,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:44,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:54:44,998 INFO L256 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2018-11-14 18:54:44,999 INFO L273 TraceCheckUtils]: 1: Hoare triple {36#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {36#true} is VALID [2018-11-14 18:54:44,999 INFO L273 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2018-11-14 18:54:44,999 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #62#return; {36#true} is VALID [2018-11-14 18:54:44,999 INFO L256 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret12 := main(); {36#true} is VALID [2018-11-14 18:54:45,000 INFO L273 TraceCheckUtils]: 5: Hoare triple {36#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~N~0 := #t~nondet3;havoc #t~nondet3; {36#true} is VALID [2018-11-14 18:54:45,000 INFO L273 TraceCheckUtils]: 6: Hoare triple {36#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~N~0 * 4);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0; {36#true} is VALID [2018-11-14 18:54:45,000 INFO L256 TraceCheckUtils]: 7: Hoare triple {36#true} call #t~ret4 := bAnd(~#x~0.base, ~#x~0.offset); {36#true} is VALID [2018-11-14 18:54:45,000 INFO L273 TraceCheckUtils]: 8: Hoare triple {36#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {36#true} is VALID [2018-11-14 18:54:45,001 INFO L273 TraceCheckUtils]: 9: Hoare triple {36#true} assume !true; {37#false} is VALID [2018-11-14 18:54:45,001 INFO L273 TraceCheckUtils]: 10: Hoare triple {37#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {37#false} is VALID [2018-11-14 18:54:45,001 INFO L273 TraceCheckUtils]: 11: Hoare triple {37#false} assume true; {37#false} is VALID [2018-11-14 18:54:45,002 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {37#false} {36#true} #66#return; {37#false} is VALID [2018-11-14 18:54:45,002 INFO L273 TraceCheckUtils]: 13: Hoare triple {37#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~0 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {37#false} is VALID [2018-11-14 18:54:45,002 INFO L256 TraceCheckUtils]: 14: Hoare triple {37#false} call #t~ret7 := bAnd(~#x~0.base, ~#x~0.offset); {37#false} is VALID [2018-11-14 18:54:45,003 INFO L273 TraceCheckUtils]: 15: Hoare triple {37#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {37#false} is VALID [2018-11-14 18:54:45,003 INFO L273 TraceCheckUtils]: 16: Hoare triple {37#false} assume !true; {37#false} is VALID [2018-11-14 18:54:45,003 INFO L273 TraceCheckUtils]: 17: Hoare triple {37#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {37#false} is VALID [2018-11-14 18:54:45,004 INFO L273 TraceCheckUtils]: 18: Hoare triple {37#false} assume true; {37#false} is VALID [2018-11-14 18:54:45,004 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {37#false} {37#false} #68#return; {37#false} is VALID [2018-11-14 18:54:45,005 INFO L273 TraceCheckUtils]: 20: Hoare triple {37#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~1 := 0; {37#false} is VALID [2018-11-14 18:54:45,005 INFO L273 TraceCheckUtils]: 21: Hoare triple {37#false} assume !true; {37#false} is VALID [2018-11-14 18:54:45,006 INFO L273 TraceCheckUtils]: 22: Hoare triple {37#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + (~N~0 - 1) * 4, 4); {37#false} is VALID [2018-11-14 18:54:45,006 INFO L256 TraceCheckUtils]: 23: Hoare triple {37#false} call #t~ret11 := bAnd(~#x~0.base, ~#x~0.offset); {37#false} is VALID [2018-11-14 18:54:45,006 INFO L273 TraceCheckUtils]: 24: Hoare triple {37#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {37#false} is VALID [2018-11-14 18:54:45,006 INFO L273 TraceCheckUtils]: 25: Hoare triple {37#false} assume !true; {37#false} is VALID [2018-11-14 18:54:45,007 INFO L273 TraceCheckUtils]: 26: Hoare triple {37#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {37#false} is VALID [2018-11-14 18:54:45,007 INFO L273 TraceCheckUtils]: 27: Hoare triple {37#false} assume true; {37#false} is VALID [2018-11-14 18:54:45,007 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {37#false} {37#false} #70#return; {37#false} is VALID [2018-11-14 18:54:45,008 INFO L273 TraceCheckUtils]: 29: Hoare triple {37#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {37#false} is VALID [2018-11-14 18:54:45,008 INFO L273 TraceCheckUtils]: 30: Hoare triple {37#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {37#false} is VALID [2018-11-14 18:54:45,008 INFO L273 TraceCheckUtils]: 31: Hoare triple {37#false} assume !false; {37#false} is VALID [2018-11-14 18:54:45,010 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-14 18:54:45,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 18:54:45,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2018-11-14 18:54:45,045 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-14 18:54:45,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:54:45,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:54:45,237 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:45,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:54:45,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:54:45,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:54:45,248 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-11-14 18:54:45,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:45,385 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2018-11-14 18:54:45,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:54:45,386 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-14 18:54:45,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:54:45,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:54:45,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 73 transitions. [2018-11-14 18:54:45,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:54:45,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 73 transitions. [2018-11-14 18:54:45,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 73 transitions. [2018-11-14 18:54:45,799 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:45,823 INFO L225 Difference]: With dead ends: 58 [2018-11-14 18:54:45,823 INFO L226 Difference]: Without dead ends: 27 [2018-11-14 18:54:45,832 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 33 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:54:45,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-14 18:54:45,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-14 18:54:45,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:54:45,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-14 18:54:45,996 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-14 18:54:45,997 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-14 18:54:46,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:46,010 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-14 18:54:46,011 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-14 18:54:46,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:46,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:46,012 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-14 18:54:46,012 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-14 18:54:46,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:46,022 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-14 18:54:46,024 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-14 18:54:46,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:46,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:46,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:54:46,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:54:46,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 18:54:46,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-14 18:54:46,035 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 32 [2018-11-14 18:54:46,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:54:46,035 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-14 18:54:46,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:54:46,036 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-14 18:54:46,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-14 18:54:46,038 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:54:46,038 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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:54:46,038 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:54:46,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:54:46,039 INFO L82 PathProgramCache]: Analyzing trace with hash -841061000, now seen corresponding path program 1 times [2018-11-14 18:54:46,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:54:46,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:54:46,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:46,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:54:46,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:46,265 INFO L256 TraceCheckUtils]: 0: Hoare triple {297#true} call ULTIMATE.init(); {297#true} is VALID [2018-11-14 18:54:46,265 INFO L273 TraceCheckUtils]: 1: Hoare triple {297#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {297#true} is VALID [2018-11-14 18:54:46,266 INFO L273 TraceCheckUtils]: 2: Hoare triple {297#true} assume true; {297#true} is VALID [2018-11-14 18:54:46,266 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {297#true} {297#true} #62#return; {297#true} is VALID [2018-11-14 18:54:46,266 INFO L256 TraceCheckUtils]: 4: Hoare triple {297#true} call #t~ret12 := main(); {297#true} is VALID [2018-11-14 18:54:46,266 INFO L273 TraceCheckUtils]: 5: Hoare triple {297#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~N~0 := #t~nondet3;havoc #t~nondet3; {297#true} is VALID [2018-11-14 18:54:46,276 INFO L273 TraceCheckUtils]: 6: Hoare triple {297#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~N~0 * 4);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0; {299#(<= 2 ~N~0)} is VALID [2018-11-14 18:54:46,277 INFO L256 TraceCheckUtils]: 7: Hoare triple {299#(<= 2 ~N~0)} call #t~ret4 := bAnd(~#x~0.base, ~#x~0.offset); {297#true} is VALID [2018-11-14 18:54:46,286 INFO L273 TraceCheckUtils]: 8: Hoare triple {297#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {300#(= bAnd_~i~0 1)} is VALID [2018-11-14 18:54:46,292 INFO L273 TraceCheckUtils]: 9: Hoare triple {300#(= bAnd_~i~0 1)} assume true; {300#(= bAnd_~i~0 1)} is VALID [2018-11-14 18:54:46,295 INFO L273 TraceCheckUtils]: 10: Hoare triple {300#(= bAnd_~i~0 1)} assume !(~i~0 < ~N~0); {301#(<= ~N~0 1)} is VALID [2018-11-14 18:54:46,295 INFO L273 TraceCheckUtils]: 11: Hoare triple {301#(<= ~N~0 1)} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {301#(<= ~N~0 1)} is VALID [2018-11-14 18:54:46,298 INFO L273 TraceCheckUtils]: 12: Hoare triple {301#(<= ~N~0 1)} assume true; {301#(<= ~N~0 1)} is VALID [2018-11-14 18:54:46,300 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {301#(<= ~N~0 1)} {299#(<= 2 ~N~0)} #66#return; {298#false} is VALID [2018-11-14 18:54:46,300 INFO L273 TraceCheckUtils]: 14: Hoare triple {298#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~0 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {298#false} is VALID [2018-11-14 18:54:46,300 INFO L256 TraceCheckUtils]: 15: Hoare triple {298#false} call #t~ret7 := bAnd(~#x~0.base, ~#x~0.offset); {297#true} is VALID [2018-11-14 18:54:46,301 INFO L273 TraceCheckUtils]: 16: Hoare triple {297#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {297#true} is VALID [2018-11-14 18:54:46,301 INFO L273 TraceCheckUtils]: 17: Hoare triple {297#true} assume true; {297#true} is VALID [2018-11-14 18:54:46,301 INFO L273 TraceCheckUtils]: 18: Hoare triple {297#true} assume !(~i~0 < ~N~0); {297#true} is VALID [2018-11-14 18:54:46,302 INFO L273 TraceCheckUtils]: 19: Hoare triple {297#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {297#true} is VALID [2018-11-14 18:54:46,302 INFO L273 TraceCheckUtils]: 20: Hoare triple {297#true} assume true; {297#true} is VALID [2018-11-14 18:54:46,302 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {297#true} {298#false} #68#return; {298#false} is VALID [2018-11-14 18:54:46,303 INFO L273 TraceCheckUtils]: 22: Hoare triple {298#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~1 := 0; {298#false} is VALID [2018-11-14 18:54:46,303 INFO L273 TraceCheckUtils]: 23: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-14 18:54:46,303 INFO L273 TraceCheckUtils]: 24: Hoare triple {298#false} assume !(~i~1 < ~N~0 - 1); {298#false} is VALID [2018-11-14 18:54:46,303 INFO L273 TraceCheckUtils]: 25: Hoare triple {298#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + (~N~0 - 1) * 4, 4); {298#false} is VALID [2018-11-14 18:54:46,304 INFO L256 TraceCheckUtils]: 26: Hoare triple {298#false} call #t~ret11 := bAnd(~#x~0.base, ~#x~0.offset); {297#true} is VALID [2018-11-14 18:54:46,304 INFO L273 TraceCheckUtils]: 27: Hoare triple {297#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {297#true} is VALID [2018-11-14 18:54:46,305 INFO L273 TraceCheckUtils]: 28: Hoare triple {297#true} assume true; {297#true} is VALID [2018-11-14 18:54:46,305 INFO L273 TraceCheckUtils]: 29: Hoare triple {297#true} assume !(~i~0 < ~N~0); {297#true} is VALID [2018-11-14 18:54:46,305 INFO L273 TraceCheckUtils]: 30: Hoare triple {297#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {297#true} is VALID [2018-11-14 18:54:46,306 INFO L273 TraceCheckUtils]: 31: Hoare triple {297#true} assume true; {297#true} is VALID [2018-11-14 18:54:46,306 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {297#true} {298#false} #70#return; {298#false} is VALID [2018-11-14 18:54:46,306 INFO L273 TraceCheckUtils]: 33: Hoare triple {298#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {298#false} is VALID [2018-11-14 18:54:46,307 INFO L273 TraceCheckUtils]: 34: Hoare triple {298#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {298#false} is VALID [2018-11-14 18:54:46,307 INFO L273 TraceCheckUtils]: 35: Hoare triple {298#false} assume !false; {298#false} is VALID [2018-11-14 18:54:46,310 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-14 18:54:46,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:54:46,310 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:54:46,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:54:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:46,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:54:46,624 INFO L256 TraceCheckUtils]: 0: Hoare triple {297#true} call ULTIMATE.init(); {297#true} is VALID [2018-11-14 18:54:46,624 INFO L273 TraceCheckUtils]: 1: Hoare triple {297#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {297#true} is VALID [2018-11-14 18:54:46,625 INFO L273 TraceCheckUtils]: 2: Hoare triple {297#true} assume true; {297#true} is VALID [2018-11-14 18:54:46,625 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {297#true} {297#true} #62#return; {297#true} is VALID [2018-11-14 18:54:46,625 INFO L256 TraceCheckUtils]: 4: Hoare triple {297#true} call #t~ret12 := main(); {297#true} is VALID [2018-11-14 18:54:46,626 INFO L273 TraceCheckUtils]: 5: Hoare triple {297#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~N~0 := #t~nondet3;havoc #t~nondet3; {297#true} is VALID [2018-11-14 18:54:46,640 INFO L273 TraceCheckUtils]: 6: Hoare triple {297#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~N~0 * 4);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0; {299#(<= 2 ~N~0)} is VALID [2018-11-14 18:54:46,655 INFO L256 TraceCheckUtils]: 7: Hoare triple {299#(<= 2 ~N~0)} call #t~ret4 := bAnd(~#x~0.base, ~#x~0.offset); {299#(<= 2 ~N~0)} is VALID [2018-11-14 18:54:46,669 INFO L273 TraceCheckUtils]: 8: Hoare triple {299#(<= 2 ~N~0)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {329#(and (<= 2 ~N~0) (<= bAnd_~i~0 1))} is VALID [2018-11-14 18:54:46,684 INFO L273 TraceCheckUtils]: 9: Hoare triple {329#(and (<= 2 ~N~0) (<= bAnd_~i~0 1))} assume true; {329#(and (<= 2 ~N~0) (<= bAnd_~i~0 1))} is VALID [2018-11-14 18:54:46,696 INFO L273 TraceCheckUtils]: 10: Hoare triple {329#(and (<= 2 ~N~0) (<= bAnd_~i~0 1))} assume !(~i~0 < ~N~0); {298#false} is VALID [2018-11-14 18:54:46,696 INFO L273 TraceCheckUtils]: 11: Hoare triple {298#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {298#false} is VALID [2018-11-14 18:54:46,697 INFO L273 TraceCheckUtils]: 12: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-14 18:54:46,697 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {298#false} {299#(<= 2 ~N~0)} #66#return; {298#false} is VALID [2018-11-14 18:54:46,697 INFO L273 TraceCheckUtils]: 14: Hoare triple {298#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~0 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {298#false} is VALID [2018-11-14 18:54:46,698 INFO L256 TraceCheckUtils]: 15: Hoare triple {298#false} call #t~ret7 := bAnd(~#x~0.base, ~#x~0.offset); {298#false} is VALID [2018-11-14 18:54:46,698 INFO L273 TraceCheckUtils]: 16: Hoare triple {298#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {298#false} is VALID [2018-11-14 18:54:46,698 INFO L273 TraceCheckUtils]: 17: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-14 18:54:46,699 INFO L273 TraceCheckUtils]: 18: Hoare triple {298#false} assume !(~i~0 < ~N~0); {298#false} is VALID [2018-11-14 18:54:46,699 INFO L273 TraceCheckUtils]: 19: Hoare triple {298#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {298#false} is VALID [2018-11-14 18:54:46,699 INFO L273 TraceCheckUtils]: 20: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-14 18:54:46,700 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {298#false} {298#false} #68#return; {298#false} is VALID [2018-11-14 18:54:46,700 INFO L273 TraceCheckUtils]: 22: Hoare triple {298#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~1 := 0; {298#false} is VALID [2018-11-14 18:54:46,701 INFO L273 TraceCheckUtils]: 23: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-14 18:54:46,701 INFO L273 TraceCheckUtils]: 24: Hoare triple {298#false} assume !(~i~1 < ~N~0 - 1); {298#false} is VALID [2018-11-14 18:54:46,701 INFO L273 TraceCheckUtils]: 25: Hoare triple {298#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + (~N~0 - 1) * 4, 4); {298#false} is VALID [2018-11-14 18:54:46,707 INFO L256 TraceCheckUtils]: 26: Hoare triple {298#false} call #t~ret11 := bAnd(~#x~0.base, ~#x~0.offset); {298#false} is VALID [2018-11-14 18:54:46,707 INFO L273 TraceCheckUtils]: 27: Hoare triple {298#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {298#false} is VALID [2018-11-14 18:54:46,708 INFO L273 TraceCheckUtils]: 28: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-14 18:54:46,708 INFO L273 TraceCheckUtils]: 29: Hoare triple {298#false} assume !(~i~0 < ~N~0); {298#false} is VALID [2018-11-14 18:54:46,708 INFO L273 TraceCheckUtils]: 30: Hoare triple {298#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {298#false} is VALID [2018-11-14 18:54:46,713 INFO L273 TraceCheckUtils]: 31: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-14 18:54:46,713 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {298#false} {298#false} #70#return; {298#false} is VALID [2018-11-14 18:54:46,714 INFO L273 TraceCheckUtils]: 33: Hoare triple {298#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {298#false} is VALID [2018-11-14 18:54:46,714 INFO L273 TraceCheckUtils]: 34: Hoare triple {298#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {298#false} is VALID [2018-11-14 18:54:46,714 INFO L273 TraceCheckUtils]: 35: Hoare triple {298#false} assume !false; {298#false} is VALID [2018-11-14 18:54:46,717 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 18:54:46,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 18:54:46,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2018-11-14 18:54:46,755 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-11-14 18:54:46,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:54:46,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:54:46,997 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:46,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:54:46,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:54:46,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:54:46,998 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 6 states. [2018-11-14 18:54:47,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:47,446 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-14 18:54:47,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:54:47,446 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-11-14 18:54:47,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:54:47,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:54:47,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-14 18:54:47,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:54:47,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-14 18:54:47,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2018-11-14 18:54:47,603 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:47,606 INFO L225 Difference]: With dead ends: 49 [2018-11-14 18:54:47,606 INFO L226 Difference]: Without dead ends: 30 [2018-11-14 18:54:47,608 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:54:47,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-14 18:54:47,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-14 18:54:47,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:54:47,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-14 18:54:47,630 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-14 18:54:47,630 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-14 18:54:47,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:47,634 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-14 18:54:47,634 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-14 18:54:47,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:47,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:47,635 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-14 18:54:47,635 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-14 18:54:47,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:47,639 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-14 18:54:47,639 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-14 18:54:47,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:47,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:47,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:54:47,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:54:47,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 18:54:47,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-14 18:54:47,644 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 36 [2018-11-14 18:54:47,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:54:47,644 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-14 18:54:47,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:54:47,644 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-14 18:54:47,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-14 18:54:47,646 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:54:47,646 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 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:54:47,647 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:54:47,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:54:47,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1624901070, now seen corresponding path program 1 times [2018-11-14 18:54:47,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:54:47,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:54:47,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:47,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:54:47,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:54:47,793 INFO L256 TraceCheckUtils]: 0: Hoare triple {578#true} call ULTIMATE.init(); {578#true} is VALID [2018-11-14 18:54:47,794 INFO L273 TraceCheckUtils]: 1: Hoare triple {578#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {578#true} is VALID [2018-11-14 18:54:47,794 INFO L273 TraceCheckUtils]: 2: Hoare triple {578#true} assume true; {578#true} is VALID [2018-11-14 18:54:47,794 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {578#true} {578#true} #62#return; {578#true} is VALID [2018-11-14 18:54:47,794 INFO L256 TraceCheckUtils]: 4: Hoare triple {578#true} call #t~ret12 := main(); {578#true} is VALID [2018-11-14 18:54:47,794 INFO L273 TraceCheckUtils]: 5: Hoare triple {578#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~N~0 := #t~nondet3;havoc #t~nondet3; {578#true} is VALID [2018-11-14 18:54:47,795 INFO L273 TraceCheckUtils]: 6: Hoare triple {578#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~N~0 * 4);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0; {580#(<= 2 ~N~0)} is VALID [2018-11-14 18:54:47,796 INFO L256 TraceCheckUtils]: 7: Hoare triple {580#(<= 2 ~N~0)} call #t~ret4 := bAnd(~#x~0.base, ~#x~0.offset); {578#true} is VALID [2018-11-14 18:54:47,796 INFO L273 TraceCheckUtils]: 8: Hoare triple {578#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {578#true} is VALID [2018-11-14 18:54:47,796 INFO L273 TraceCheckUtils]: 9: Hoare triple {578#true} assume true; {578#true} is VALID [2018-11-14 18:54:47,796 INFO L273 TraceCheckUtils]: 10: Hoare triple {578#true} assume !!(~i~0 < ~N~0);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {578#true} is VALID [2018-11-14 18:54:47,796 INFO L273 TraceCheckUtils]: 11: Hoare triple {578#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {578#true} is VALID [2018-11-14 18:54:47,797 INFO L273 TraceCheckUtils]: 12: Hoare triple {578#true} assume true; {578#true} is VALID [2018-11-14 18:54:47,797 INFO L273 TraceCheckUtils]: 13: Hoare triple {578#true} assume !(~i~0 < ~N~0); {578#true} is VALID [2018-11-14 18:54:47,797 INFO L273 TraceCheckUtils]: 14: Hoare triple {578#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {578#true} is VALID [2018-11-14 18:54:47,797 INFO L273 TraceCheckUtils]: 15: Hoare triple {578#true} assume true; {578#true} is VALID [2018-11-14 18:54:47,799 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {578#true} {580#(<= 2 ~N~0)} #66#return; {580#(<= 2 ~N~0)} is VALID [2018-11-14 18:54:47,799 INFO L273 TraceCheckUtils]: 17: Hoare triple {580#(<= 2 ~N~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~0 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {580#(<= 2 ~N~0)} is VALID [2018-11-14 18:54:47,799 INFO L256 TraceCheckUtils]: 18: Hoare triple {580#(<= 2 ~N~0)} call #t~ret7 := bAnd(~#x~0.base, ~#x~0.offset); {578#true} is VALID [2018-11-14 18:54:47,800 INFO L273 TraceCheckUtils]: 19: Hoare triple {578#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {578#true} is VALID [2018-11-14 18:54:47,800 INFO L273 TraceCheckUtils]: 20: Hoare triple {578#true} assume true; {578#true} is VALID [2018-11-14 18:54:47,800 INFO L273 TraceCheckUtils]: 21: Hoare triple {578#true} assume !!(~i~0 < ~N~0);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {578#true} is VALID [2018-11-14 18:54:47,800 INFO L273 TraceCheckUtils]: 22: Hoare triple {578#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {578#true} is VALID [2018-11-14 18:54:47,801 INFO L273 TraceCheckUtils]: 23: Hoare triple {578#true} assume true; {578#true} is VALID [2018-11-14 18:54:47,801 INFO L273 TraceCheckUtils]: 24: Hoare triple {578#true} assume !(~i~0 < ~N~0); {578#true} is VALID [2018-11-14 18:54:47,801 INFO L273 TraceCheckUtils]: 25: Hoare triple {578#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {578#true} is VALID [2018-11-14 18:54:47,801 INFO L273 TraceCheckUtils]: 26: Hoare triple {578#true} assume true; {578#true} is VALID [2018-11-14 18:54:47,803 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {578#true} {580#(<= 2 ~N~0)} #68#return; {580#(<= 2 ~N~0)} is VALID [2018-11-14 18:54:47,805 INFO L273 TraceCheckUtils]: 28: Hoare triple {580#(<= 2 ~N~0)} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~1 := 0; {581#(and (<= 2 ~N~0) (= main_~i~1 0))} is VALID [2018-11-14 18:54:47,808 INFO L273 TraceCheckUtils]: 29: Hoare triple {581#(and (<= 2 ~N~0) (= main_~i~1 0))} assume true; {581#(and (<= 2 ~N~0) (= main_~i~1 0))} is VALID [2018-11-14 18:54:47,809 INFO L273 TraceCheckUtils]: 30: Hoare triple {581#(and (<= 2 ~N~0) (= main_~i~1 0))} assume !(~i~1 < ~N~0 - 1); {579#false} is VALID [2018-11-14 18:54:47,809 INFO L273 TraceCheckUtils]: 31: Hoare triple {579#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + (~N~0 - 1) * 4, 4); {579#false} is VALID [2018-11-14 18:54:47,809 INFO L256 TraceCheckUtils]: 32: Hoare triple {579#false} call #t~ret11 := bAnd(~#x~0.base, ~#x~0.offset); {578#true} is VALID [2018-11-14 18:54:47,809 INFO L273 TraceCheckUtils]: 33: Hoare triple {578#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {578#true} is VALID [2018-11-14 18:54:47,809 INFO L273 TraceCheckUtils]: 34: Hoare triple {578#true} assume true; {578#true} is VALID [2018-11-14 18:54:47,810 INFO L273 TraceCheckUtils]: 35: Hoare triple {578#true} assume !!(~i~0 < ~N~0);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {578#true} is VALID [2018-11-14 18:54:47,810 INFO L273 TraceCheckUtils]: 36: Hoare triple {578#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {578#true} is VALID [2018-11-14 18:54:47,810 INFO L273 TraceCheckUtils]: 37: Hoare triple {578#true} assume true; {578#true} is VALID [2018-11-14 18:54:47,810 INFO L273 TraceCheckUtils]: 38: Hoare triple {578#true} assume !(~i~0 < ~N~0); {578#true} is VALID [2018-11-14 18:54:47,810 INFO L273 TraceCheckUtils]: 39: Hoare triple {578#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {578#true} is VALID [2018-11-14 18:54:47,811 INFO L273 TraceCheckUtils]: 40: Hoare triple {578#true} assume true; {578#true} is VALID [2018-11-14 18:54:47,811 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {578#true} {579#false} #70#return; {579#false} is VALID [2018-11-14 18:54:47,811 INFO L273 TraceCheckUtils]: 42: Hoare triple {579#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {579#false} is VALID [2018-11-14 18:54:47,812 INFO L273 TraceCheckUtils]: 43: Hoare triple {579#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {579#false} is VALID [2018-11-14 18:54:47,812 INFO L273 TraceCheckUtils]: 44: Hoare triple {579#false} assume !false; {579#false} is VALID [2018-11-14 18:54:47,817 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-14 18:54:47,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:54:47,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 18:54:47,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-11-14 18:54:47,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:54:47,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:54:47,908 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:47,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:54:47,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:54:47,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:54:47,909 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 4 states. [2018-11-14 18:54:48,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:48,067 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-11-14 18:54:48,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:54:48,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-11-14 18:54:48,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:54:48,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:54:48,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2018-11-14 18:54:48,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:54:48,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2018-11-14 18:54:48,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 47 transitions. [2018-11-14 18:54:48,146 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:54:48,148 INFO L225 Difference]: With dead ends: 47 [2018-11-14 18:54:48,148 INFO L226 Difference]: Without dead ends: 32 [2018-11-14 18:54:48,149 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:54:48,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-14 18:54:48,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-14 18:54:48,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:54:48,176 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-14 18:54:48,176 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-14 18:54:48,176 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-14 18:54:48,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:48,180 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-14 18:54:48,181 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-14 18:54:48,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:48,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:48,182 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-14 18:54:48,182 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-14 18:54:48,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:54:48,185 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-14 18:54:48,185 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-14 18:54:48,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:54:48,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:54:48,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:54:48,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:54:48,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 18:54:48,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-11-14 18:54:48,189 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 45 [2018-11-14 18:54:48,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:54:48,189 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-11-14 18:54:48,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:54:48,190 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-14 18:54:48,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-14 18:54:48,192 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:54:48,192 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:54:48,192 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:54:48,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:54:48,193 INFO L82 PathProgramCache]: Analyzing trace with hash -394504529, now seen corresponding path program 1 times [2018-11-14 18:54:48,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:54:48,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:54:48,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:48,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:54:48,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:54:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 18:54:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 18:54:48,372 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-14 18:54:48,440 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-14 18:54:48,441 WARN L170 areAnnotationChecker]: bAndENTRY has no Hoare annotation [2018-11-14 18:54:48,441 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 18:54:48,441 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 18:54:48,441 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-14 18:54:48,441 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 18:54:48,441 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2018-11-14 18:54:48,441 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2018-11-14 18:54:48,442 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 18:54:48,442 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 18:54:48,442 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2018-11-14 18:54:48,442 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2018-11-14 18:54:48,442 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 18:54:48,442 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-14 18:54:48,442 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-14 18:54:48,442 WARN L170 areAnnotationChecker]: L13-5 has no Hoare annotation [2018-11-14 18:54:48,442 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 18:54:48,442 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2018-11-14 18:54:48,442 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2018-11-14 18:54:48,443 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2018-11-14 18:54:48,443 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2018-11-14 18:54:48,443 WARN L170 areAnnotationChecker]: bAndFINAL has no Hoare annotation [2018-11-14 18:54:48,443 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2018-11-14 18:54:48,443 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 18:54:48,443 WARN L170 areAnnotationChecker]: bAndEXIT has no Hoare annotation [2018-11-14 18:54:48,443 WARN L170 areAnnotationChecker]: bAndEXIT has no Hoare annotation [2018-11-14 18:54:48,443 WARN L170 areAnnotationChecker]: bAndEXIT has no Hoare annotation [2018-11-14 18:54:48,443 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-11-14 18:54:48,443 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-11-14 18:54:48,444 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 18:54:48,444 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2018-11-14 18:54:48,444 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2018-11-14 18:54:48,444 WARN L170 areAnnotationChecker]: L34-4 has no Hoare annotation [2018-11-14 18:54:48,444 WARN L170 areAnnotationChecker]: L34-4 has no Hoare annotation [2018-11-14 18:54:48,444 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2018-11-14 18:54:48,444 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2018-11-14 18:54:48,444 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2018-11-14 18:54:48,444 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2018-11-14 18:54:48,444 WARN L170 areAnnotationChecker]: L34-5 has no Hoare annotation [2018-11-14 18:54:48,444 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-14 18:54:48,445 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-14 18:54:48,445 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2018-11-14 18:54:48,445 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2018-11-14 18:54:48,445 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2018-11-14 18:54:48,445 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2018-11-14 18:54:48,445 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 18:54:48,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 06:54:48 BoogieIcfgContainer [2018-11-14 18:54:48,448 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 18:54:48,449 INFO L168 Benchmark]: Toolchain (without parser) took 5402.53 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 727.2 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -503.5 MB). Peak memory consumption was 223.7 MB. Max. memory is 7.1 GB. [2018-11-14 18:54:48,451 INFO L168 Benchmark]: CDTParser took 0.19 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:54:48,452 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.65 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:54:48,453 INFO L168 Benchmark]: Boogie Preprocessor took 61.81 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 18:54:48,453 INFO L168 Benchmark]: RCFGBuilder took 810.63 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 727.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -762.5 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-11-14 18:54:48,454 INFO L168 Benchmark]: TraceAbstraction took 4205.19 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 248.4 MB). Peak memory consumption was 248.4 MB. Max. memory is 7.1 GB. [2018-11-14 18:54:48,458 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.19 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. * CACSL2BoogieTranslator took 319.65 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 61.81 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 810.63 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 727.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -762.5 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4205.19 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 248.4 MB). Peak memory consumption was 248.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 41]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 14. Possible FailurePath: [L6] int N; VAL [\old(N)=4294967298, N=0] [L21] N = __VERIFIER_nondet_int() [L22] COND TRUE N > 1 [L23] FCALL int x[N]; [L24] int temp; [L25] int ret; [L26] int ret2; [L27] int ret5; VAL [\old(N)=0, N=2, x={4294967301:0}] [L29] CALL, EXPR bAnd(x) VAL [\old(N)=0, N=2, x={4294967301:0}] [L10] int i; [L11] long long res; [L12] EXPR, FCALL x[0] [L12] res = x[0] [L13] i = 1 VAL [\old(N)=0, i=1, N=2, res=4294967299, x={4294967301:0}, x={4294967301:0}] [L13] COND TRUE i < N [L14] EXPR, FCALL x[i] [L14] res = res & x[i] [L13] i++ VAL [\old(N)=0, i=2, N=2, x={4294967301:0}, x={4294967301:0}] [L13] COND FALSE !(i < N) VAL [\old(N)=0, i=2, N=2, x={4294967301:0}, x={4294967301:0}] [L16] RET return res; VAL [\old(N)=0, \result=-1, i=2, N=2, res=4294967295, x={4294967301:0}, x={4294967301:0}] [L29] EXPR bAnd(x) VAL [\old(N)=0, bAnd(x)=-1, N=2, x={4294967301:0}] [L29] ret = bAnd(x) [L31] EXPR, FCALL x[0] [L31] temp=x[0] [L31] EXPR, FCALL x[1] [L31] FCALL x[0] = x[1] [L31] FCALL x[1] = temp VAL [\old(N)=0, N=2, ret=-1, temp=4294967299, x={4294967301:0}] [L32] CALL, EXPR bAnd(x) VAL [\old(N)=0, N=2, x={4294967301:0}] [L10] int i; [L11] long long res; [L12] EXPR, FCALL x[0] [L12] res = x[0] [L13] i = 1 VAL [\old(N)=0, i=1, N=2, res=4294967297, x={4294967301:0}, x={4294967301:0}] [L13] COND TRUE i < N [L14] EXPR, FCALL x[i] [L14] res = res & x[i] [L13] i++ VAL [\old(N)=0, i=2, N=2, x={4294967301:0}, x={4294967301:0}] [L13] COND FALSE !(i < N) VAL [\old(N)=0, i=2, N=2, x={4294967301:0}, x={4294967301:0}] [L16] RET return res; VAL [\old(N)=0, \result=-2147483646, i=2, N=2, res=2147483650, x={4294967301:0}, x={4294967301:0}] [L32] EXPR bAnd(x) VAL [\old(N)=0, bAnd(x)=-2147483646, N=2, ret=-1, temp=4294967299, x={4294967301:0}] [L32] ret2 = bAnd(x) [L33] EXPR, FCALL x[0] [L33] temp=x[0] [L34] int i =0 ; VAL [\old(N)=0, i=0, N=2, ret=-1, ret2=-2147483646, temp=4294967297, x={4294967301:0}] [L34] COND TRUE i