java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_trivial_true-unreach-call_ground_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:55:24,455 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:55:24,457 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:55:24,470 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:55:24,471 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:55:24,472 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:55:24,473 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:55:24,475 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:55:24,477 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:55:24,478 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:55:24,479 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:55:24,480 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:55:24,481 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:55:24,482 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:55:24,483 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:55:24,484 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:55:24,485 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:55:24,487 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:55:24,489 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:55:24,491 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:55:24,492 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:55:24,494 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:55:24,497 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:55:24,497 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:55:24,497 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:55:24,499 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:55:24,500 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:55:24,501 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:55:24,502 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:55:24,504 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:55:24,505 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:55:24,505 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:55:24,506 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:55:24,506 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:55:24,507 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:55:24,510 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:55:24,511 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 11:55:24,543 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:55:24,543 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:55:24,548 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:55:24,548 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:55:24,549 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:55:24,549 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:55:24,549 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:55:24,549 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:55:24,550 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:55:24,550 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:55:24,550 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:55:24,550 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:55:24,550 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:55:24,550 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:55:24,552 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:55:24,552 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:55:24,552 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:55:24,552 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:55:24,553 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:55:24,553 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:55:24,553 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:55:24,553 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:55:24,553 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:55:24,553 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:55:24,555 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:55:24,555 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:55:24,555 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:55:24,556 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:55:24,556 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:55:24,556 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:55:24,556 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:55:24,622 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:55:24,642 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:55:24,648 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:55:24,649 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:55:24,650 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:55:24,650 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_trivial_true-unreach-call_ground_true-termination.i [2018-11-23 11:55:24,716 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b14b78f73/9286b90c4ef4460c89d9ae55279b8b52/FLAG4d16f9318 [2018-11-23 11:55:25,180 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:55:25,181 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_trivial_true-unreach-call_ground_true-termination.i [2018-11-23 11:55:25,188 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b14b78f73/9286b90c4ef4460c89d9ae55279b8b52/FLAG4d16f9318 [2018-11-23 11:55:25,534 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b14b78f73/9286b90c4ef4460c89d9ae55279b8b52 [2018-11-23 11:55:25,546 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:55:25,548 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:55:25,549 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:55:25,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:55:25,553 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:55:25,555 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:55:25" (1/1) ... [2018-11-23 11:55:25,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50669a04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:25, skipping insertion in model container [2018-11-23 11:55:25,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:55:25" (1/1) ... [2018-11-23 11:55:25,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:55:25,593 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:55:25,827 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:55:25,848 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:55:25,901 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:55:25,925 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:55:25,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:25 WrapperNode [2018-11-23 11:55:25,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:55:25,927 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:55:25,927 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:55:25,927 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:55:25,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:25" (1/1) ... [2018-11-23 11:55:25,952 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:25" (1/1) ... [2018-11-23 11:55:25,962 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:55:25,964 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:55:25,964 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:55:25,964 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:55:25,976 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:25" (1/1) ... [2018-11-23 11:55:25,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:25" (1/1) ... [2018-11-23 11:55:25,987 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:25" (1/1) ... [2018-11-23 11:55:25,988 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:25" (1/1) ... [2018-11-23 11:55:26,021 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:25" (1/1) ... [2018-11-23 11:55:26,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:25" (1/1) ... [2018-11-23 11:55:26,042 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:25" (1/1) ... [2018-11-23 11:55:26,050 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:55:26,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:55:26,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:55:26,051 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:55:26,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:55:26,235 INFO L130 BoogieDeclarations]: Found specification of procedure elem_exists [2018-11-23 11:55:26,235 INFO L138 BoogieDeclarations]: Found implementation of procedure elem_exists [2018-11-23 11:55:26,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:55:26,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:55:26,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:55:26,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:55:26,236 INFO L130 BoogieDeclarations]: Found specification of procedure insert [2018-11-23 11:55:26,236 INFO L138 BoogieDeclarations]: Found implementation of procedure insert [2018-11-23 11:55:26,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:55:26,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:55:26,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:55:26,237 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:55:26,237 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:55:26,237 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:55:26,237 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:55:26,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:55:27,352 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:55:27,353 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 11:55:27,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:55:27 BoogieIcfgContainer [2018-11-23 11:55:27,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:55:27,356 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:55:27,356 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:55:27,359 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:55:27,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:55:25" (1/3) ... [2018-11-23 11:55:27,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7751584 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:55:27, skipping insertion in model container [2018-11-23 11:55:27,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:25" (2/3) ... [2018-11-23 11:55:27,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7751584 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:55:27, skipping insertion in model container [2018-11-23 11:55:27,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:55:27" (3/3) ... [2018-11-23 11:55:27,363 INFO L112 eAbstractionObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_true-unreach-call_ground_true-termination.i [2018-11-23 11:55:27,374 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:55:27,382 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:55:27,399 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:55:27,433 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:55:27,434 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:55:27,434 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:55:27,435 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:55:27,435 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:55:27,435 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:55:27,435 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:55:27,436 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:55:27,436 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:55:27,456 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-11-23 11:55:27,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 11:55:27,463 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:27,464 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:27,467 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:27,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:27,473 INFO L82 PathProgramCache]: Analyzing trace with hash 95357250, now seen corresponding path program 1 times [2018-11-23 11:55:27,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:27,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:27,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:27,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:27,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:27,761 INFO L256 TraceCheckUtils]: 0: Hoare triple {58#true} call ULTIMATE.init(); {58#true} is VALID [2018-11-23 11:55:27,766 INFO L273 TraceCheckUtils]: 1: Hoare triple {58#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {58#true} is VALID [2018-11-23 11:55:27,767 INFO L273 TraceCheckUtils]: 2: Hoare triple {58#true} assume true; {58#true} is VALID [2018-11-23 11:55:27,767 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {58#true} {58#true} #148#return; {58#true} is VALID [2018-11-23 11:55:27,768 INFO L256 TraceCheckUtils]: 4: Hoare triple {58#true} call #t~ret19 := main(); {58#true} is VALID [2018-11-23 11:55:27,778 INFO L273 TraceCheckUtils]: 5: Hoare triple {58#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {60#(and (= main_~n~0 0) (= main_~x~0 0))} is VALID [2018-11-23 11:55:27,783 INFO L273 TraceCheckUtils]: 6: Hoare triple {60#(and (= main_~n~0 0) (= main_~x~0 0))} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {61#(and (= main_~n~0 0) (<= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0))} is VALID [2018-11-23 11:55:27,787 INFO L273 TraceCheckUtils]: 7: Hoare triple {61#(and (= main_~n~0 0) (<= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0))} assume !!(~y~0 < ~n~0);call #t~mem4 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {59#false} is VALID [2018-11-23 11:55:27,787 INFO L256 TraceCheckUtils]: 8: Hoare triple {59#false} call __VERIFIER_assert((if #t~mem4 != #t~mem5 then 1 else 0)); {59#false} is VALID [2018-11-23 11:55:27,788 INFO L273 TraceCheckUtils]: 9: Hoare triple {59#false} ~cond := #in~cond; {59#false} is VALID [2018-11-23 11:55:27,788 INFO L273 TraceCheckUtils]: 10: Hoare triple {59#false} assume 0 == ~cond; {59#false} is VALID [2018-11-23 11:55:27,788 INFO L273 TraceCheckUtils]: 11: Hoare triple {59#false} assume !false; {59#false} is VALID [2018-11-23 11:55:27,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:27,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:55:27,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:55:27,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-23 11:55:27,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:27,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:55:27,846 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-23 11:55:27,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:55:27,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:55:27,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:55:27,857 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 4 states. [2018-11-23 11:55:28,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:28,955 INFO L93 Difference]: Finished difference Result 113 states and 163 transitions. [2018-11-23 11:55:28,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:55:28,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-23 11:55:28,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:28,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:55:28,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 163 transitions. [2018-11-23 11:55:28,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:55:28,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 163 transitions. [2018-11-23 11:55:28,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 163 transitions. [2018-11-23 11:55:29,309 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:29,324 INFO L225 Difference]: With dead ends: 113 [2018-11-23 11:55:29,325 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 11:55:29,329 INFO L631 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-23 11:55:29,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 11:55:29,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-11-23 11:55:29,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:29,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 52 states. [2018-11-23 11:55:29,404 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 52 states. [2018-11-23 11:55:29,404 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 52 states. [2018-11-23 11:55:29,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:29,413 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2018-11-23 11:55:29,413 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-11-23 11:55:29,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:29,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:29,414 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 54 states. [2018-11-23 11:55:29,415 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 54 states. [2018-11-23 11:55:29,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:29,422 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2018-11-23 11:55:29,422 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-11-23 11:55:29,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:29,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:29,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:29,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:29,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 11:55:29,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-11-23 11:55:29,431 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 12 [2018-11-23 11:55:29,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:29,431 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-11-23 11:55:29,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:55:29,431 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-11-23 11:55:29,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:55:29,433 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:29,434 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:29,434 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:29,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:29,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1626724904, now seen corresponding path program 1 times [2018-11-23 11:55:29,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:29,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:29,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:29,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:29,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:29,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:29,562 INFO L256 TraceCheckUtils]: 0: Hoare triple {397#true} call ULTIMATE.init(); {397#true} is VALID [2018-11-23 11:55:29,562 INFO L273 TraceCheckUtils]: 1: Hoare triple {397#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {397#true} is VALID [2018-11-23 11:55:29,563 INFO L273 TraceCheckUtils]: 2: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-23 11:55:29,563 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} #148#return; {397#true} is VALID [2018-11-23 11:55:29,563 INFO L256 TraceCheckUtils]: 4: Hoare triple {397#true} call #t~ret19 := main(); {397#true} is VALID [2018-11-23 11:55:29,564 INFO L273 TraceCheckUtils]: 5: Hoare triple {397#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {397#true} is VALID [2018-11-23 11:55:29,564 INFO L273 TraceCheckUtils]: 6: Hoare triple {397#true} assume !(~x~0 < ~n~0); {397#true} is VALID [2018-11-23 11:55:29,564 INFO L273 TraceCheckUtils]: 7: Hoare triple {397#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {397#true} is VALID [2018-11-23 11:55:29,565 INFO L273 TraceCheckUtils]: 8: Hoare triple {397#true} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {397#true} is VALID [2018-11-23 11:55:29,565 INFO L256 TraceCheckUtils]: 9: Hoare triple {397#true} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {397#true} is VALID [2018-11-23 11:55:29,565 INFO L273 TraceCheckUtils]: 10: Hoare triple {397#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {397#true} is VALID [2018-11-23 11:55:29,566 INFO L273 TraceCheckUtils]: 11: Hoare triple {397#true} assume !(~i~0 < ~size); {397#true} is VALID [2018-11-23 11:55:29,577 INFO L273 TraceCheckUtils]: 12: Hoare triple {397#true} #res := 0; {399#(= 0 |elem_exists_#res|)} is VALID [2018-11-23 11:55:29,578 INFO L273 TraceCheckUtils]: 13: Hoare triple {399#(= 0 |elem_exists_#res|)} assume true; {399#(= 0 |elem_exists_#res|)} is VALID [2018-11-23 11:55:29,579 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {399#(= 0 |elem_exists_#res|)} {397#true} #154#return; {400#(= |main_#t~ret8| 0)} is VALID [2018-11-23 11:55:29,580 INFO L273 TraceCheckUtils]: 15: Hoare triple {400#(= |main_#t~ret8| 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {400#(= |main_#t~ret8| 0)} is VALID [2018-11-23 11:55:29,583 INFO L273 TraceCheckUtils]: 16: Hoare triple {400#(= |main_#t~ret8| 0)} assume 0 != #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {398#false} is VALID [2018-11-23 11:55:29,583 INFO L256 TraceCheckUtils]: 17: Hoare triple {398#false} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {397#true} is VALID [2018-11-23 11:55:29,584 INFO L273 TraceCheckUtils]: 18: Hoare triple {397#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {397#true} is VALID [2018-11-23 11:55:29,584 INFO L273 TraceCheckUtils]: 19: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-23 11:55:29,585 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {397#true} {398#false} #156#return; {398#false} is VALID [2018-11-23 11:55:29,585 INFO L273 TraceCheckUtils]: 21: Hoare triple {398#false} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~mem9;havoc #t~ret10; {398#false} is VALID [2018-11-23 11:55:29,585 INFO L273 TraceCheckUtils]: 22: Hoare triple {398#false} ~x~0 := 0; {398#false} is VALID [2018-11-23 11:55:29,586 INFO L273 TraceCheckUtils]: 23: Hoare triple {398#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {398#false} is VALID [2018-11-23 11:55:29,586 INFO L273 TraceCheckUtils]: 24: Hoare triple {398#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {398#false} is VALID [2018-11-23 11:55:29,586 INFO L256 TraceCheckUtils]: 25: Hoare triple {398#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {398#false} is VALID [2018-11-23 11:55:29,587 INFO L273 TraceCheckUtils]: 26: Hoare triple {398#false} ~cond := #in~cond; {398#false} is VALID [2018-11-23 11:55:29,587 INFO L273 TraceCheckUtils]: 27: Hoare triple {398#false} assume 0 == ~cond; {398#false} is VALID [2018-11-23 11:55:29,587 INFO L273 TraceCheckUtils]: 28: Hoare triple {398#false} assume !false; {398#false} is VALID [2018-11-23 11:55:29,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:29,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:55:29,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:55:29,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-11-23 11:55:29,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:29,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:55:29,736 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:29,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:55:29,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:55:29,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:55:29,737 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 4 states. [2018-11-23 11:55:29,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:29,989 INFO L93 Difference]: Finished difference Result 95 states and 116 transitions. [2018-11-23 11:55:29,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:55:29,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-11-23 11:55:29,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:29,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:55:29,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2018-11-23 11:55:29,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:55:29,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2018-11-23 11:55:29,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2018-11-23 11:55:30,164 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:30,169 INFO L225 Difference]: With dead ends: 95 [2018-11-23 11:55:30,169 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 11:55:30,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:55:30,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 11:55:30,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-23 11:55:30,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:30,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2018-11-23 11:55:30,231 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 11:55:30,231 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 11:55:30,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:30,237 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2018-11-23 11:55:30,237 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2018-11-23 11:55:30,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:30,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:30,238 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 11:55:30,239 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 11:55:30,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:30,244 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2018-11-23 11:55:30,244 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2018-11-23 11:55:30,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:30,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:30,245 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:30,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:30,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 11:55:30,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2018-11-23 11:55:30,251 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 29 [2018-11-23 11:55:30,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:30,251 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2018-11-23 11:55:30,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:55:30,252 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2018-11-23 11:55:30,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:55:30,253 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:30,253 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:30,253 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:30,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:30,254 INFO L82 PathProgramCache]: Analyzing trace with hash -209135601, now seen corresponding path program 1 times [2018-11-23 11:55:30,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:30,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:30,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:30,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:30,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:30,449 INFO L256 TraceCheckUtils]: 0: Hoare triple {727#true} call ULTIMATE.init(); {727#true} is VALID [2018-11-23 11:55:30,449 INFO L273 TraceCheckUtils]: 1: Hoare triple {727#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {727#true} is VALID [2018-11-23 11:55:30,450 INFO L273 TraceCheckUtils]: 2: Hoare triple {727#true} assume true; {727#true} is VALID [2018-11-23 11:55:30,450 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {727#true} {727#true} #148#return; {727#true} is VALID [2018-11-23 11:55:30,451 INFO L256 TraceCheckUtils]: 4: Hoare triple {727#true} call #t~ret19 := main(); {727#true} is VALID [2018-11-23 11:55:30,452 INFO L273 TraceCheckUtils]: 5: Hoare triple {727#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {729#(= 0 main_~n~0)} is VALID [2018-11-23 11:55:30,453 INFO L273 TraceCheckUtils]: 6: Hoare triple {729#(= 0 main_~n~0)} assume !(~x~0 < ~n~0); {729#(= 0 main_~n~0)} is VALID [2018-11-23 11:55:30,460 INFO L273 TraceCheckUtils]: 7: Hoare triple {729#(= 0 main_~n~0)} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {729#(= 0 main_~n~0)} is VALID [2018-11-23 11:55:30,465 INFO L273 TraceCheckUtils]: 8: Hoare triple {729#(= 0 main_~n~0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {729#(= 0 main_~n~0)} is VALID [2018-11-23 11:55:30,466 INFO L256 TraceCheckUtils]: 9: Hoare triple {729#(= 0 main_~n~0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {727#true} is VALID [2018-11-23 11:55:30,470 INFO L273 TraceCheckUtils]: 10: Hoare triple {727#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {730#(and (= elem_exists_~i~0 0) (or (= |elem_exists_#in~size| elem_exists_~size) (= elem_exists_~size 0)))} is VALID [2018-11-23 11:55:30,471 INFO L273 TraceCheckUtils]: 11: Hoare triple {730#(and (= elem_exists_~i~0 0) (or (= |elem_exists_#in~size| elem_exists_~size) (= elem_exists_~size 0)))} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {731#(not (= |elem_exists_#in~size| 0))} is VALID [2018-11-23 11:55:30,471 INFO L273 TraceCheckUtils]: 12: Hoare triple {731#(not (= |elem_exists_#in~size| 0))} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {731#(not (= |elem_exists_#in~size| 0))} is VALID [2018-11-23 11:55:30,472 INFO L273 TraceCheckUtils]: 13: Hoare triple {731#(not (= |elem_exists_#in~size| 0))} assume true; {731#(not (= |elem_exists_#in~size| 0))} is VALID [2018-11-23 11:55:30,476 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {731#(not (= |elem_exists_#in~size| 0))} {729#(= 0 main_~n~0)} #154#return; {728#false} is VALID [2018-11-23 11:55:30,477 INFO L273 TraceCheckUtils]: 15: Hoare triple {728#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {728#false} is VALID [2018-11-23 11:55:30,477 INFO L273 TraceCheckUtils]: 16: Hoare triple {728#false} assume 0 != #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {728#false} is VALID [2018-11-23 11:55:30,477 INFO L256 TraceCheckUtils]: 17: Hoare triple {728#false} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {727#true} is VALID [2018-11-23 11:55:30,478 INFO L273 TraceCheckUtils]: 18: Hoare triple {727#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4);#res := 1 + ~size; {727#true} is VALID [2018-11-23 11:55:30,478 INFO L273 TraceCheckUtils]: 19: Hoare triple {727#true} assume true; {727#true} is VALID [2018-11-23 11:55:30,478 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {727#true} {728#false} #156#return; {728#false} is VALID [2018-11-23 11:55:30,478 INFO L273 TraceCheckUtils]: 21: Hoare triple {728#false} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~mem9;havoc #t~ret10; {728#false} is VALID [2018-11-23 11:55:30,479 INFO L273 TraceCheckUtils]: 22: Hoare triple {728#false} ~x~0 := 0; {728#false} is VALID [2018-11-23 11:55:30,479 INFO L273 TraceCheckUtils]: 23: Hoare triple {728#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {728#false} is VALID [2018-11-23 11:55:30,479 INFO L273 TraceCheckUtils]: 24: Hoare triple {728#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {728#false} is VALID [2018-11-23 11:55:30,480 INFO L256 TraceCheckUtils]: 25: Hoare triple {728#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {728#false} is VALID [2018-11-23 11:55:30,480 INFO L273 TraceCheckUtils]: 26: Hoare triple {728#false} ~cond := #in~cond; {728#false} is VALID [2018-11-23 11:55:30,480 INFO L273 TraceCheckUtils]: 27: Hoare triple {728#false} assume 0 == ~cond; {728#false} is VALID [2018-11-23 11:55:30,481 INFO L273 TraceCheckUtils]: 28: Hoare triple {728#false} assume !false; {728#false} is VALID [2018-11-23 11:55:30,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:30,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:55:30,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:55:30,484 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-23 11:55:30,484 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:30,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:55:30,551 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:30,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:55:30,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:55:30,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:55:30,552 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 5 states. [2018-11-23 11:55:30,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:30,765 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2018-11-23 11:55:30,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:55:30,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-23 11:55:30,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:30,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:55:30,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2018-11-23 11:55:30,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:55:30,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2018-11-23 11:55:30,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 79 transitions. [2018-11-23 11:55:30,890 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:30,890 INFO L225 Difference]: With dead ends: 82 [2018-11-23 11:55:30,890 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:55:30,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:55:30,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:55:30,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:55:30,893 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:30,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:55:30,893 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:55:30,893 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:55:30,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:30,894 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:55:30,894 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:55:30,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:30,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:30,894 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:55:30,894 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:55:30,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:30,895 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:55:30,895 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:55:30,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:30,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:30,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:30,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:30,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:55:30,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:55:30,896 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-11-23 11:55:30,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:30,896 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:55:30,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:55:30,897 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:55:30,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:30,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:55:31,138 INFO L451 ceAbstractionStarter]: At program point elem_existsENTRY(lines 7 13) the Hoare annotation is: true [2018-11-23 11:55:31,139 INFO L448 ceAbstractionStarter]: For program point elem_existsEXIT(lines 7 13) no Hoare annotation was computed. [2018-11-23 11:55:31,139 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2018-11-23 11:55:31,139 INFO L448 ceAbstractionStarter]: For program point elem_existsFINAL(lines 7 13) no Hoare annotation was computed. [2018-11-23 11:55:31,139 INFO L448 ceAbstractionStarter]: For program point L9-2(lines 9 11) no Hoare annotation was computed. [2018-11-23 11:55:31,139 INFO L444 ceAbstractionStarter]: At program point L9-3(lines 9 11) the Hoare annotation is: (or (and (= elem_exists_~i~0 0) (= elem_exists_~size 0)) (not (= |elem_exists_#in~size| 0))) [2018-11-23 11:55:31,140 INFO L448 ceAbstractionStarter]: For program point L9-4(lines 9 11) no Hoare annotation was computed. [2018-11-23 11:55:31,140 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:55:31,140 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:55:31,141 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:55:31,141 INFO L451 ceAbstractionStarter]: At program point insertENTRY(lines 3 6) the Hoare annotation is: true [2018-11-23 11:55:31,141 INFO L448 ceAbstractionStarter]: For program point insertFINAL(lines 3 6) no Hoare annotation was computed. [2018-11-23 11:55:31,141 INFO L448 ceAbstractionStarter]: For program point insertEXIT(lines 3 6) no Hoare annotation was computed. [2018-11-23 11:55:31,141 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:55:31,141 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 11:55:31,141 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:55:31,141 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:55:31,141 INFO L448 ceAbstractionStarter]: For program point L31-2(lines 31 33) no Hoare annotation was computed. [2018-11-23 11:55:31,142 INFO L444 ceAbstractionStarter]: At program point L31-3(lines 31 33) the Hoare annotation is: false [2018-11-23 11:55:31,142 INFO L444 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (and (= 0 main_~n~0) (= main_~x~0 0)) [2018-11-23 11:55:31,142 INFO L448 ceAbstractionStarter]: For program point L27-1(line 27) no Hoare annotation was computed. [2018-11-23 11:55:31,142 INFO L448 ceAbstractionStarter]: For program point L27-2(lines 27 29) no Hoare annotation was computed. [2018-11-23 11:55:31,142 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 14 42) no Hoare annotation was computed. [2018-11-23 11:55:31,142 INFO L448 ceAbstractionStarter]: For program point L27-4(lines 27 29) no Hoare annotation was computed. [2018-11-23 11:55:31,142 INFO L448 ceAbstractionStarter]: For program point L19-2(lines 19 23) no Hoare annotation was computed. [2018-11-23 11:55:31,142 INFO L444 ceAbstractionStarter]: At program point L19-3(lines 19 23) the Hoare annotation is: (and (= 0 main_~n~0) (= main_~x~0 0)) [2018-11-23 11:55:31,143 INFO L448 ceAbstractionStarter]: For program point L19-4(lines 19 23) no Hoare annotation was computed. [2018-11-23 11:55:31,143 INFO L448 ceAbstractionStarter]: For program point L36-2(lines 36 40) no Hoare annotation was computed. [2018-11-23 11:55:31,143 INFO L444 ceAbstractionStarter]: At program point L36-3(lines 36 40) the Hoare annotation is: (and (= main_~n~0 0) (= main_~x~0 0)) [2018-11-23 11:55:31,143 INFO L444 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: false [2018-11-23 11:55:31,143 INFO L448 ceAbstractionStarter]: For program point L36-4(lines 36 40) no Hoare annotation was computed. [2018-11-23 11:55:31,143 INFO L448 ceAbstractionStarter]: For program point L32-1(line 32) no Hoare annotation was computed. [2018-11-23 11:55:31,144 INFO L444 ceAbstractionStarter]: At program point L28(line 28) the Hoare annotation is: false [2018-11-23 11:55:31,144 INFO L448 ceAbstractionStarter]: For program point L28-1(line 28) no Hoare annotation was computed. [2018-11-23 11:55:31,144 INFO L448 ceAbstractionStarter]: For program point L20-2(lines 20 22) no Hoare annotation was computed. [2018-11-23 11:55:31,144 INFO L444 ceAbstractionStarter]: At program point L20-3(lines 20 22) the Hoare annotation is: false [2018-11-23 11:55:31,144 INFO L448 ceAbstractionStarter]: For program point L37-2(lines 37 39) no Hoare annotation was computed. [2018-11-23 11:55:31,144 INFO L444 ceAbstractionStarter]: At program point L37-3(lines 37 39) the Hoare annotation is: false [2018-11-23 11:55:31,145 INFO L444 ceAbstractionStarter]: At program point L21(line 21) the Hoare annotation is: false [2018-11-23 11:55:31,145 INFO L448 ceAbstractionStarter]: For program point L21-1(line 21) no Hoare annotation was computed. [2018-11-23 11:55:31,145 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 14 42) no Hoare annotation was computed. [2018-11-23 11:55:31,145 INFO L444 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: false [2018-11-23 11:55:31,145 INFO L448 ceAbstractionStarter]: For program point L38-1(line 38) no Hoare annotation was computed. [2018-11-23 11:55:31,145 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 14 42) the Hoare annotation is: true [2018-11-23 11:55:31,146 INFO L448 ceAbstractionStarter]: For program point L30-2(lines 30 34) no Hoare annotation was computed. [2018-11-23 11:55:31,146 INFO L444 ceAbstractionStarter]: At program point L30-3(lines 30 34) the Hoare annotation is: (and (= 0 main_~n~0) (= main_~x~0 0)) [2018-11-23 11:55:31,146 INFO L448 ceAbstractionStarter]: For program point L26-2(lines 26 35) no Hoare annotation was computed. [2018-11-23 11:55:31,146 INFO L444 ceAbstractionStarter]: At program point L26-3(lines 26 35) the Hoare annotation is: (and (= 0 main_~n~0) (= main_~x~0 0)) [2018-11-23 11:55:31,146 INFO L448 ceAbstractionStarter]: For program point L26-4(lines 26 35) no Hoare annotation was computed. [2018-11-23 11:55:31,146 INFO L448 ceAbstractionStarter]: For program point L2-1(line 2) no Hoare annotation was computed. [2018-11-23 11:55:31,146 INFO L448 ceAbstractionStarter]: For program point L2-3(line 2) no Hoare annotation was computed. [2018-11-23 11:55:31,146 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 2) the Hoare annotation is: true [2018-11-23 11:55:31,147 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2) no Hoare annotation was computed. [2018-11-23 11:55:31,147 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 2) no Hoare annotation was computed. [2018-11-23 11:55:31,147 INFO L448 ceAbstractionStarter]: For program point L2(line 2) no Hoare annotation was computed. [2018-11-23 11:55:31,149 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:55:31,149 WARN L170 areAnnotationChecker]: insertFINAL has no Hoare annotation [2018-11-23 11:55:31,150 WARN L170 areAnnotationChecker]: L2 has no Hoare annotation [2018-11-23 11:55:31,150 WARN L170 areAnnotationChecker]: L9-4 has no Hoare annotation [2018-11-23 11:55:31,150 WARN L170 areAnnotationChecker]: L9-4 has no Hoare annotation [2018-11-23 11:55:31,150 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2018-11-23 11:55:31,151 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:55:31,151 WARN L170 areAnnotationChecker]: insertFINAL has no Hoare annotation [2018-11-23 11:55:31,151 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:55:31,151 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2018-11-23 11:55:31,151 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2018-11-23 11:55:31,152 WARN L170 areAnnotationChecker]: L2 has no Hoare annotation [2018-11-23 11:55:31,152 WARN L170 areAnnotationChecker]: L2 has no Hoare annotation [2018-11-23 11:55:31,152 WARN L170 areAnnotationChecker]: L9-4 has no Hoare annotation [2018-11-23 11:55:31,152 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2018-11-23 11:55:31,152 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2018-11-23 11:55:31,152 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:55:31,152 WARN L170 areAnnotationChecker]: insertEXIT has no Hoare annotation [2018-11-23 11:55:31,153 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:55:31,153 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2018-11-23 11:55:31,153 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2018-11-23 11:55:31,153 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2018-11-23 11:55:31,154 WARN L170 areAnnotationChecker]: L2-1 has no Hoare annotation [2018-11-23 11:55:31,154 WARN L170 areAnnotationChecker]: L2-1 has no Hoare annotation [2018-11-23 11:55:31,154 WARN L170 areAnnotationChecker]: L2-3 has no Hoare annotation [2018-11-23 11:55:31,154 WARN L170 areAnnotationChecker]: elem_existsFINAL has no Hoare annotation [2018-11-23 11:55:31,155 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2018-11-23 11:55:31,155 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2018-11-23 11:55:31,155 WARN L170 areAnnotationChecker]: L26-4 has no Hoare annotation [2018-11-23 11:55:31,155 WARN L170 areAnnotationChecker]: L26-4 has no Hoare annotation [2018-11-23 11:55:31,156 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2018-11-23 11:55:31,156 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2018-11-23 11:55:31,156 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:55:31,156 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:55:31,157 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:55:31,157 WARN L170 areAnnotationChecker]: elem_existsEXIT has no Hoare annotation [2018-11-23 11:55:31,157 WARN L170 areAnnotationChecker]: L27-4 has no Hoare annotation [2018-11-23 11:55:31,157 WARN L170 areAnnotationChecker]: L26-4 has no Hoare annotation [2018-11-23 11:55:31,157 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2018-11-23 11:55:31,158 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2018-11-23 11:55:31,158 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2018-11-23 11:55:31,158 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2018-11-23 11:55:31,158 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2018-11-23 11:55:31,158 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2018-11-23 11:55:31,158 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2018-11-23 11:55:31,166 WARN L170 areAnnotationChecker]: L36-4 has no Hoare annotation [2018-11-23 11:55:31,166 WARN L170 areAnnotationChecker]: L36-4 has no Hoare annotation [2018-11-23 11:55:31,169 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2018-11-23 11:55:31,169 WARN L170 areAnnotationChecker]: L31-2 has no Hoare annotation [2018-11-23 11:55:31,169 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2018-11-23 11:55:31,169 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2018-11-23 11:55:31,169 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2018-11-23 11:55:31,169 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2018-11-23 11:55:31,169 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2018-11-23 11:55:31,170 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2018-11-23 11:55:31,170 WARN L170 areAnnotationChecker]: L36-4 has no Hoare annotation [2018-11-23 11:55:31,170 WARN L170 areAnnotationChecker]: L36-2 has no Hoare annotation [2018-11-23 11:55:31,170 WARN L170 areAnnotationChecker]: L36-2 has no Hoare annotation [2018-11-23 11:55:31,170 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2018-11-23 11:55:31,170 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2018-11-23 11:55:31,170 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2018-11-23 11:55:31,170 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:55:31,170 WARN L170 areAnnotationChecker]: L36-2 has no Hoare annotation [2018-11-23 11:55:31,171 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2018-11-23 11:55:31,171 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:55:31,171 INFO L163 areAnnotationChecker]: CFG has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:55:31,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:55:31 BoogieIcfgContainer [2018-11-23 11:55:31,183 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:55:31,184 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:55:31,184 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:55:31,184 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:55:31,185 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:55:27" (3/4) ... [2018-11-23 11:55:31,189 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:55:31,196 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure elem_exists [2018-11-23 11:55:31,196 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:55:31,197 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure insert [2018-11-23 11:55:31,197 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:55:31,197 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 11:55:31,204 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2018-11-23 11:55:31,204 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-11-23 11:55:31,205 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 11:55:31,236 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (i == 0 && size == 0) || !(\old(size) == 0) [2018-11-23 11:55:31,275 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/array-examples/data_structures_set_multi_proc_trivial_true-unreach-call_ground_true-termination.i-witness.graphml [2018-11-23 11:55:31,276 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:55:31,277 INFO L168 Benchmark]: Toolchain (without parser) took 5730.44 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.1 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -491.5 MB). Peak memory consumption was 244.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:55:31,279 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:55:31,280 INFO L168 Benchmark]: CACSL2BoogieTranslator took 376.98 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:55:31,280 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.53 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:55:31,281 INFO L168 Benchmark]: Boogie Preprocessor took 86.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:55:31,281 INFO L168 Benchmark]: RCFGBuilder took 1304.25 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -752.9 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. [2018-11-23 11:55:31,282 INFO L168 Benchmark]: TraceAbstraction took 3827.93 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 250.8 MB). Peak memory consumption was 250.8 MB. Max. memory is 7.1 GB. [2018-11-23 11:55:31,282 INFO L168 Benchmark]: Witness Printer took 91.71 ms. Allocated memory is still 2.3 GB. Free memory is still 1.9 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:55:31,286 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.24 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 376.98 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.53 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 86.38 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 1304.25 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -752.9 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3827.93 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 250.8 MB). Peak memory consumption was 250.8 MB. Max. memory is 7.1 GB. * Witness Printer took 91.71 ms. Allocated memory is still 2.3 GB. Free memory is still 1.9 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: 0 == n && x == 0 - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: (i == 0 && size == 0) || !(\old(size) == 0) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: n == 0 && x == 0 - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 0 == n && x == 0 - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 == n && x == 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 55 locations, 1 error locations. SAFE Result, 3.7s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 130 SDtfs, 29 SDslu, 195 SDs, 0 SdLazy, 54 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred 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, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 36 PreInvPairs, 42 NumberOfFragments, 61 HoareAnnotationTreeSize, 36 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 16 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 70 NumberOfCodeBlocks, 70 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 67 ConstructedInterpolants, 0 QuantifiedInterpolants, 2856 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...