java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/id_trans_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:33:39,427 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:33:39,429 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:33:39,445 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:33:39,445 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:33:39,447 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:33:39,448 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:33:39,451 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:33:39,453 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:33:39,454 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:33:39,462 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:33:39,462 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:33:39,463 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:33:39,464 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:33:39,465 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:33:39,468 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:33:39,470 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:33:39,471 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:33:39,475 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:33:39,477 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:33:39,480 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:33:39,481 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:33:39,483 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:33:39,483 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:33:39,484 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:33:39,485 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:33:39,485 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:33:39,486 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:33:39,488 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:33:39,490 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:33:39,490 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:33:39,491 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:33:39,491 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:33:39,491 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:33:39,492 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:33:39,494 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:33:39,495 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 17:33:39,524 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:33:39,524 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:33:39,525 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:33:39,525 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:33:39,530 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:33:39,530 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:33:39,532 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:33:39,532 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:33:39,532 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:33:39,532 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:33:39,532 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:33:39,533 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:33:39,533 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:33:39,533 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:33:39,533 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:33:39,533 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:33:39,535 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:33:39,535 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:33:39,535 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:33:39,535 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:33:39,536 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:33:39,536 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:33:39,536 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:33:39,536 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:33:39,536 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:33:39,537 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:33:39,537 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:33:39,537 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:33:39,537 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:33:39,538 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:33:39,590 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:33:39,602 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:33:39,606 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:33:39,607 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:33:39,608 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:33:39,609 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/id_trans_false-unreach-call_true-termination.i [2018-11-14 17:33:39,665 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17ed86559/c891b5cd8c534dadb92202d9dbab41ff/FLAG1209c6788 [2018-11-14 17:33:40,107 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:33:40,108 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/id_trans_false-unreach-call_true-termination.i [2018-11-14 17:33:40,114 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17ed86559/c891b5cd8c534dadb92202d9dbab41ff/FLAG1209c6788 [2018-11-14 17:33:40,128 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17ed86559/c891b5cd8c534dadb92202d9dbab41ff [2018-11-14 17:33:40,139 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:33:40,140 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:33:40,142 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:33:40,142 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:33:40,146 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:33:40,147 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:33:40" (1/1) ... [2018-11-14 17:33:40,150 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3245e527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:33:40, skipping insertion in model container [2018-11-14 17:33:40,150 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:33:40" (1/1) ... [2018-11-14 17:33:40,161 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:33:40,181 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:33:40,399 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:33:40,407 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:33:40,428 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:33:40,445 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:33:40,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:33:40 WrapperNode [2018-11-14 17:33:40,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:33:40,446 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:33:40,446 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:33:40,447 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:33:40,460 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:33:40" (1/1) ... [2018-11-14 17:33:40,460 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:33:40" (1/1) ... [2018-11-14 17:33:40,467 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:33:40" (1/1) ... [2018-11-14 17:33:40,467 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:33:40" (1/1) ... [2018-11-14 17:33:40,473 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:33:40" (1/1) ... [2018-11-14 17:33:40,478 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:33:40" (1/1) ... [2018-11-14 17:33:40,479 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:33:40" (1/1) ... [2018-11-14 17:33:40,481 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:33:40,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:33:40,481 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:33:40,482 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:33:40,483 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:33:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:33:40,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:33:40,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:33:40,607 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:33:40,607 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:33:40,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:33:40,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 17:33:40,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:33:40,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:33:40,608 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:33:40,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:33:40,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:33:41,122 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:33:41,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:33:41 BoogieIcfgContainer [2018-11-14 17:33:41,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:33:41,124 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:33:41,125 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:33:41,128 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:33:41,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:33:40" (1/3) ... [2018-11-14 17:33:41,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ea6763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:33:41, skipping insertion in model container [2018-11-14 17:33:41,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:33:40" (2/3) ... [2018-11-14 17:33:41,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ea6763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:33:41, skipping insertion in model container [2018-11-14 17:33:41,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:33:41" (3/3) ... [2018-11-14 17:33:41,131 INFO L112 eAbstractionObserver]: Analyzing ICFG id_trans_false-unreach-call_true-termination.i [2018-11-14 17:33:41,141 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:33:41,151 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:33:41,164 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:33:41,193 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:33:41,194 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:33:41,194 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:33:41,194 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:33:41,194 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:33:41,194 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:33:41,194 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:33:41,194 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:33:41,195 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:33:41,213 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-14 17:33:41,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 17:33:41,219 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:33:41,220 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:33:41,222 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:33:41,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:33:41,228 INFO L82 PathProgramCache]: Analyzing trace with hash -243865802, now seen corresponding path program 1 times [2018-11-14 17:33:41,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:33:41,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:33:41,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:41,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:33:41,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:41,548 INFO L256 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2018-11-14 17:33:41,551 INFO L273 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2018-11-14 17:33:41,552 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #41#return; {27#true} is VALID [2018-11-14 17:33:41,552 INFO L256 TraceCheckUtils]: 3: Hoare triple {27#true} call #t~ret5 := main(); {27#true} is VALID [2018-11-14 17:33:41,552 INFO L273 TraceCheckUtils]: 4: Hoare triple {27#true} havoc ~idBitLength~0;havoc ~material_length~0;havoc ~nlen~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~nlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~idBitLength~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~material_length~0 := #t~nondet3;havoc #t~nondet3; {27#true} is VALID [2018-11-14 17:33:41,557 INFO L273 TraceCheckUtils]: 5: Hoare triple {27#true} assume !!(~nlen~0 == (if ~idBitLength~0 < 0 && ~idBitLength~0 % 32 != 0 then ~idBitLength~0 / 32 + 1 else ~idBitLength~0 / 32));~j~0 := 0; {29#(<= 0 main_~j~0)} is VALID [2018-11-14 17:33:41,563 INFO L273 TraceCheckUtils]: 6: Hoare triple {29#(<= 0 main_~j~0)} assume true; {29#(<= 0 main_~j~0)} is VALID [2018-11-14 17:33:41,572 INFO L273 TraceCheckUtils]: 7: Hoare triple {29#(<= 0 main_~j~0)} assume !!(~j~0 < (if ~idBitLength~0 < 0 && ~idBitLength~0 % 8 != 0 then ~idBitLength~0 / 8 + 1 else ~idBitLength~0 / 8) && ~j~0 < ~material_length~0); {29#(<= 0 main_~j~0)} is VALID [2018-11-14 17:33:41,586 INFO L256 TraceCheckUtils]: 8: Hoare triple {29#(<= 0 main_~j~0)} call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); {30#(= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-14 17:33:41,599 INFO L273 TraceCheckUtils]: 9: Hoare triple {30#(= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {31#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:33:41,610 INFO L273 TraceCheckUtils]: 10: Hoare triple {31#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {28#false} is VALID [2018-11-14 17:33:41,610 INFO L273 TraceCheckUtils]: 11: Hoare triple {28#false} assume !false; {28#false} is VALID [2018-11-14 17:33:41,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:41,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:33:41,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:33:41,622 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-14 17:33:41,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:33:41,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:33:41,735 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:41,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:33:41,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:33:41,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:33:41,747 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2018-11-14 17:33:42,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:42,336 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2018-11-14 17:33:42,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:33:42,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-14 17:33:42,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:33:42,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:33:42,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2018-11-14 17:33:42,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:33:42,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2018-11-14 17:33:42,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2018-11-14 17:33:42,843 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:42,860 INFO L225 Difference]: With dead ends: 48 [2018-11-14 17:33:42,861 INFO L226 Difference]: Without dead ends: 23 [2018-11-14 17:33:42,867 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:33:42,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-14 17:33:42,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-14 17:33:42,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:33:42,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2018-11-14 17:33:42,966 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-14 17:33:42,966 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-14 17:33:42,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:42,973 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-14 17:33:42,973 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-14 17:33:42,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:42,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:42,974 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-14 17:33:42,974 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-14 17:33:42,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:42,979 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-14 17:33:42,979 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-14 17:33:42,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:42,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:42,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:33:42,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:33:42,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 17:33:42,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-14 17:33:42,988 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 12 [2018-11-14 17:33:42,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:33:42,989 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-14 17:33:42,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:33:42,989 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-14 17:33:42,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 17:33:42,990 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:33:42,991 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:33:42,991 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:33:42,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:33:42,992 INFO L82 PathProgramCache]: Analyzing trace with hash 662571400, now seen corresponding path program 1 times [2018-11-14 17:33:42,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:33:42,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:33:42,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:42,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:33:42,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:43,203 INFO L256 TraceCheckUtils]: 0: Hoare triple {181#true} call ULTIMATE.init(); {181#true} is VALID [2018-11-14 17:33:43,204 INFO L273 TraceCheckUtils]: 1: Hoare triple {181#true} assume true; {181#true} is VALID [2018-11-14 17:33:43,204 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {181#true} {181#true} #41#return; {181#true} is VALID [2018-11-14 17:33:43,205 INFO L256 TraceCheckUtils]: 3: Hoare triple {181#true} call #t~ret5 := main(); {181#true} is VALID [2018-11-14 17:33:43,206 INFO L273 TraceCheckUtils]: 4: Hoare triple {181#true} havoc ~idBitLength~0;havoc ~material_length~0;havoc ~nlen~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~nlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~idBitLength~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~material_length~0 := #t~nondet3;havoc #t~nondet3; {181#true} is VALID [2018-11-14 17:33:43,222 INFO L273 TraceCheckUtils]: 5: Hoare triple {181#true} assume !!(~nlen~0 == (if ~idBitLength~0 < 0 && ~idBitLength~0 % 32 != 0 then ~idBitLength~0 / 32 + 1 else ~idBitLength~0 / 32));~j~0 := 0; {183#(<= 0 main_~j~0)} is VALID [2018-11-14 17:33:43,231 INFO L273 TraceCheckUtils]: 6: Hoare triple {183#(<= 0 main_~j~0)} assume true; {183#(<= 0 main_~j~0)} is VALID [2018-11-14 17:33:43,235 INFO L273 TraceCheckUtils]: 7: Hoare triple {183#(<= 0 main_~j~0)} assume !!(~j~0 < (if ~idBitLength~0 < 0 && ~idBitLength~0 % 8 != 0 then ~idBitLength~0 / 8 + 1 else ~idBitLength~0 / 8) && ~j~0 < ~material_length~0); {184#(and (<= 0 main_~j~0) (< main_~j~0 main_~material_length~0))} is VALID [2018-11-14 17:33:43,235 INFO L256 TraceCheckUtils]: 8: Hoare triple {184#(and (<= 0 main_~j~0) (< main_~j~0 main_~material_length~0))} call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); {181#true} is VALID [2018-11-14 17:33:43,236 INFO L273 TraceCheckUtils]: 9: Hoare triple {181#true} ~cond := #in~cond; {185#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-14 17:33:43,237 INFO L273 TraceCheckUtils]: 10: Hoare triple {185#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(~cond == 0); {186#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:33:43,240 INFO L273 TraceCheckUtils]: 11: Hoare triple {186#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {186#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:33:43,242 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {186#(not (= |__VERIFIER_assert_#in~cond| 0))} {184#(and (<= 0 main_~j~0) (< main_~j~0 main_~material_length~0))} #45#return; {187#(< main_~j~0 main_~material_length~0)} is VALID [2018-11-14 17:33:43,254 INFO L256 TraceCheckUtils]: 13: Hoare triple {187#(< main_~j~0 main_~material_length~0)} call __VERIFIER_assert((if ~j~0 < ~material_length~0 then 1 else 0)); {186#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:33:43,260 INFO L273 TraceCheckUtils]: 14: Hoare triple {186#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {188#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-14 17:33:43,262 INFO L273 TraceCheckUtils]: 15: Hoare triple {188#(not (= __VERIFIER_assert_~cond 0))} assume ~cond == 0; {182#false} is VALID [2018-11-14 17:33:43,262 INFO L273 TraceCheckUtils]: 16: Hoare triple {182#false} assume !false; {182#false} is VALID [2018-11-14 17:33:43,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:43,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:33:43,265 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 17:33:43,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:33:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:43,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:33:43,512 INFO L256 TraceCheckUtils]: 0: Hoare triple {181#true} call ULTIMATE.init(); {181#true} is VALID [2018-11-14 17:33:43,513 INFO L273 TraceCheckUtils]: 1: Hoare triple {181#true} assume true; {181#true} is VALID [2018-11-14 17:33:43,513 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {181#true} {181#true} #41#return; {181#true} is VALID [2018-11-14 17:33:43,514 INFO L256 TraceCheckUtils]: 3: Hoare triple {181#true} call #t~ret5 := main(); {181#true} is VALID [2018-11-14 17:33:43,514 INFO L273 TraceCheckUtils]: 4: Hoare triple {181#true} havoc ~idBitLength~0;havoc ~material_length~0;havoc ~nlen~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~nlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~idBitLength~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~material_length~0 := #t~nondet3;havoc #t~nondet3; {181#true} is VALID [2018-11-14 17:33:43,514 INFO L273 TraceCheckUtils]: 5: Hoare triple {181#true} assume !!(~nlen~0 == (if ~idBitLength~0 < 0 && ~idBitLength~0 % 32 != 0 then ~idBitLength~0 / 32 + 1 else ~idBitLength~0 / 32));~j~0 := 0; {181#true} is VALID [2018-11-14 17:33:43,514 INFO L273 TraceCheckUtils]: 6: Hoare triple {181#true} assume true; {181#true} is VALID [2018-11-14 17:33:43,515 INFO L273 TraceCheckUtils]: 7: Hoare triple {181#true} assume !!(~j~0 < (if ~idBitLength~0 < 0 && ~idBitLength~0 % 8 != 0 then ~idBitLength~0 / 8 + 1 else ~idBitLength~0 / 8) && ~j~0 < ~material_length~0); {187#(< main_~j~0 main_~material_length~0)} is VALID [2018-11-14 17:33:43,515 INFO L256 TraceCheckUtils]: 8: Hoare triple {187#(< main_~j~0 main_~material_length~0)} call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); {181#true} is VALID [2018-11-14 17:33:43,516 INFO L273 TraceCheckUtils]: 9: Hoare triple {181#true} ~cond := #in~cond; {181#true} is VALID [2018-11-14 17:33:43,516 INFO L273 TraceCheckUtils]: 10: Hoare triple {181#true} assume !(~cond == 0); {181#true} is VALID [2018-11-14 17:33:43,516 INFO L273 TraceCheckUtils]: 11: Hoare triple {181#true} assume true; {181#true} is VALID [2018-11-14 17:33:43,522 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {181#true} {187#(< main_~j~0 main_~material_length~0)} #45#return; {187#(< main_~j~0 main_~material_length~0)} is VALID [2018-11-14 17:33:43,525 INFO L256 TraceCheckUtils]: 13: Hoare triple {187#(< main_~j~0 main_~material_length~0)} call __VERIFIER_assert((if ~j~0 < ~material_length~0 then 1 else 0)); {231#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:33:43,525 INFO L273 TraceCheckUtils]: 14: Hoare triple {231#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {235#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:33:43,526 INFO L273 TraceCheckUtils]: 15: Hoare triple {235#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {182#false} is VALID [2018-11-14 17:33:43,526 INFO L273 TraceCheckUtils]: 16: Hoare triple {182#false} assume !false; {182#false} is VALID [2018-11-14 17:33:43,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:43,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:33:43,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 10 [2018-11-14 17:33:43,553 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-11-14 17:33:43,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:33:43,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 17:33:43,655 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:43,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 17:33:43,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 17:33:43,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:33:43,656 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 10 states. [2018-11-14 17:33:44,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:44,261 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-14 17:33:44,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:33:44,261 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-11-14 17:33:44,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:33:44,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:33:44,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2018-11-14 17:33:44,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:33:44,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2018-11-14 17:33:44,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 27 transitions. [2018-11-14 17:33:44,350 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:44,352 INFO L225 Difference]: With dead ends: 29 [2018-11-14 17:33:44,352 INFO L226 Difference]: Without dead ends: 27 [2018-11-14 17:33:44,353 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:33:44,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-14 17:33:44,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-14 17:33:44,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:33:44,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-14 17:33:44,378 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-14 17:33:44,379 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-14 17:33:44,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:44,382 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-14 17:33:44,382 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-14 17:33:44,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:44,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:44,383 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-14 17:33:44,383 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-14 17:33:44,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:44,386 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-14 17:33:44,386 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-14 17:33:44,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:44,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:44,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:33:44,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:33:44,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 17:33:44,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-14 17:33:44,390 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 17 [2018-11-14 17:33:44,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:33:44,391 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-14 17:33:44,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 17:33:44,391 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-14 17:33:44,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 17:33:44,392 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:33:44,392 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:33:44,393 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:33:44,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:33:44,393 INFO L82 PathProgramCache]: Analyzing trace with hash -366649848, now seen corresponding path program 1 times [2018-11-14 17:33:44,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:33:44,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:33:44,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:44,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:33:44,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 17:33:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 17:33:44,469 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-14 17:33:44,492 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 17:33:44,492 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 17:33:44,492 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 17:33:44,492 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-14 17:33:44,492 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2018-11-14 17:33:44,492 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 17:33:44,493 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 17:33:44,493 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 17:33:44,493 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-14 17:33:44,493 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-14 17:33:44,493 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 17:33:44,493 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 17:33:44,493 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:33:44,493 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 17:33:44,494 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2018-11-14 17:33:44,494 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2018-11-14 17:33:44,494 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 17:33:44,494 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 17:33:44,494 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-14 17:33:44,494 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 17:33:44,494 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2018-11-14 17:33:44,495 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2018-11-14 17:33:44,495 WARN L170 areAnnotationChecker]: L17-4 has no Hoare annotation [2018-11-14 17:33:44,495 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 17:33:44,495 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 17:33:44,495 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 17:33:44,495 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 17:33:44,496 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-14 17:33:44,496 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-14 17:33:44,496 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2018-11-14 17:33:44,496 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2018-11-14 17:33:44,496 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-14 17:33:44,496 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-14 17:33:44,497 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2018-11-14 17:33:44,497 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2018-11-14 17:33:44,497 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-14 17:33:44,497 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 17:33:44,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 05:33:44 BoogieIcfgContainer [2018-11-14 17:33:44,499 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 17:33:44,504 INFO L168 Benchmark]: Toolchain (without parser) took 4364.88 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.5 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -596.3 MB). Peak memory consumption was 159.2 MB. Max. memory is 7.1 GB. [2018-11-14 17:33:44,506 INFO L168 Benchmark]: CDTParser took 0.20 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 17:33:44,507 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.21 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 17:33:44,508 INFO L168 Benchmark]: Boogie Preprocessor took 34.72 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 17:33:44,509 INFO L168 Benchmark]: RCFGBuilder took 642.56 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -789.9 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2018-11-14 17:33:44,512 INFO L168 Benchmark]: TraceAbstraction took 3375.14 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 183.1 MB). Peak memory consumption was 183.1 MB. Max. memory is 7.1 GB. [2018-11-14 17:33:44,524 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.20 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 304.21 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 34.72 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 642.56 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -789.9 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3375.14 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 183.1 MB). Peak memory consumption was 183.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L11] int idBitLength, material_length, nlen; [L12] int j, k; [L13] nlen = __VERIFIER_nondet_int() [L14] idBitLength = __VERIFIER_nondet_int() [L15] material_length = __VERIFIER_nondet_int() [L16] COND FALSE !(!( nlen == idBitLength / 32 )) [L17] j = 0 VAL [idBitLength=8, j=0, material_length=1, nlen=0] [L17] COND TRUE (j < idBitLength / 8) && (j < material_length) VAL [idBitLength=8, j=0, material_length=1, nlen=0] [L18] CALL __VERIFIER_assert( 0 <= j) VAL [\old(cond)=1] [L4] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert( 0 <= j) VAL [idBitLength=8, j=0, material_length=1, nlen=0] [L19] CALL __VERIFIER_assert( j < material_length ) VAL [\old(cond)=1] [L4] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L19] __VERIFIER_assert( j < material_length ) VAL [idBitLength=8, j=0, material_length=1, nlen=0] [L20] CALL __VERIFIER_assert( 0 <= j/4 ) VAL [\old(cond)=1] [L4] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L20] __VERIFIER_assert( 0 <= j/4 ) VAL [idBitLength=8, j=0, material_length=1, nlen=0] [L21] CALL __VERIFIER_assert( j/4 < nlen) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. UNSAFE Result, 3.3s OverallTime, 3 OverallIterations, 4 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 36 SDtfs, 21 SDslu, 129 SDs, 0 SdLazy, 93 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 73 NumberOfCodeBlocks, 73 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 1287 SizeOfPredicates, 2 NumberOfNonLiveVariables, 47 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 3/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...