java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/array-industry-pattern/check_removal_from_set_after_insertion.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:38:45,879 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:38:45,882 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:38:45,894 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:38:45,895 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:38:45,896 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:38:45,898 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:38:45,900 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:38:45,911 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:38:45,913 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:38:45,914 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:38:45,915 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:38:45,916 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:38:45,918 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:38:45,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:38:45,920 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:38:45,921 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:38:45,923 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:38:45,926 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:38:45,930 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:38:45,934 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:38:45,936 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:38:45,939 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:38:45,940 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:38:45,942 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:38:45,943 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:38:45,943 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:38:45,945 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:38:45,946 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:38:45,947 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:38:45,948 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:38:45,949 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:38:45,949 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:38:45,950 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:38:45,952 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:38:45,952 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:38:45,953 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:38:45,953 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:38:45,953 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:38:45,955 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:38:45,956 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:38:45,957 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 00:38:45,991 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:38:45,991 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:38:45,996 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:38:45,996 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:38:45,996 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:38:45,997 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:38:45,997 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:38:45,997 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:38:45,997 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:38:45,997 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:38:45,997 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:38:45,998 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:38:45,998 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:38:45,998 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:38:46,000 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:38:46,000 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:38:46,001 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:38:46,001 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:38:46,001 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:38:46,001 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:38:46,002 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:38:46,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:38:46,002 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:38:46,002 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:38:46,002 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:38:46,002 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:38:46,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:38:46,003 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:38:46,003 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 00:38:46,297 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:38:46,311 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:38:46,314 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:38:46,316 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:38:46,316 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:38:46,317 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-industry-pattern/check_removal_from_set_after_insertion.c [2019-10-07 00:38:46,382 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd90962b1/e90656e0a5bd4e92a9a44c367b0f58e2/FLAG361c9b646 [2019-10-07 00:38:46,864 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:38:46,865 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/check_removal_from_set_after_insertion.c [2019-10-07 00:38:46,872 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd90962b1/e90656e0a5bd4e92a9a44c367b0f58e2/FLAG361c9b646 [2019-10-07 00:38:47,253 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd90962b1/e90656e0a5bd4e92a9a44c367b0f58e2 [2019-10-07 00:38:47,263 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:38:47,264 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:38:47,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:38:47,265 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:38:47,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:38:47,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:38:47" (1/1) ... [2019-10-07 00:38:47,273 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39cbab6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:38:47, skipping insertion in model container [2019-10-07 00:38:47,273 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:38:47" (1/1) ... [2019-10-07 00:38:47,282 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:38:47,308 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:38:47,539 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:38:47,551 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:38:47,677 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:38:47,700 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:38:47,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:38:47 WrapperNode [2019-10-07 00:38:47,701 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:38:47,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:38:47,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:38:47,701 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:38:47,713 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:38:47" (1/1) ... [2019-10-07 00:38:47,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:38:47" (1/1) ... [2019-10-07 00:38:47,721 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:38:47" (1/1) ... [2019-10-07 00:38:47,721 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:38:47" (1/1) ... [2019-10-07 00:38:47,731 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:38:47" (1/1) ... [2019-10-07 00:38:47,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:38:47" (1/1) ... [2019-10-07 00:38:47,740 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:38:47" (1/1) ... [2019-10-07 00:38:47,744 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:38:47,744 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:38:47,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:38:47,745 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:38:47,746 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:38:47" (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 [2019-10-07 00:38:47,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:38:47,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:38:47,803 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 00:38:47,804 INFO L138 BoogieDeclarations]: Found implementation of procedure insert [2019-10-07 00:38:47,804 INFO L138 BoogieDeclarations]: Found implementation of procedure elem_exists [2019-10-07 00:38:47,804 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:38:47,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:38:47,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 00:38:47,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:38:47,805 INFO L130 BoogieDeclarations]: Found specification of procedure insert [2019-10-07 00:38:47,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 00:38:47,805 INFO L130 BoogieDeclarations]: Found specification of procedure elem_exists [2019-10-07 00:38:47,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 00:38:47,805 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:38:47,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 00:38:47,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 00:38:47,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:38:47,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:38:48,340 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:38:48,340 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-07 00:38:48,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:38:48 BoogieIcfgContainer [2019-10-07 00:38:48,342 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:38:48,343 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:38:48,343 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:38:48,347 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:38:48,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:38:47" (1/3) ... [2019-10-07 00:38:48,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52a66a6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:38:48, skipping insertion in model container [2019-10-07 00:38:48,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:38:47" (2/3) ... [2019-10-07 00:38:48,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52a66a6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:38:48, skipping insertion in model container [2019-10-07 00:38:48,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:38:48" (3/3) ... [2019-10-07 00:38:48,351 INFO L109 eAbstractionObserver]: Analyzing ICFG check_removal_from_set_after_insertion.c [2019-10-07 00:38:48,361 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:38:48,370 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:38:48,382 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:38:48,411 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:38:48,411 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:38:48,411 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:38:48,412 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:38:48,412 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:38:48,412 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:38:48,412 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:38:48,413 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:38:48,430 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2019-10-07 00:38:48,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 00:38:48,436 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:38:48,437 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:38:48,439 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:38:48,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:38:48,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1837632078, now seen corresponding path program 1 times [2019-10-07 00:38:48,453 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:38:48,453 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:38:48,453 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:38:48,454 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:38:48,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:38:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:38:48,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:38:48,631 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:38:48,632 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:38:48,635 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:38:48,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:38:48,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:38:48,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:38:48,652 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2019-10-07 00:38:48,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:38:48,717 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2019-10-07 00:38:48,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:38:48,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-07 00:38:48,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:38:48,729 INFO L225 Difference]: With dead ends: 57 [2019-10-07 00:38:48,729 INFO L226 Difference]: Without dead ends: 34 [2019-10-07 00:38:48,733 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:38:48,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-07 00:38:48,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-10-07 00:38:48,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-07 00:38:48,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2019-10-07 00:38:48,775 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 15 [2019-10-07 00:38:48,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:38:48,776 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2019-10-07 00:38:48,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:38:48,776 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2019-10-07 00:38:48,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-07 00:38:48,777 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:38:48,777 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:38:48,778 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:38:48,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:38:48,778 INFO L82 PathProgramCache]: Analyzing trace with hash -659682392, now seen corresponding path program 1 times [2019-10-07 00:38:48,778 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:38:48,779 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:38:48,779 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:38:48,779 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:38:48,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:38:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:38:48,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:38:48,918 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:38:48,919 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:38:48,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:38:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:38:48,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 00:38:48,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:38:49,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 00:38:49,039 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:38:49,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 00:38:49,092 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 00:38:49,092 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [5] total 8 [2019-10-07 00:38:49,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 00:38:49,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 00:38:49,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-07 00:38:49,096 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 6 states. [2019-10-07 00:38:49,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:38:49,272 INFO L93 Difference]: Finished difference Result 72 states and 90 transitions. [2019-10-07 00:38:49,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 00:38:49,272 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-10-07 00:38:49,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:38:49,276 INFO L225 Difference]: With dead ends: 72 [2019-10-07 00:38:49,276 INFO L226 Difference]: Without dead ends: 44 [2019-10-07 00:38:49,279 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-10-07 00:38:49,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-07 00:38:49,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2019-10-07 00:38:49,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-07 00:38:49,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2019-10-07 00:38:49,316 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 17 [2019-10-07 00:38:49,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:38:49,316 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2019-10-07 00:38:49,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 00:38:49,316 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2019-10-07 00:38:49,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-07 00:38:49,317 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:38:49,318 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:38:49,521 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:38:49,522 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:38:49,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:38:49,523 INFO L82 PathProgramCache]: Analyzing trace with hash -2055252280, now seen corresponding path program 1 times [2019-10-07 00:38:49,524 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:38:49,524 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:38:49,524 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:38:49,524 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:38:49,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:38:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:38:49,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-07 00:38:49,645 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:38:49,645 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:38:49,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:38:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:38:49,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-07 00:38:49,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:38:49,797 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 00:38:49,797 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:38:49,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 00:38:49,875 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:38:49,931 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-07 00:38:49,932 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:38:49,942 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:38:49,957 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:38:49,958 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:38:50,211 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 26 for LOIs [2019-10-07 00:38:52,598 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 35 for LOIs [2019-10-07 00:38:52,624 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-07 00:38:52,643 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:38:52,644 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:38:52,645 INFO L193 IcfgInterpreter]: Reachable states at location L46-3 satisfy 93#(and (<= main_~v~0 0) (<= main_~i~1 0) (= main_~v~0 0) (not (< main_~v~0 ~SIZE~0)) (<= main_~element~0 2147483647) (<= 0 main_~i~1) (<= 0 main_~v~0) (= main_~i~1 0) (<= ~SIZE~0 0) (<= 0 (+ main_~element~0 2147483648))) [2019-10-07 00:38:52,645 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 128#(and (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#set~0.base_BEFORE_CALL_1| Int) (|v_main_~#set~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (+ (select (select |#memory_int| v_prenex_1) v_prenex_2) 2147483647)) (< 1 ~SIZE~0) (<= ~SIZE~0 0)) (and (<= (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_1|) |v_main_~#set~0.offset_BEFORE_CALL_1|) 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_1|) |v_main_~#set~0.offset_BEFORE_CALL_1|) 2147483648)) (< 1 ~SIZE~0) (<= ~SIZE~0 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (< 1 ~SIZE~0) (<= (select (select |#memory_int| v_prenex_3) v_prenex_4) 2147483646) (<= ~SIZE~0 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:38:52,646 INFO L193 IcfgInterpreter]: Reachable states at location L65 satisfy 118#false [2019-10-07 00:38:52,646 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 133#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#set~0.base_BEFORE_CALL_1| Int) (|v_main_~#set~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (+ (select (select |#memory_int| v_prenex_1) v_prenex_2) 2147483647)) (< 1 ~SIZE~0) (<= ~SIZE~0 0)) (and (<= (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_1|) |v_main_~#set~0.offset_BEFORE_CALL_1|) 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_1|) |v_main_~#set~0.offset_BEFORE_CALL_1|) 2147483648)) (< 1 ~SIZE~0) (<= ~SIZE~0 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (< 1 ~SIZE~0) (<= (select (select |#memory_int| v_prenex_3) v_prenex_4) 2147483646) (<= ~SIZE~0 0)))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:38:52,647 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 142#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-07 00:38:52,648 INFO L193 IcfgInterpreter]: Reachable states at location L38-3 satisfy 79#(and (<= main_~v~0 0) (= main_~v~0 0) (not (< main_~i~1 ~SIZE~0)) (<= main_~element~0 2147483647) (<= 0 main_~v~0) (<= 0 (+ main_~element~0 2147483648))) [2019-10-07 00:38:52,648 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (<= ~SIZE~0 100000) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= ~SIZE~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~SIZE~0)) [2019-10-07 00:38:52,649 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (<= ~SIZE~0 100000) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= ~SIZE~0 100000) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~SIZE~0) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-07 00:38:52,650 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 74#true [2019-10-07 00:38:52,650 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 147#(and (= |#valid| (store |old(#valid)| 0 0)) (<= ~SIZE~0 100000) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= ~SIZE~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~SIZE~0)) [2019-10-07 00:38:52,651 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:38:52,651 INFO L193 IcfgInterpreter]: Reachable states at location L63-3 satisfy 113#(and (<= main_~v~0 0) (not (< main_~v~0 ~SIZE~0)) (<= 0 main_~i~1) (<= 0 main_~v~0) (= main_~i~1 0) (<= main_~found~0 1) (<= main_~i~1 0) (= 1 main_~found~0) (= main_~v~0 0) (<= main_~element~0 2147483647) (<= ~SIZE~0 (+ main_~pos~0 1)) (<= 1 main_~found~0) (<= ~SIZE~0 0) (<= 0 (+ main_~element~0 2147483648))) [2019-10-07 00:38:52,652 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 138#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#set~0.base_BEFORE_CALL_1| Int) (|v_main_~#set~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (+ (select (select |#memory_int| v_prenex_1) v_prenex_2) 2147483647)) (< 1 ~SIZE~0) (<= ~SIZE~0 0)) (and (<= (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_1|) |v_main_~#set~0.offset_BEFORE_CALL_1|) 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_1|) |v_main_~#set~0.offset_BEFORE_CALL_1|) 2147483648)) (< 1 ~SIZE~0) (<= ~SIZE~0 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (< 1 ~SIZE~0) (<= (select (select |#memory_int| v_prenex_3) v_prenex_4) 2147483646) (<= ~SIZE~0 0)))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:38:52,652 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 123#(exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#set~0.base_BEFORE_CALL_1| Int) (|v_main_~#set~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (+ (select (select |#memory_int| v_prenex_1) v_prenex_2) 2147483647)) (< 1 ~SIZE~0) (<= ~SIZE~0 0)) (and (<= (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_1|) |v_main_~#set~0.offset_BEFORE_CALL_1|) 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_1|) |v_main_~#set~0.offset_BEFORE_CALL_1|) 2147483648)) (< 1 ~SIZE~0) (<= ~SIZE~0 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (< 1 ~SIZE~0) (<= (select (select |#memory_int| v_prenex_3) v_prenex_4) 2147483646) (<= ~SIZE~0 0)))) [2019-10-07 00:38:52,652 INFO L193 IcfgInterpreter]: Reachable states at location L55-3 satisfy 103#(and (<= main_~v~0 0) (= 1 main_~found~0) (= main_~v~0 0) (not (< main_~v~0 ~SIZE~0)) (<= main_~element~0 2147483647) (= main_~pos~0 main_~i~1) (<= 1 main_~found~0) (<= 0 main_~v~0) (<= main_~found~0 1) (<= ~SIZE~0 0) (<= 0 (+ main_~element~0 2147483648))) [2019-10-07 00:38:52,652 INFO L193 IcfgInterpreter]: Reachable states at location L46-4 satisfy 98#(and (<= main_~v~0 0) (<= main_~i~1 0) (or (and (= main_~v~0 0) (= 1 main_~found~0) (not (< main_~v~0 ~SIZE~0)) (= main_~i~1 0)) (and (= main_~v~0 0) (not (< main_~v~0 ~SIZE~0)) (not (< main_~i~1 ~SIZE~0)) (= main_~i~1 0))) (<= 0 main_~i~1) (<= main_~element~0 2147483647) (<= 0 main_~v~0) (<= ~SIZE~0 0) (<= 0 (+ main_~element~0 2147483648))) [2019-10-07 00:38:52,653 INFO L193 IcfgInterpreter]: Reachable states at location L53 satisfy 108#(and (<= main_~v~0 0) (= 1 main_~found~0) (= main_~v~0 0) (not (< main_~v~0 ~SIZE~0)) (<= main_~element~0 2147483647) (= main_~pos~0 main_~i~1) (not (< (+ main_~i~1 1) ~SIZE~0)) (<= 1 main_~found~0) (<= 0 main_~v~0) (<= main_~found~0 1) (<= ~SIZE~0 0) (<= 0 (+ main_~element~0 2147483648))) [2019-10-07 00:38:53,135 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-07 00:38:53,135 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5, 6, 6] total 21 [2019-10-07 00:38:53,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 00:38:53,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 00:38:53,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2019-10-07 00:38:53,139 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 11 states. [2019-10-07 00:38:53,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:38:53,473 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2019-10-07 00:38:53,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 00:38:53,475 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-10-07 00:38:53,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:38:53,477 INFO L225 Difference]: With dead ends: 57 [2019-10-07 00:38:53,477 INFO L226 Difference]: Without dead ends: 43 [2019-10-07 00:38:53,478 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2019-10-07 00:38:53,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-07 00:38:53,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2019-10-07 00:38:53,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-07 00:38:53,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2019-10-07 00:38:53,488 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 19 [2019-10-07 00:38:53,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:38:53,488 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2019-10-07 00:38:53,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 00:38:53,489 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2019-10-07 00:38:53,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-07 00:38:53,490 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:38:53,490 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:38:53,694 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:38:53,695 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:38:53,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:38:53,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1072893512, now seen corresponding path program 1 times [2019-10-07 00:38:53,696 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:38:53,697 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:38:53,697 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:38:53,697 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:38:53,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:38:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:38:53,784 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 00:38:53,785 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:38:53,785 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:38:53,785 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 00:38:53,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 00:38:53,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 00:38:53,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 00:38:53,786 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 4 states. [2019-10-07 00:38:53,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:38:53,817 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2019-10-07 00:38:53,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 00:38:53,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-10-07 00:38:53,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:38:53,820 INFO L225 Difference]: With dead ends: 69 [2019-10-07 00:38:53,820 INFO L226 Difference]: Without dead ends: 41 [2019-10-07 00:38:53,821 INFO L606 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 [2019-10-07 00:38:53,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-07 00:38:53,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-10-07 00:38:53,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-07 00:38:53,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2019-10-07 00:38:53,830 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 28 [2019-10-07 00:38:53,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:38:53,830 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2019-10-07 00:38:53,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 00:38:53,831 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2019-10-07 00:38:53,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-07 00:38:53,832 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:38:53,832 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:38:53,832 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:38:53,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:38:53,833 INFO L82 PathProgramCache]: Analyzing trace with hash 2012221557, now seen corresponding path program 1 times [2019-10-07 00:38:53,833 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:38:53,833 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:38:53,833 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:38:53,833 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:38:53,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:38:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:38:53,905 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 00:38:53,905 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:38:53,905 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:38:53,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:38:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:38:53,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-07 00:38:53,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:38:54,022 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 00:38:54,023 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:38:54,077 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 00:38:54,078 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:38:54,080 INFO L162 IcfgInterpreter]: Started Sifa with 26 locations of interest [2019-10-07 00:38:54,080 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:38:54,081 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:38:54,081 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:38:54,082 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:38:54,140 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 26 for LOIs [2019-10-07 00:38:55,379 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 34 for LOIs [2019-10-07 00:38:55,388 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-07 00:38:55,393 INFO L199 IcfgInterpreter]: Interpreting procedure elem_exists with input of size 3 for LOIs [2019-10-07 00:38:55,415 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:38:55,415 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:38:55,415 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 849#(and (exists ((v_prenex_12 Int) (|v_main_~#set~0.base_BEFORE_CALL_10| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#set~0.offset_BEFORE_CALL_10| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (< 1 ~SIZE~0) (<= (select (select |#memory_int| v_prenex_9) v_prenex_10) 2147483646)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (+ (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_10|) |v_main_~#set~0.offset_BEFORE_CALL_10|) 2147483647)) (< 1 ~SIZE~0)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ (select (select |#memory_int| v_prenex_11) v_prenex_12) 2147483648)) (< 1 ~SIZE~0) (<= (select (select |#memory_int| v_prenex_11) v_prenex_12) 2147483647)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:38:55,418 INFO L193 IcfgInterpreter]: Reachable states at location L65 satisfy 422#(and (<= 1 ~SIZE~0) (<= 0 main_~pos~0) (= |main_#t~mem16| (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* 4 main_~i~1)))) (<= 0 main_~i~1) (<= 0 main_~v~0) (= main_~i~1 0) (<= main_~found~0 1) (<= main_~i~1 0) (= 1 main_~found~0) (<= main_~element~0 2147483647) (<= ~SIZE~0 (+ main_~pos~0 1)) (<= 1 main_~found~0) (<= 0 (+ main_~element~0 2147483648)) (< (+ main_~i~1 1) ~SIZE~0)) [2019-10-07 00:38:55,419 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 854#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_12 Int) (|v_main_~#set~0.base_BEFORE_CALL_10| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#set~0.offset_BEFORE_CALL_10| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (< 1 ~SIZE~0) (<= (select (select |#memory_int| v_prenex_9) v_prenex_10) 2147483646)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (+ (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_10|) |v_main_~#set~0.offset_BEFORE_CALL_10|) 2147483647)) (< 1 ~SIZE~0)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ (select (select |#memory_int| v_prenex_11) v_prenex_12) 2147483648)) (< 1 ~SIZE~0) (<= (select (select |#memory_int| v_prenex_11) v_prenex_12) 2147483647)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:38:55,419 INFO L193 IcfgInterpreter]: Reachable states at location L38-3 satisfy 824#(and (or (and (<= main_~v~0 0) (= main_~v~0 0) (not (< main_~i~1 ~SIZE~0))) (and (<= 0 main_~n~0) (< 0 main_~n~0) (<= 1 main_~v~0) (<= 0 main_~i~1) (<= 0 ~SIZE~0))) (<= main_~element~0 2147483647) (<= 0 main_~v~0) (<= 0 (+ main_~element~0 2147483648))) [2019-10-07 00:38:55,420 INFO L193 IcfgInterpreter]: Reachable states at location elem_existsFINAL satisfy 887#(and (< elem_exists_~i~0 elem_exists_~size) (= elem_exists_~size |elem_exists_#in~size|) (<= 0 elem_exists_~size) (= elem_exists_~set.base |elem_exists_#in~set.base|) (= elem_exists_~value |elem_exists_#in~value|) (= |elem_exists_#in~set.offset| elem_exists_~set.offset) (= elem_exists_~value (select (select |#memory_int| elem_exists_~set.base) (+ (* 4 elem_exists_~i~0) elem_exists_~set.offset))) (= |elem_exists_#res| 1) (<= 0 elem_exists_~i~0) (<= elem_exists_~i~0 0) (= elem_exists_~i~0 0) (<= 0 ~SIZE~0) (<= |elem_exists_#res| 1) (<= 0 |elem_exists_#in~size|) (<= 1 |elem_exists_#res|)) [2019-10-07 00:38:55,420 INFO L193 IcfgInterpreter]: Reachable states at location L38-2 satisfy 834#(and (<= 0 main_~n~0) (< 0 main_~n~0) (<= 0 main_~i~1) (<= main_~element~0 2147483647) (<= 0 ~SIZE~0) (<= 0 main_~v~0) (<= 0 (+ main_~element~0 2147483648))) [2019-10-07 00:38:55,420 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 877#(and (= |elem_exists_#in~set.offset| elem_exists_~set.offset) (<= 0 elem_exists_~i~0) (= elem_exists_~size |elem_exists_#in~size|) (<= elem_exists_~i~0 0) (= elem_exists_~i~0 0) (<= 0 ~SIZE~0) (= elem_exists_~set.base |elem_exists_#in~set.base|) (= elem_exists_~value |elem_exists_#in~value|)) [2019-10-07 00:38:55,420 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (<= ~SIZE~0 100000) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= ~SIZE~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~SIZE~0)) [2019-10-07 00:38:55,421 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (<= ~SIZE~0 100000) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= ~SIZE~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 100000 ~SIZE~0) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-07 00:38:55,422 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 859#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_12 Int) (|v_main_~#set~0.base_BEFORE_CALL_10| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#set~0.offset_BEFORE_CALL_10| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (< 1 ~SIZE~0) (<= (select (select |#memory_int| v_prenex_9) v_prenex_10) 2147483646)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (+ (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_10|) |v_main_~#set~0.offset_BEFORE_CALL_10|) 2147483647)) (< 1 ~SIZE~0)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ (select (select |#memory_int| v_prenex_11) v_prenex_12) 2147483648)) (< 1 ~SIZE~0) (<= (select (select |#memory_int| v_prenex_11) v_prenex_12) 2147483647)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:38:55,422 INFO L193 IcfgInterpreter]: Reachable states at location L55-3 satisfy 680#(and (= 1 main_~found~0) (<= main_~element~0 2147483647) (= main_~pos~0 main_~i~1) (<= 1 main_~found~0) (<= 0 main_~v~0) (<= main_~found~0 1) (<= 0 (+ main_~element~0 2147483648))) [2019-10-07 00:38:55,423 INFO L193 IcfgInterpreter]: Reachable states at location L46-4 satisfy 748#(and (<= 0 main_~i~1) (<= main_~element~0 2147483647) (<= 0 main_~v~0) (<= 0 (+ main_~element~0 2147483648))) [2019-10-07 00:38:55,423 INFO L193 IcfgInterpreter]: Reachable states at location L53 satisfy 599#(and (= 1 main_~found~0) (<= main_~element~0 2147483647) (= main_~pos~0 main_~i~1) (not (< (+ main_~i~1 1) ~SIZE~0)) (<= 1 main_~found~0) (<= 0 main_~v~0) (<= main_~found~0 1) (<= 0 (+ main_~element~0 2147483648))) [2019-10-07 00:38:55,423 INFO L193 IcfgInterpreter]: Reachable states at location L46-3 satisfy 809#(and (<= 0 main_~i~1) (<= main_~element~0 2147483647) (<= 0 main_~v~0) (<= 0 (+ main_~element~0 2147483648))) [2019-10-07 00:38:55,423 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 863#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-07 00:38:55,424 INFO L193 IcfgInterpreter]: Reachable states at location elem_existsENTRY satisfy 872#(<= 0 ~SIZE~0) [2019-10-07 00:38:55,424 INFO L193 IcfgInterpreter]: Reachable states at location L39-2 satisfy 839#(and (<= 0 main_~n~0) (< 0 main_~n~0) (<= |main_#t~ret8| 2147483647) (<= |main_#t~ret8| 1) (<= 0 main_~i~1) (<= 0 main_~v~0) (<= 1 |main_#t~ret8|) (= 1 |main_#t~ret8|) (<= 0 (+ |main_#t~ret8| 2147483648)) (<= main_~element~0 2147483647) (<= 0 ~SIZE~0) (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) |main_#t~mem7|) (<= 0 (+ main_~element~0 2147483648))) [2019-10-07 00:38:55,424 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 72#true [2019-10-07 00:38:55,425 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 868#(and (= |#valid| (store |old(#valid)| 0 0)) (<= ~SIZE~0 100000) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= ~SIZE~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~SIZE~0)) [2019-10-07 00:38:55,425 INFO L193 IcfgInterpreter]: Reachable states at location L39-1 satisfy 191#(and (<= 0 main_~n~0) (< 0 main_~n~0) (<= 1 |main_#t~ret8|) (= 1 |main_#t~ret8|) (<= |main_#t~ret8| 1) (<= 0 main_~i~1) (<= main_~element~0 2147483647) (<= 0 ~SIZE~0) (<= 0 main_~v~0) (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) |main_#t~mem7|) (<= 0 (+ main_~element~0 2147483648))) [2019-10-07 00:38:55,426 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:38:55,426 INFO L193 IcfgInterpreter]: Reachable states at location L63-3 satisfy 513#(and (<= main_~i~1 0) (= 1 main_~found~0) (<= main_~element~0 2147483647) (<= 0 main_~i~1) (<= ~SIZE~0 (+ main_~pos~0 1)) (<= 1 main_~found~0) (<= 0 main_~v~0) (= main_~i~1 0) (<= main_~found~0 1) (<= 0 (+ main_~element~0 2147483648))) [2019-10-07 00:38:55,426 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 179#(and (<= 0 main_~i~1) (<= main_~element~0 2147483647) (<= 0 ~SIZE~0) (<= 0 main_~v~0) (<= 0 (+ main_~element~0 2147483648))) [2019-10-07 00:38:55,427 INFO L193 IcfgInterpreter]: Reachable states at location elem_existsEXIT satisfy 892#(and (< elem_exists_~i~0 elem_exists_~size) (= elem_exists_~size |elem_exists_#in~size|) (<= 0 elem_exists_~size) (= elem_exists_~set.base |elem_exists_#in~set.base|) (= elem_exists_~value |elem_exists_#in~value|) (= |elem_exists_#in~set.offset| elem_exists_~set.offset) (= elem_exists_~value (select (select |#memory_int| elem_exists_~set.base) (+ (* 4 elem_exists_~i~0) elem_exists_~set.offset))) (= |elem_exists_#res| 1) (<= 0 elem_exists_~i~0) (<= elem_exists_~i~0 0) (= elem_exists_~i~0 0) (<= 0 ~SIZE~0) (<= |elem_exists_#res| 1) (<= 0 |elem_exists_#in~size|) (<= 1 |elem_exists_#res|)) [2019-10-07 00:38:55,427 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 844#(exists ((v_prenex_12 Int) (|v_main_~#set~0.base_BEFORE_CALL_10| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#set~0.offset_BEFORE_CALL_10| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (< 1 ~SIZE~0) (<= (select (select |#memory_int| v_prenex_9) v_prenex_10) 2147483646)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (+ (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_10|) |v_main_~#set~0.offset_BEFORE_CALL_10|) 2147483647)) (< 1 ~SIZE~0)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ (select (select |#memory_int| v_prenex_11) v_prenex_12) 2147483648)) (< 1 ~SIZE~0) (<= (select (select |#memory_int| v_prenex_11) v_prenex_12) 2147483647)))) [2019-10-07 00:38:55,427 INFO L193 IcfgInterpreter]: Reachable states at location L19 satisfy 882#(and (= |elem_exists_#in~set.offset| elem_exists_~set.offset) (< elem_exists_~i~0 elem_exists_~size) (<= 0 elem_exists_~i~0) (= elem_exists_~size |elem_exists_#in~size|) (<= elem_exists_~i~0 0) (<= 0 elem_exists_~size) (= elem_exists_~i~0 0) (<= 0 ~SIZE~0) (= elem_exists_~set.base |elem_exists_#in~set.base|) (= (select (select |#memory_int| elem_exists_~set.base) (+ (* 4 elem_exists_~i~0) elem_exists_~set.offset)) |elem_exists_#t~mem1|) (<= 0 |elem_exists_#in~size|) (= elem_exists_~value |elem_exists_#in~value|)) [2019-10-07 00:38:56,541 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:38:56,541 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6, 22] total 32 [2019-10-07 00:38:56,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-07 00:38:56,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-07 00:38:56,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=852, Unknown=0, NotChecked=0, Total=992 [2019-10-07 00:38:56,544 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 32 states. [2019-10-07 00:39:01,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:39:01,177 INFO L93 Difference]: Finished difference Result 151 states and 199 transitions. [2019-10-07 00:39:01,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-07 00:39:01,178 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 29 [2019-10-07 00:39:01,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:39:01,182 INFO L225 Difference]: With dead ends: 151 [2019-10-07 00:39:01,183 INFO L226 Difference]: Without dead ends: 112 [2019-10-07 00:39:01,186 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1734 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=954, Invalid=4746, Unknown=0, NotChecked=0, Total=5700 [2019-10-07 00:39:01,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-10-07 00:39:01,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 44. [2019-10-07 00:39:01,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-07 00:39:01,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2019-10-07 00:39:01,203 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 29 [2019-10-07 00:39:01,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:39:01,203 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2019-10-07 00:39:01,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-07 00:39:01,203 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2019-10-07 00:39:01,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-07 00:39:01,204 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:39:01,205 INFO L385 BasicCegarLoop]: trace histogram [6, 2, 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] [2019-10-07 00:39:01,408 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:39:01,409 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:39:01,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:39:01,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1337455549, now seen corresponding path program 2 times [2019-10-07 00:39:01,410 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:39:01,410 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:39:01,411 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:39:01,411 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:39:01,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:39:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:39:01,526 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-07 00:39:01,527 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:39:01,527 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:39:01,527 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 00:39:01,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 00:39:01,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 00:39:01,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 00:39:01,529 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 5 states. [2019-10-07 00:39:01,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:39:01,555 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2019-10-07 00:39:01,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 00:39:01,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-10-07 00:39:01,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:39:01,557 INFO L225 Difference]: With dead ends: 54 [2019-10-07 00:39:01,557 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 00:39:01,558 INFO L606 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 [2019-10-07 00:39:01,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 00:39:01,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 00:39:01,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 00:39:01,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 00:39:01,559 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2019-10-07 00:39:01,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:39:01,559 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 00:39:01,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 00:39:01,560 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 00:39:01,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 00:39:01,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 00:39:02,070 INFO L446 ceAbstractionStarter]: At program point elem_existsENTRY(lines 16 22) the Hoare annotation is: true [2019-10-07 00:39:02,070 INFO L443 ceAbstractionStarter]: For program point elem_existsEXIT(lines 16 22) no Hoare annotation was computed. [2019-10-07 00:39:02,071 INFO L443 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2019-10-07 00:39:02,071 INFO L439 ceAbstractionStarter]: At program point L18-3(lines 18 20) the Hoare annotation is: (or (not (= |#NULL.offset| 0)) (not (= ~SIZE~0 100000)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |#valid| 0))) (not (<= |#NULL.base| 0)) (and (= elem_exists_~i~0 0) (= elem_exists_~size |elem_exists_#in~size|)) (not (= 0 |elem_exists_#in~size|))) [2019-10-07 00:39:02,071 INFO L443 ceAbstractionStarter]: For program point elem_existsFINAL(lines 16 22) no Hoare annotation was computed. [2019-10-07 00:39:02,071 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-07 00:39:02,071 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 00:39:02,072 INFO L446 ceAbstractionStarter]: At program point insertENTRY(lines 11 14) the Hoare annotation is: true [2019-10-07 00:39:02,072 INFO L443 ceAbstractionStarter]: For program point insertEXIT(lines 11 14) no Hoare annotation was computed. [2019-10-07 00:39:02,072 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 00:39:02,074 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= ~SIZE~0 100000) (<= |#NULL.offset| 0) (<= 0 |#NULL.offset|)) [2019-10-07 00:39:02,074 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 00:39:02,074 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 00:39:02,074 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 24 68) no Hoare annotation was computed. [2019-10-07 00:39:02,075 INFO L439 ceAbstractionStarter]: At program point L65(line 65) the Hoare annotation is: (or (not (= |#NULL.offset| 0)) (not (= ~SIZE~0 100000)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= |#NULL.base| 0))) [2019-10-07 00:39:02,075 INFO L443 ceAbstractionStarter]: For program point L65-1(line 65) no Hoare annotation was computed. [2019-10-07 00:39:02,075 INFO L443 ceAbstractionStarter]: For program point L61(lines 61 67) no Hoare annotation was computed. [2019-10-07 00:39:02,075 INFO L443 ceAbstractionStarter]: For program point L53(lines 24 68) no Hoare annotation was computed. [2019-10-07 00:39:02,075 INFO L439 ceAbstractionStarter]: At program point L41(line 41) the Hoare annotation is: (or (not (= |#NULL.offset| 0)) (not (= ~SIZE~0 100000)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= |#NULL.base| 0))) [2019-10-07 00:39:02,075 INFO L443 ceAbstractionStarter]: For program point L41-1(line 41) no Hoare annotation was computed. [2019-10-07 00:39:02,075 INFO L439 ceAbstractionStarter]: At program point L46-3(lines 46 52) the Hoare annotation is: (or (not (= |#NULL.offset| 0)) (not (= ~SIZE~0 100000)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= |#NULL.base| 0))) [2019-10-07 00:39:02,076 INFO L443 ceAbstractionStarter]: For program point L46-4(lines 24 68) no Hoare annotation was computed. [2019-10-07 00:39:02,076 INFO L443 ceAbstractionStarter]: For program point L38-2(lines 38 43) no Hoare annotation was computed. [2019-10-07 00:39:02,076 INFO L439 ceAbstractionStarter]: At program point L38-3(lines 38 43) the Hoare annotation is: (or (not (= |#NULL.offset| 0)) (not (= ~SIZE~0 100000)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (and (= main_~n~0 0) (= main_~v~0 0) (<= ~SIZE~0 main_~i~1) (= 0 (select |#valid| 0)) (<= main_~element~0 2147483647) (not (= 1 main_~found~0)) (<= 0 (+ main_~element~0 2147483648))) (not (<= |#NULL.base| 0))) [2019-10-07 00:39:02,076 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 24 68) the Hoare annotation is: (or (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|)) (not (= |#NULL.offset| 0)) (not (= ~SIZE~0 100000)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= |#NULL.base| 0))) [2019-10-07 00:39:02,076 INFO L439 ceAbstractionStarter]: At program point L63-3(lines 63 66) the Hoare annotation is: (or (not (= |#NULL.offset| 0)) (not (= ~SIZE~0 100000)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= |#NULL.base| 0))) [2019-10-07 00:39:02,076 INFO L439 ceAbstractionStarter]: At program point L30-3(lines 30 33) the Hoare annotation is: (or (not (= |#NULL.offset| 0)) (not (= ~SIZE~0 100000)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= |#NULL.base| 0)) (and (= main_~n~0 0) (= 0 (select |#valid| 0)) (not (= 1 main_~found~0)))) [2019-10-07 00:39:02,077 INFO L439 ceAbstractionStarter]: At program point L55-3(lines 55 58) the Hoare annotation is: (or (not (= |#NULL.offset| 0)) (not (= ~SIZE~0 100000)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= |#NULL.base| 0))) [2019-10-07 00:39:02,077 INFO L439 ceAbstractionStarter]: At program point L39(line 39) the Hoare annotation is: (or (not (= |#NULL.offset| 0)) (not (= ~SIZE~0 100000)) (and (= main_~n~0 0) (and (= 0 (select |#valid| 0)) (<= main_~element~0 2147483647) (not (= 1 main_~found~0)) (and (= main_~v~0 0) (<= ~SIZE~0 main_~i~1)) (<= 0 (+ main_~element~0 2147483648)))) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= |#NULL.base| 0))) [2019-10-07 00:39:02,077 INFO L443 ceAbstractionStarter]: For program point L39-1(line 39) no Hoare annotation was computed. [2019-10-07 00:39:02,077 INFO L443 ceAbstractionStarter]: For program point L39-2(lines 39 42) no Hoare annotation was computed. [2019-10-07 00:39:02,077 INFO L443 ceAbstractionStarter]: For program point L2-1(line 2) no Hoare annotation was computed. [2019-10-07 00:39:02,078 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2) no Hoare annotation was computed. [2019-10-07 00:39:02,078 INFO L443 ceAbstractionStarter]: For program point L2-3(line 2) no Hoare annotation was computed. [2019-10-07 00:39:02,078 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 2) the Hoare annotation is: true [2019-10-07 00:39:02,078 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 2) no Hoare annotation was computed. [2019-10-07 00:39:02,078 INFO L443 ceAbstractionStarter]: For program point L2(line 2) no Hoare annotation was computed. [2019-10-07 00:39:02,086 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,087 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,088 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,094 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,094 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,094 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,096 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,096 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,096 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,097 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,097 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,097 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,098 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,098 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,098 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,098 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,099 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,099 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,100 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,100 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,100 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,101 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,101 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,101 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,102 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,102 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,102 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,103 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,103 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,103 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,104 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,104 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,105 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,105 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,105 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,106 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 12:39:02 BoogieIcfgContainer [2019-10-07 00:39:02,110 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 00:39:02,111 INFO L168 Benchmark]: Toolchain (without parser) took 14847.25 ms. Allocated memory was 144.2 MB in the beginning and 332.9 MB in the end (delta: 188.7 MB). Free memory was 102.3 MB in the beginning and 216.2 MB in the end (delta: -113.9 MB). Peak memory consumption was 201.0 MB. Max. memory is 7.1 GB. [2019-10-07 00:39:02,112 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 144.2 MB. Free memory was 121.2 MB in the beginning and 121.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 00:39:02,113 INFO L168 Benchmark]: CACSL2BoogieTranslator took 435.71 ms. Allocated memory was 144.2 MB in the beginning and 202.4 MB in the end (delta: 58.2 MB). Free memory was 102.1 MB in the beginning and 179.6 MB in the end (delta: -77.6 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. [2019-10-07 00:39:02,114 INFO L168 Benchmark]: Boogie Preprocessor took 42.89 ms. Allocated memory is still 202.4 MB. Free memory was 179.6 MB in the beginning and 178.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-10-07 00:39:02,115 INFO L168 Benchmark]: RCFGBuilder took 597.62 ms. Allocated memory is still 202.4 MB. Free memory was 177.6 MB in the beginning and 148.6 MB in the end (delta: 29.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. [2019-10-07 00:39:02,116 INFO L168 Benchmark]: TraceAbstraction took 13766.40 ms. Allocated memory was 202.4 MB in the beginning and 332.9 MB in the end (delta: 130.5 MB). Free memory was 148.6 MB in the beginning and 216.2 MB in the end (delta: -67.6 MB). Peak memory consumption was 189.2 MB. Max. memory is 7.1 GB. [2019-10-07 00:39:02,120 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 144.2 MB. Free memory was 121.2 MB in the beginning and 121.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 435.71 ms. Allocated memory was 144.2 MB in the beginning and 202.4 MB in the end (delta: 58.2 MB). Free memory was 102.1 MB in the beginning and 179.6 MB in the end (delta: -77.6 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.89 ms. Allocated memory is still 202.4 MB. Free memory was 179.6 MB in the beginning and 178.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 597.62 ms. Allocated memory is still 202.4 MB. Free memory was 177.6 MB in the beginning and 148.6 MB in the end (delta: 29.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13766.40 ms. Allocated memory was 202.4 MB in the beginning and 332.9 MB in the end (delta: 130.5 MB). Free memory was 148.6 MB in the beginning and 216.2 MB in the end (delta: -67.6 MB). Peak memory consumption was 189.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL * 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 [2019-10-07 00:39:02,131 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,131 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,131 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,132 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,132 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,132 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL Derived loop invariant: ((((!(#NULL == 0) || !(SIZE == 100000)) || !(0 <= #NULL)) || !(0 == \old(\valid)[0])) || !(#NULL <= 0)) || ((n == 0 && 0 == \valid[0]) && !(1 == found)) - InvariantResult [Line: 46]: Loop Invariant [2019-10-07 00:39:02,133 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,133 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,133 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,133 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,134 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,134 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL Derived loop invariant: (((!(#NULL == 0) || !(SIZE == 100000)) || !(0 <= #NULL)) || !(0 == \old(\valid)[0])) || !(#NULL <= 0) - InvariantResult [Line: 63]: Loop Invariant [2019-10-07 00:39:02,134 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,134 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,135 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,135 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,135 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,135 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL Derived loop invariant: (((!(#NULL == 0) || !(SIZE == 100000)) || !(0 <= #NULL)) || !(0 == \old(\valid)[0])) || !(#NULL <= 0) - InvariantResult [Line: 38]: Loop Invariant [2019-10-07 00:39:02,136 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,136 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,136 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,137 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,137 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,137 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL Derived loop invariant: ((((!(#NULL == 0) || !(SIZE == 100000)) || !(0 <= #NULL)) || !(0 == \old(\valid)[0])) || ((((((n == 0 && v == 0) && SIZE <= i) && 0 == \valid[0]) && element <= 2147483647) && !(1 == found)) && 0 <= element + 2147483648)) || !(#NULL <= 0) - InvariantResult [Line: 55]: Loop Invariant [2019-10-07 00:39:02,138 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,138 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,138 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,138 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,138 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,139 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL Derived loop invariant: (((!(#NULL == 0) || !(SIZE == 100000)) || !(0 <= #NULL)) || !(0 == \old(\valid)[0])) || !(#NULL <= 0) - InvariantResult [Line: 18]: Loop Invariant [2019-10-07 00:39:02,139 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,139 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,140 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,140 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,140 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:39:02,140 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL Derived loop invariant: (((((!(#NULL == 0) || !(SIZE == 100000)) || !(0 <= #NULL)) || !(0 == \valid[0])) || !(#NULL <= 0)) || (i == 0 && size == \old(size))) || !(0 == \old(size)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 37 locations, 1 error locations. Result: SAFE, OverallTime: 13.6s, OverallIterations: 6, TraceHistogramMax: 6, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, HoareTripleCheckerStatistics: 157 SDtfs, 363 SDslu, 211 SDs, 0 SdLazy, 1052 SolverSat, 391 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 256 GetRequests, 140 SyntacticMatches, 6 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1945 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 82 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 31 PreInvPairs, 40 NumberOfFragments, 358 HoareAnnotationTreeSize, 31 FomulaSimplifications, 557 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 16 FomulaSimplificationsInter, 329 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 207 NumberOfCodeBlocks, 207 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 260 ConstructedInterpolants, 0 QuantifiedInterpolants, 12937 SizeOfPredicates, 6 NumberOfNonLiveVariables, 338 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 45/60 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 4070, ICFG_INTERPRETER_ENTERED_PROCEDURES: 9, DAG_INTERPRETER_EARLY_EXIT_QUERIES: 171, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 125, TOOLS_POST_TIME[ms]: 324, TOOLS_POST_CALL_APPLICATIONS: 19, TOOLS_POST_CALL_TIME[ms]: 61, TOOLS_POST_RETURN_APPLICATIONS: 12, TOOLS_POST_RETURN_TIME[ms]: 19, TOOLS_QUANTIFIERELIM_APPLICATIONS: 156, TOOLS_QUANTIFIERELIM_TIME[ms]: 349, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 67, FLUID_QUERY_TIME[ms]: 12, FLUID_QUERIES: 202, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 161, DOMAIN_JOIN_TIME[ms]: 1161, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 19, DOMAIN_WIDEN_TIME[ms]: 192, DOMAIN_ISSUBSETEQ_APPLICATIONS: 31, DOMAIN_ISSUBSETEQ_TIME[ms]: 2111, DOMAIN_ISBOTTOM_APPLICATIONS: 10, DOMAIN_ISBOTTOM_TIME[ms]: 17, LOOP_SUMMARIZER_APPLICATIONS: 12, LOOP_SUMMARIZER_CACHE_MISSES: 12, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 2891, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 2890, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 31, CALL_SUMMARIZER_APPLICATIONS: 12, CALL_SUMMARIZER_CACHE_MISSES: 3, CALL_SUMMARIZER_OVERALL_TIME[ms]: 136, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 135, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 8, PATH_EXPR_TIME[ms]: 7, REGEX_TO_DAG_TIME[ms]: 8, DAG_COMPRESSION_TIME[ms]: 35, DAG_COMPRESSION_PROCESSED_NODES: 424, DAG_COMPRESSION_RETAINED_NODES: 195, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...