./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-atomic/szymanski_true-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6bd6de17-5747-4bc4-a92c-7fa375f6ed50/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6bd6de17-5747-4bc4-a92c-7fa375f6ed50/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6bd6de17-5747-4bc4-a92c-7fa375f6ed50/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6bd6de17-5747-4bc4-a92c-7fa375f6ed50/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-atomic/szymanski_true-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6bd6de17-5747-4bc4-a92c-7fa375f6ed50/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6bd6de17-5747-4bc4-a92c-7fa375f6ed50/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3d5d738785469032c070cabc60204008ea544832 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 21:36:53,261 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 21:36:53,262 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 21:36:53,268 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 21:36:53,268 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 21:36:53,269 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 21:36:53,270 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 21:36:53,270 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 21:36:53,271 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 21:36:53,271 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 21:36:53,272 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 21:36:53,272 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 21:36:53,272 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 21:36:53,273 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 21:36:53,273 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 21:36:53,274 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 21:36:53,274 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 21:36:53,275 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 21:36:53,276 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 21:36:53,276 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 21:36:53,277 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 21:36:53,277 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 21:36:53,278 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 21:36:53,279 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 21:36:53,279 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 21:36:53,279 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 21:36:53,279 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 21:36:53,280 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 21:36:53,280 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 21:36:53,281 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 21:36:53,281 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 21:36:53,281 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 21:36:53,281 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 21:36:53,281 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 21:36:53,282 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 21:36:53,282 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 21:36:53,282 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6bd6de17-5747-4bc4-a92c-7fa375f6ed50/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 21:36:53,289 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 21:36:53,289 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 21:36:53,290 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 21:36:53,290 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 21:36:53,290 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 21:36:53,290 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 21:36:53,290 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 21:36:53,290 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 21:36:53,290 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 21:36:53,290 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 21:36:53,290 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 21:36:53,290 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 21:36:53,291 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 21:36:53,291 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 21:36:53,291 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 21:36:53,291 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 21:36:53,291 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 21:36:53,291 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 21:36:53,291 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 21:36:53,291 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 21:36:53,291 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 21:36:53,291 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 21:36:53,292 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 21:36:53,292 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 21:36:53,292 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 21:36:53,292 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 21:36:53,292 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 21:36:53,292 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 21:36:53,292 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 21:36:53,292 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 21:36:53,292 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 21:36:53,292 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 21:36:53,292 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 21:36:53,292 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 21:36:53,293 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 21:36:53,293 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 21:36:53,293 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_6bd6de17-5747-4bc4-a92c-7fa375f6ed50/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3d5d738785469032c070cabc60204008ea544832 [2018-12-02 21:36:53,309 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 21:36:53,316 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 21:36:53,317 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 21:36:53,318 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 21:36:53,319 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 21:36:53,319 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6bd6de17-5747-4bc4-a92c-7fa375f6ed50/bin-2019/utaipan/../../sv-benchmarks/c/pthread-atomic/szymanski_true-unreach-call.i [2018-12-02 21:36:53,353 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6bd6de17-5747-4bc4-a92c-7fa375f6ed50/bin-2019/utaipan/data/58eefb0ca/06b3cf2700d048d0ab970aefac204951/FLAGf5a03d7e3 [2018-12-02 21:36:53,714 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 21:36:53,714 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6bd6de17-5747-4bc4-a92c-7fa375f6ed50/sv-benchmarks/c/pthread-atomic/szymanski_true-unreach-call.i [2018-12-02 21:36:53,720 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6bd6de17-5747-4bc4-a92c-7fa375f6ed50/bin-2019/utaipan/data/58eefb0ca/06b3cf2700d048d0ab970aefac204951/FLAGf5a03d7e3 [2018-12-02 21:36:54,086 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6bd6de17-5747-4bc4-a92c-7fa375f6ed50/bin-2019/utaipan/data/58eefb0ca/06b3cf2700d048d0ab970aefac204951 [2018-12-02 21:36:54,087 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 21:36:54,088 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 21:36:54,089 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 21:36:54,089 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 21:36:54,091 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 21:36:54,091 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:36:54" (1/1) ... [2018-12-02 21:36:54,093 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f76134a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:36:54, skipping insertion in model container [2018-12-02 21:36:54,093 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:36:54" (1/1) ... [2018-12-02 21:36:54,097 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 21:36:54,114 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 21:36:54,292 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:36:54,299 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 21:36:54,370 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:36:54,400 INFO L195 MainTranslator]: Completed translation [2018-12-02 21:36:54,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:36:54 WrapperNode [2018-12-02 21:36:54,401 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 21:36:54,401 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 21:36:54,401 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 21:36:54,401 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 21:36:54,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:36:54" (1/1) ... [2018-12-02 21:36:54,417 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:36:54" (1/1) ... [2018-12-02 21:36:54,430 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 21:36:54,431 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 21:36:54,431 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 21:36:54,431 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 21:36:54,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:36:54" (1/1) ... [2018-12-02 21:36:54,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:36:54" (1/1) ... [2018-12-02 21:36:54,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:36:54" (1/1) ... [2018-12-02 21:36:54,439 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:36:54" (1/1) ... [2018-12-02 21:36:54,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:36:54" (1/1) ... [2018-12-02 21:36:54,448 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:36:54" (1/1) ... [2018-12-02 21:36:54,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:36:54" (1/1) ... [2018-12-02 21:36:54,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 21:36:54,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 21:36:54,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 21:36:54,453 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 21:36:54,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:36:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6bd6de17-5747-4bc4-a92c-7fa375f6ed50/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 21:36:54,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 21:36:54,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 21:36:54,487 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2018-12-02 21:36:54,487 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2018-12-02 21:36:54,487 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2018-12-02 21:36:54,487 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2018-12-02 21:36:54,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 21:36:54,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 21:36:54,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 21:36:54,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 21:36:54,488 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 21:36:54,651 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 21:36:54,652 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-12-02 21:36:54,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:36:54 BoogieIcfgContainer [2018-12-02 21:36:54,652 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 21:36:54,652 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 21:36:54,652 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 21:36:54,654 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 21:36:54,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 09:36:54" (1/3) ... [2018-12-02 21:36:54,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32d2ddf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:36:54, skipping insertion in model container [2018-12-02 21:36:54,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:36:54" (2/3) ... [2018-12-02 21:36:54,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32d2ddf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:36:54, skipping insertion in model container [2018-12-02 21:36:54,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:36:54" (3/3) ... [2018-12-02 21:36:54,656 INFO L112 eAbstractionObserver]: Analyzing ICFG szymanski_true-unreach-call.i [2018-12-02 21:36:54,677 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thr2_#in~_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:36:54,677 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thr2_#in~_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:36:54,677 WARN L317 ript$VariableManager]: TermVariabe Thread1_thr2_~_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:36:54,678 WARN L317 ript$VariableManager]: TermVariabe Thread1_thr2_~_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:36:54,678 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thr2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:36:54,678 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thr2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:36:54,678 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thr1_#in~_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:36:54,679 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thr1_#in~_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:36:54,679 WARN L317 ript$VariableManager]: TermVariabe Thread0_thr1_~_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:36:54,679 WARN L317 ript$VariableManager]: TermVariabe Thread0_thr1_~_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:36:54,679 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thr1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:36:54,679 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thr1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 21:36:54,688 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 21:36:54,688 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 21:36:54,693 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-12-02 21:36:54,702 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-12-02 21:36:54,716 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 21:36:54,716 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 21:36:54,716 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 21:36:54,716 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 21:36:54,717 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 21:36:54,717 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 21:36:54,717 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 21:36:54,717 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 21:36:54,722 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 65places, 84 transitions [2018-12-02 21:36:54,752 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1154 states. [2018-12-02 21:36:54,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states. [2018-12-02 21:36:54,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 21:36:54,760 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:36:54,761 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:36:54,762 INFO L423 AbstractCegarLoop]: === Iteration 1 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:36:54,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:36:54,766 INFO L82 PathProgramCache]: Analyzing trace with hash -686332095, now seen corresponding path program 1 times [2018-12-02 21:36:54,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:36:54,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:54,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:36:54,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:54,802 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:36:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:36:54,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:36:54,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:36:54,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 21:36:54,849 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:36:54,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-02 21:36:54,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 21:36:54,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 21:36:54,861 INFO L87 Difference]: Start difference. First operand 1154 states. Second operand 2 states. [2018-12-02 21:36:54,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:36:54,885 INFO L93 Difference]: Finished difference Result 1154 states and 3405 transitions. [2018-12-02 21:36:54,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 21:36:54,886 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-12-02 21:36:54,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:36:54,899 INFO L225 Difference]: With dead ends: 1154 [2018-12-02 21:36:54,899 INFO L226 Difference]: Without dead ends: 1040 [2018-12-02 21:36:54,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 21:36:54,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2018-12-02 21:36:54,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1040. [2018-12-02 21:36:54,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2018-12-02 21:36:54,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 3099 transitions. [2018-12-02 21:36:54,955 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 3099 transitions. Word has length 21 [2018-12-02 21:36:54,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:36:54,955 INFO L480 AbstractCegarLoop]: Abstraction has 1040 states and 3099 transitions. [2018-12-02 21:36:54,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-02 21:36:54,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 3099 transitions. [2018-12-02 21:36:54,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 21:36:54,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:36:54,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:36:54,957 INFO L423 AbstractCegarLoop]: === Iteration 2 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:36:54,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:36:54,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1056508031, now seen corresponding path program 1 times [2018-12-02 21:36:54,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:36:54,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:54,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:36:54,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:54,960 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:36:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:36:54,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:36:54,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:36:54,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 21:36:54,999 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:36:55,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:36:55,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:36:55,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:36:55,001 INFO L87 Difference]: Start difference. First operand 1040 states and 3099 transitions. Second operand 3 states. [2018-12-02 21:36:55,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:36:55,024 INFO L93 Difference]: Finished difference Result 1055 states and 3072 transitions. [2018-12-02 21:36:55,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:36:55,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-02 21:36:55,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:36:55,029 INFO L225 Difference]: With dead ends: 1055 [2018-12-02 21:36:55,029 INFO L226 Difference]: Without dead ends: 857 [2018-12-02 21:36:55,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:36:55,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2018-12-02 21:36:55,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 803. [2018-12-02 21:36:55,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2018-12-02 21:36:55,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 2362 transitions. [2018-12-02 21:36:55,051 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 2362 transitions. Word has length 21 [2018-12-02 21:36:55,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:36:55,051 INFO L480 AbstractCegarLoop]: Abstraction has 803 states and 2362 transitions. [2018-12-02 21:36:55,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:36:55,051 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 2362 transitions. [2018-12-02 21:36:55,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 21:36:55,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:36:55,053 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:36:55,054 INFO L423 AbstractCegarLoop]: === Iteration 3 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:36:55,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:36:55,054 INFO L82 PathProgramCache]: Analyzing trace with hash 843213921, now seen corresponding path program 1 times [2018-12-02 21:36:55,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:36:55,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:55,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:36:55,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:55,058 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:36:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:36:55,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:36:55,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:36:55,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 21:36:55,080 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:36:55,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:36:55,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:36:55,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:36:55,081 INFO L87 Difference]: Start difference. First operand 803 states and 2362 transitions. Second operand 3 states. [2018-12-02 21:36:55,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:36:55,093 INFO L93 Difference]: Finished difference Result 743 states and 2155 transitions. [2018-12-02 21:36:55,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:36:55,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-02 21:36:55,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:36:55,095 INFO L225 Difference]: With dead ends: 743 [2018-12-02 21:36:55,095 INFO L226 Difference]: Without dead ends: 530 [2018-12-02 21:36:55,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:36:55,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2018-12-02 21:36:55,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2018-12-02 21:36:55,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-12-02 21:36:55,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1532 transitions. [2018-12-02 21:36:55,103 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1532 transitions. Word has length 24 [2018-12-02 21:36:55,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:36:55,104 INFO L480 AbstractCegarLoop]: Abstraction has 530 states and 1532 transitions. [2018-12-02 21:36:55,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:36:55,104 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1532 transitions. [2018-12-02 21:36:55,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 21:36:55,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:36:55,106 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:36:55,106 INFO L423 AbstractCegarLoop]: === Iteration 4 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:36:55,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:36:55,106 INFO L82 PathProgramCache]: Analyzing trace with hash 2041816456, now seen corresponding path program 1 times [2018-12-02 21:36:55,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:36:55,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:55,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:36:55,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:55,109 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:36:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:36:55,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:36:55,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:36:55,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 21:36:55,140 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:36:55,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:36:55,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:36:55,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:36:55,141 INFO L87 Difference]: Start difference. First operand 530 states and 1532 transitions. Second operand 3 states. [2018-12-02 21:36:55,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:36:55,169 INFO L93 Difference]: Finished difference Result 578 states and 1633 transitions. [2018-12-02 21:36:55,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:36:55,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-02 21:36:55,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:36:55,171 INFO L225 Difference]: With dead ends: 578 [2018-12-02 21:36:55,171 INFO L226 Difference]: Without dead ends: 464 [2018-12-02 21:36:55,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:36:55,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-12-02 21:36:55,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2018-12-02 21:36:55,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2018-12-02 21:36:55,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1269 transitions. [2018-12-02 21:36:55,179 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1269 transitions. Word has length 32 [2018-12-02 21:36:55,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:36:55,179 INFO L480 AbstractCegarLoop]: Abstraction has 464 states and 1269 transitions. [2018-12-02 21:36:55,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:36:55,179 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1269 transitions. [2018-12-02 21:36:55,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 21:36:55,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:36:55,180 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:36:55,180 INFO L423 AbstractCegarLoop]: === Iteration 5 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:36:55,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:36:55,181 INFO L82 PathProgramCache]: Analyzing trace with hash -86176256, now seen corresponding path program 2 times [2018-12-02 21:36:55,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:36:55,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:55,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:36:55,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:55,183 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:36:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:36:55,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:36:55,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:36:55,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 21:36:55,204 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:36:55,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:36:55,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:36:55,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:36:55,205 INFO L87 Difference]: Start difference. First operand 464 states and 1269 transitions. Second operand 3 states. [2018-12-02 21:36:55,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:36:55,245 INFO L93 Difference]: Finished difference Result 509 states and 1348 transitions. [2018-12-02 21:36:55,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:36:55,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-02 21:36:55,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:36:55,248 INFO L225 Difference]: With dead ends: 509 [2018-12-02 21:36:55,248 INFO L226 Difference]: Without dead ends: 482 [2018-12-02 21:36:55,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:36:55,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2018-12-02 21:36:55,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 464. [2018-12-02 21:36:55,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2018-12-02 21:36:55,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1224 transitions. [2018-12-02 21:36:55,260 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1224 transitions. Word has length 32 [2018-12-02 21:36:55,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:36:55,260 INFO L480 AbstractCegarLoop]: Abstraction has 464 states and 1224 transitions. [2018-12-02 21:36:55,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:36:55,261 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1224 transitions. [2018-12-02 21:36:55,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 21:36:55,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:36:55,262 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:36:55,262 INFO L423 AbstractCegarLoop]: === Iteration 6 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:36:55,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:36:55,263 INFO L82 PathProgramCache]: Analyzing trace with hash 896186436, now seen corresponding path program 3 times [2018-12-02 21:36:55,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:36:55,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:55,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:36:55,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:55,266 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:36:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:36:55,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:36:55,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:36:55,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 21:36:55,293 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:36:55,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:36:55,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:36:55,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:36:55,294 INFO L87 Difference]: Start difference. First operand 464 states and 1224 transitions. Second operand 3 states. [2018-12-02 21:36:55,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:36:55,326 INFO L93 Difference]: Finished difference Result 434 states and 1105 transitions. [2018-12-02 21:36:55,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:36:55,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-02 21:36:55,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:36:55,328 INFO L225 Difference]: With dead ends: 434 [2018-12-02 21:36:55,328 INFO L226 Difference]: Without dead ends: 434 [2018-12-02 21:36:55,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:36:55,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-12-02 21:36:55,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2018-12-02 21:36:55,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-12-02 21:36:55,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1105 transitions. [2018-12-02 21:36:55,336 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1105 transitions. Word has length 32 [2018-12-02 21:36:55,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:36:55,336 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 1105 transitions. [2018-12-02 21:36:55,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:36:55,336 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1105 transitions. [2018-12-02 21:36:55,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 21:36:55,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:36:55,337 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:36:55,338 INFO L423 AbstractCegarLoop]: === Iteration 7 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:36:55,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:36:55,338 INFO L82 PathProgramCache]: Analyzing trace with hash -227670172, now seen corresponding path program 4 times [2018-12-02 21:36:55,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:36:55,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:55,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:36:55,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:36:55,340 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:36:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:36:55,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:36:55,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:36:55,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 21:36:55,357 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:36:55,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:36:55,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:36:55,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:36:55,357 INFO L87 Difference]: Start difference. First operand 434 states and 1105 transitions. Second operand 3 states. [2018-12-02 21:36:55,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:36:55,383 INFO L93 Difference]: Finished difference Result 305 states and 788 transitions. [2018-12-02 21:36:55,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:36:55,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-02 21:36:55,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:36:55,383 INFO L225 Difference]: With dead ends: 305 [2018-12-02 21:36:55,383 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 21:36:55,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:36:55,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 21:36:55,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 21:36:55,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 21:36:55,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 21:36:55,384 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2018-12-02 21:36:55,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:36:55,384 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 21:36:55,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:36:55,384 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 21:36:55,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 21:36:55,386 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 21:36:55,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 09:36:55 BasicIcfg [2018-12-02 21:36:55,388 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 21:36:55,388 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 21:36:55,388 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 21:36:55,388 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 21:36:55,388 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:36:54" (3/4) ... [2018-12-02 21:36:55,391 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 21:36:55,396 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thr2 [2018-12-02 21:36:55,396 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2018-12-02 21:36:55,398 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-12-02 21:36:55,398 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-02 21:36:55,422 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6bd6de17-5747-4bc4-a92c-7fa375f6ed50/bin-2019/utaipan/witness.graphml [2018-12-02 21:36:55,422 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 21:36:55,423 INFO L168 Benchmark]: Toolchain (without parser) took 1334.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 947.0 MB in the beginning and 895.7 MB in the end (delta: 51.3 MB). Peak memory consumption was 146.7 MB. Max. memory is 11.5 GB. [2018-12-02 21:36:55,424 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:36:55,424 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.15 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -129.7 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-12-02 21:36:55,424 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 21:36:55,424 INFO L168 Benchmark]: Boogie Preprocessor took 21.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 21:36:55,425 INFO L168 Benchmark]: RCFGBuilder took 199.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2018-12-02 21:36:55,425 INFO L168 Benchmark]: TraceAbstraction took 735.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 898.4 MB in the end (delta: 150.4 MB). Peak memory consumption was 150.4 MB. Max. memory is 11.5 GB. [2018-12-02 21:36:55,425 INFO L168 Benchmark]: Witness Printer took 34.17 ms. Allocated memory is still 1.1 GB. Free memory was 898.4 MB in the beginning and 895.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 21:36:55,427 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 312.15 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -129.7 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 199.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 735.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 898.4 MB in the end (delta: 150.4 MB). Peak memory consumption was 150.4 MB. Max. memory is 11.5 GB. * Witness Printer took 34.17 ms. Allocated memory is still 1.1 GB. Free memory was 898.4 MB in the beginning and 895.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 664]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 648]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 664]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 648]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 101 locations, 4 error locations. SAFE Result, 0.6s OverallTime, 7 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 523 SDtfs, 180 SDslu, 225 SDs, 0 SdLazy, 82 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1154occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 72 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 194 NumberOfCodeBlocks, 194 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 187 ConstructedInterpolants, 0 QuantifiedInterpolants, 6747 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...