./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-lit/qw2004_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-lit/qw2004_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f77846273a11bddcefa25041f1655a63cdf01e31 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 00:59:30,329 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 00:59:30,331 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 00:59:30,344 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 00:59:30,344 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 00:59:30,345 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 00:59:30,346 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 00:59:30,349 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 00:59:30,351 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 00:59:30,351 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 00:59:30,352 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 00:59:30,353 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 00:59:30,354 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 00:59:30,355 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 00:59:30,356 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 00:59:30,357 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 00:59:30,358 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 00:59:30,360 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 00:59:30,362 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 00:59:30,364 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 00:59:30,366 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 00:59:30,367 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 00:59:30,370 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 00:59:30,370 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 00:59:30,370 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 00:59:30,371 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 00:59:30,372 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 00:59:30,373 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 00:59:30,374 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 00:59:30,375 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 00:59:30,376 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 00:59:30,377 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 00:59:30,377 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 00:59:30,377 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 00:59:30,378 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 00:59:30,379 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 00:59:30,379 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-01 00:59:30,396 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 00:59:30,396 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 00:59:30,398 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 00:59:30,398 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 00:59:30,398 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 00:59:30,398 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 00:59:30,399 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 00:59:30,399 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 00:59:30,399 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 00:59:30,400 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 00:59:30,400 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 00:59:30,400 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 00:59:30,400 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 00:59:30,401 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 00:59:30,401 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 00:59:30,401 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 00:59:30,401 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 00:59:30,402 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 00:59:30,402 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 00:59:30,402 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 00:59:30,402 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 00:59:30,403 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 00:59:30,403 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 00:59:30,403 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 00:59:30,404 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 00:59:30,404 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 00:59:30,404 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 00:59:30,404 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 00:59:30,405 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer 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 -> f77846273a11bddcefa25041f1655a63cdf01e31 [2019-01-01 00:59:30,459 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 00:59:30,477 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 00:59:30,482 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 00:59:30,484 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 00:59:30,484 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 00:59:30,485 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-lit/qw2004_false-unreach-call.i [2019-01-01 00:59:30,558 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2993c7187/2068cb1703a4436b9b83f27a0942f2cf/FLAGfa516c5f6 [2019-01-01 00:59:31,038 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 00:59:31,041 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-lit/qw2004_false-unreach-call.i [2019-01-01 00:59:31,059 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2993c7187/2068cb1703a4436b9b83f27a0942f2cf/FLAGfa516c5f6 [2019-01-01 00:59:31,341 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2993c7187/2068cb1703a4436b9b83f27a0942f2cf [2019-01-01 00:59:31,346 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 00:59:31,348 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 00:59:31,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 00:59:31,350 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 00:59:31,356 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 00:59:31,357 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 12:59:31" (1/1) ... [2019-01-01 00:59:31,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5694ea96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:59:31, skipping insertion in model container [2019-01-01 00:59:31,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 12:59:31" (1/1) ... [2019-01-01 00:59:31,371 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 00:59:31,438 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 00:59:31,949 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 00:59:31,962 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 00:59:32,126 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 00:59:32,224 INFO L195 MainTranslator]: Completed translation [2019-01-01 00:59:32,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:59:32 WrapperNode [2019-01-01 00:59:32,224 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 00:59:32,226 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 00:59:32,226 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 00:59:32,226 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 00:59:32,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:59:32" (1/1) ... [2019-01-01 00:59:32,255 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:59:32" (1/1) ... [2019-01-01 00:59:32,284 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 00:59:32,284 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 00:59:32,284 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 00:59:32,284 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 00:59:32,296 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:59:32" (1/1) ... [2019-01-01 00:59:32,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:59:32" (1/1) ... [2019-01-01 00:59:32,299 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:59:32" (1/1) ... [2019-01-01 00:59:32,299 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:59:32" (1/1) ... [2019-01-01 00:59:32,306 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:59:32" (1/1) ... [2019-01-01 00:59:32,308 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:59:32" (1/1) ... [2019-01-01 00:59:32,310 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:59:32" (1/1) ... [2019-01-01 00:59:32,313 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 00:59:32,314 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 00:59:32,314 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 00:59:32,314 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 00:59:32,315 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:59:32" (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-01-01 00:59:32,394 INFO L130 BoogieDeclarations]: Found specification of procedure BCSP_PnpStop [2019-01-01 00:59:32,394 INFO L138 BoogieDeclarations]: Found implementation of procedure BCSP_PnpStop [2019-01-01 00:59:32,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 00:59:32,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-01 00:59:32,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 00:59:32,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 00:59:32,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-01 00:59:32,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 00:59:32,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 00:59:32,398 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-01 00:59:33,011 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 00:59:33,011 INFO L280 CfgBuilder]: Removed 18 assue(true) statements. [2019-01-01 00:59:33,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:59:33 BoogieIcfgContainer [2019-01-01 00:59:33,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 00:59:33,013 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 00:59:33,013 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 00:59:33,016 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 00:59:33,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 12:59:31" (1/3) ... [2019-01-01 00:59:33,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48210e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 12:59:33, skipping insertion in model container [2019-01-01 00:59:33,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:59:32" (2/3) ... [2019-01-01 00:59:33,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48210e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 12:59:33, skipping insertion in model container [2019-01-01 00:59:33,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:59:33" (3/3) ... [2019-01-01 00:59:33,024 INFO L112 eAbstractionObserver]: Analyzing ICFG qw2004_false-unreach-call.i [2019-01-01 00:59:33,067 WARN L317 ript$VariableManager]: TermVariabe |Thread0_BCSP_PnpStop_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:33,067 WARN L317 ript$VariableManager]: TermVariabe |Thread0_BCSP_PnpStop_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:33,067 WARN L317 ript$VariableManager]: TermVariabe Thread0_BCSP_PnpStop_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:33,068 WARN L317 ript$VariableManager]: TermVariabe Thread0_BCSP_PnpStop_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:33,068 WARN L317 ript$VariableManager]: TermVariabe |Thread0_BCSP_PnpStop_BCSP_IoDecrement_#t~ret4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:33,068 WARN L317 ript$VariableManager]: TermVariabe Thread0_BCSP_PnpStop_BCSP_IoDecrement_~pending~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:33,068 WARN L317 ript$VariableManager]: TermVariabe Thread0_BCSP_PnpStop_BCSP_IoDecrement_~pending~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:33,069 WARN L317 ript$VariableManager]: TermVariabe |Thread0_BCSP_PnpStop_dec_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:33,069 WARN L317 ript$VariableManager]: TermVariabe |Thread0_BCSP_PnpStop_dec_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:33,069 WARN L317 ript$VariableManager]: TermVariabe Thread0_BCSP_PnpStop_dec_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:33,069 WARN L317 ript$VariableManager]: TermVariabe Thread0_BCSP_PnpStop_dec_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:33,069 WARN L317 ript$VariableManager]: TermVariabe |Thread0_BCSP_PnpStop_dec_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:33,070 WARN L317 ript$VariableManager]: TermVariabe |Thread0_BCSP_PnpStop_dec_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:33,070 WARN L317 ript$VariableManager]: TermVariabe |Thread0_BCSP_PnpStop_BCSP_IoDecrement_#t~ret4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:33,070 WARN L317 ript$VariableManager]: TermVariabe |Thread0_BCSP_PnpStop_BCSP_IoDecrement_#t~ret4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:33,070 WARN L317 ript$VariableManager]: TermVariabe |Thread0_BCSP_PnpStop_BCSP_IoDecrement_#t~ret4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:33,071 WARN L317 ript$VariableManager]: TermVariabe Thread0_BCSP_PnpStop_BCSP_IoDecrement_~pending~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:33,073 WARN L317 ript$VariableManager]: TermVariabe |Thread0_BCSP_PnpStop_BCSP_IoDecrement_#t~ret4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:33,073 WARN L317 ript$VariableManager]: TermVariabe Thread0_BCSP_PnpStop_BCSP_IoDecrement_~pending~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:33,073 WARN L317 ript$VariableManager]: TermVariabe Thread0_BCSP_PnpStop_BCSP_IoDecrement_~pending~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:33,074 WARN L317 ript$VariableManager]: TermVariabe |Thread0_BCSP_PnpStop_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:33,074 WARN L317 ript$VariableManager]: TermVariabe |Thread0_BCSP_PnpStop_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:33,091 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-01 00:59:33,091 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 00:59:33,100 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-01 00:59:33,119 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-01 00:59:33,145 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 00:59:33,146 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 00:59:33,146 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 00:59:33,146 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 00:59:33,146 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 00:59:33,146 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 00:59:33,146 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 00:59:33,147 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 00:59:33,147 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 00:59:33,157 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75places, 78 transitions [2019-01-01 00:59:33,210 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 771 states. [2019-01-01 00:59:33,216 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states. [2019-01-01 00:59:33,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-01 00:59:33,236 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:59:33,237 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, 1, 1] [2019-01-01 00:59:33,240 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:59:33,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:59:33,246 INFO L82 PathProgramCache]: Analyzing trace with hash -734906715, now seen corresponding path program 1 times [2019-01-01 00:59:33,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:59:33,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:59:33,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:33,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:59:33,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:33,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:59:33,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:59:33,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:59:33,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 00:59:33,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 00:59:33,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 00:59:33,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 00:59:33,529 INFO L87 Difference]: Start difference. First operand 771 states. Second operand 3 states. [2019-01-01 00:59:33,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:59:33,620 INFO L93 Difference]: Finished difference Result 1297 states and 2629 transitions. [2019-01-01 00:59:33,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 00:59:33,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-01-01 00:59:33,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:59:33,649 INFO L225 Difference]: With dead ends: 1297 [2019-01-01 00:59:33,649 INFO L226 Difference]: Without dead ends: 617 [2019-01-01 00:59:33,651 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 [2019-01-01 00:59:33,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-01-01 00:59:33,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 409. [2019-01-01 00:59:33,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-01-01 00:59:33,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 801 transitions. [2019-01-01 00:59:33,742 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 801 transitions. Word has length 34 [2019-01-01 00:59:33,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:59:33,744 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 801 transitions. [2019-01-01 00:59:33,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 00:59:33,744 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 801 transitions. [2019-01-01 00:59:33,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-01 00:59:33,752 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:59:33,752 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, 1, 1, 1] [2019-01-01 00:59:33,752 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:59:33,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:59:33,754 INFO L82 PathProgramCache]: Analyzing trace with hash 324356338, now seen corresponding path program 1 times [2019-01-01 00:59:33,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:59:33,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:59:33,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:33,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:59:33,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:33,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:59:34,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:59:34,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:59:34,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:59:34,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:59:34,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:59:34,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:59:34,024 INFO L87 Difference]: Start difference. First operand 409 states and 801 transitions. Second operand 5 states. [2019-01-01 00:59:34,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:59:34,283 INFO L93 Difference]: Finished difference Result 388 states and 751 transitions. [2019-01-01 00:59:34,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:59:34,284 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-01-01 00:59:34,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:59:34,287 INFO L225 Difference]: With dead ends: 388 [2019-01-01 00:59:34,287 INFO L226 Difference]: Without dead ends: 334 [2019-01-01 00:59:34,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-01 00:59:34,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-01-01 00:59:34,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2019-01-01 00:59:34,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-01-01 00:59:34,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 646 transitions. [2019-01-01 00:59:34,306 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 646 transitions. Word has length 35 [2019-01-01 00:59:34,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:59:34,306 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 646 transitions. [2019-01-01 00:59:34,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:59:34,306 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 646 transitions. [2019-01-01 00:59:34,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-01 00:59:34,309 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:59:34,309 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:59:34,310 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:59:34,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:59:34,310 INFO L82 PathProgramCache]: Analyzing trace with hash 328266601, now seen corresponding path program 1 times [2019-01-01 00:59:34,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:59:34,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:59:34,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:34,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:59:34,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:59:34,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:59:34,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:59:34,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 00:59:34,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 00:59:34,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 00:59:34,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 00:59:34,454 INFO L87 Difference]: Start difference. First operand 334 states and 646 transitions. Second operand 3 states. [2019-01-01 00:59:34,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:59:34,495 INFO L93 Difference]: Finished difference Result 351 states and 663 transitions. [2019-01-01 00:59:34,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 00:59:34,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-01-01 00:59:34,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:59:34,499 INFO L225 Difference]: With dead ends: 351 [2019-01-01 00:59:34,499 INFO L226 Difference]: Without dead ends: 334 [2019-01-01 00:59:34,500 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 [2019-01-01 00:59:34,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-01-01 00:59:34,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2019-01-01 00:59:34,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-01-01 00:59:34,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 629 transitions. [2019-01-01 00:59:34,515 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 629 transitions. Word has length 48 [2019-01-01 00:59:34,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:59:34,515 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 629 transitions. [2019-01-01 00:59:34,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 00:59:34,516 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 629 transitions. [2019-01-01 00:59:34,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-01 00:59:34,518 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:59:34,518 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:59:34,519 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:59:34,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:59:34,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1333971684, now seen corresponding path program 1 times [2019-01-01 00:59:34,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:59:34,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:59:34,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:34,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:59:34,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:59:34,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:59:34,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:59:34,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:59:34,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:59:34,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:59:34,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:59:34,649 INFO L87 Difference]: Start difference. First operand 334 states and 629 transitions. Second operand 5 states. [2019-01-01 00:59:34,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:59:34,787 INFO L93 Difference]: Finished difference Result 414 states and 768 transitions. [2019-01-01 00:59:34,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 00:59:34,795 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-01-01 00:59:34,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:59:34,798 INFO L225 Difference]: With dead ends: 414 [2019-01-01 00:59:34,799 INFO L226 Difference]: Without dead ends: 318 [2019-01-01 00:59:34,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-01 00:59:34,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-01-01 00:59:34,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2019-01-01 00:59:34,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-01-01 00:59:34,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 582 transitions. [2019-01-01 00:59:34,811 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 582 transitions. Word has length 49 [2019-01-01 00:59:34,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:59:34,812 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 582 transitions. [2019-01-01 00:59:34,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:59:34,812 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 582 transitions. [2019-01-01 00:59:34,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-01 00:59:34,821 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:59:34,823 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:59:34,824 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:59:34,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:59:34,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1092765015, now seen corresponding path program 1 times [2019-01-01 00:59:34,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:59:34,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:59:34,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:34,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:59:34,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:59:34,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:59:34,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:59:34,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 00:59:34,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 00:59:34,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 00:59:34,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 00:59:34,971 INFO L87 Difference]: Start difference. First operand 318 states and 582 transitions. Second operand 3 states. [2019-01-01 00:59:35,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:59:35,018 INFO L93 Difference]: Finished difference Result 318 states and 566 transitions. [2019-01-01 00:59:35,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 00:59:35,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-01-01 00:59:35,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:59:35,021 INFO L225 Difference]: With dead ends: 318 [2019-01-01 00:59:35,022 INFO L226 Difference]: Without dead ends: 190 [2019-01-01 00:59:35,022 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 [2019-01-01 00:59:35,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-01-01 00:59:35,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2019-01-01 00:59:35,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-01-01 00:59:35,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 326 transitions. [2019-01-01 00:59:35,029 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 326 transitions. Word has length 50 [2019-01-01 00:59:35,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:59:35,029 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 326 transitions. [2019-01-01 00:59:35,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 00:59:35,030 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 326 transitions. [2019-01-01 00:59:35,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-01 00:59:35,031 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:59:35,031 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:59:35,031 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:59:35,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:59:35,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1287750479, now seen corresponding path program 2 times [2019-01-01 00:59:35,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:59:35,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:59:35,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:35,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:59:35,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:35,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:59:35,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:59:35,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:59:35,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 00:59:35,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 00:59:35,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 00:59:35,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-01 00:59:35,356 INFO L87 Difference]: Start difference. First operand 190 states and 326 transitions. Second operand 8 states. [2019-01-01 00:59:35,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:59:35,749 INFO L93 Difference]: Finished difference Result 232 states and 397 transitions. [2019-01-01 00:59:35,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 00:59:35,750 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-01-01 00:59:35,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:59:35,751 INFO L225 Difference]: With dead ends: 232 [2019-01-01 00:59:35,752 INFO L226 Difference]: Without dead ends: 148 [2019-01-01 00:59:35,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-01-01 00:59:35,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-01-01 00:59:35,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2019-01-01 00:59:35,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-01-01 00:59:35,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 242 transitions. [2019-01-01 00:59:35,758 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 242 transitions. Word has length 50 [2019-01-01 00:59:35,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:59:35,758 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 242 transitions. [2019-01-01 00:59:35,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 00:59:35,759 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 242 transitions. [2019-01-01 00:59:35,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-01 00:59:35,759 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:59:35,760 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:59:35,760 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:59:35,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:59:35,761 INFO L82 PathProgramCache]: Analyzing trace with hash -2106976045, now seen corresponding path program 3 times [2019-01-01 00:59:35,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:59:35,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:59:35,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:35,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 00:59:35,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 00:59:35,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 00:59:35,851 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-01 00:59:35,953 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-01 00:59:35,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 12:59:35 BasicIcfg [2019-01-01 00:59:35,959 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 00:59:35,959 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 00:59:35,959 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 00:59:35,960 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 00:59:35,961 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:59:33" (3/4) ... [2019-01-01 00:59:35,964 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-01 00:59:36,091 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 00:59:36,094 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 00:59:36,096 INFO L168 Benchmark]: Toolchain (without parser) took 4748.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 948.7 MB in the beginning and 960.1 MB in the end (delta: -11.5 MB). Peak memory consumption was 143.7 MB. Max. memory is 11.5 GB. [2019-01-01 00:59:36,099 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 00:59:36,101 INFO L168 Benchmark]: CACSL2BoogieTranslator took 875.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -180.1 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2019-01-01 00:59:36,105 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 00:59:36,108 INFO L168 Benchmark]: Boogie Preprocessor took 29.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 00:59:36,109 INFO L168 Benchmark]: RCFGBuilder took 697.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2019-01-01 00:59:36,110 INFO L168 Benchmark]: TraceAbstraction took 2946.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 967.0 MB in the end (delta: 136.7 MB). Peak memory consumption was 136.7 MB. Max. memory is 11.5 GB. [2019-01-01 00:59:36,111 INFO L168 Benchmark]: Witness Printer took 135.42 ms. Allocated memory is still 1.2 GB. Free memory was 967.0 MB in the beginning and 960.1 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-01 00:59:36,119 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 875.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -180.1 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 697.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2946.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 967.0 MB in the end (delta: 136.7 MB). Peak memory consumption was 136.7 MB. Max. memory is 11.5 GB. * Witness Printer took 135.42 ms. Allocated memory is still 1.2 GB. Free memory was 967.0 MB in the beginning and 960.1 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 653]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L660] -1 volatile int stoppingFlag; VAL [stoppingFlag=0] [L661] -1 volatile int pendingIo; VAL [pendingIo=0, stoppingFlag=0] [L662] -1 volatile int stoppingEvent; VAL [pendingIo=0, stoppingEvent=0, stoppingFlag=0] [L663] -1 volatile int stopped; VAL [pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=0] [L703] -1 pthread_t t; VAL [pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=0] [L704] -1 pendingIo = 1 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L705] -1 stoppingFlag = 0 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L706] -1 stoppingEvent = 0 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L707] -1 stopped = 0 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L708] FCALL, FORK -1 pthread_create(&t, 0, BCSP_PnpStop, 0) VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L687] -1 int status; VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L665] COND FALSE -1 !(\read(stoppingFlag)) VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L696] 0 stoppingFlag = 1 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L680] 0 int pending; VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L674] 0 pendingIo-- [L675] 0 int tmp = pendingIo; VAL [pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=1] [L668] -1 pendingIo = pendingIo + 1 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L670] -1 return 0; VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L688] -1 status = BCSP_IoIncrement() VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L689] COND TRUE -1 status == 0 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L677] 0 return tmp; VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L681] 0 pending = dec() VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L682] COND TRUE 0 pending == 0 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L683] 0 stoppingEvent = 1 VAL [pendingIo=1, stopped=0, stoppingEvent=1, stoppingFlag=1] [L699] 0 stopped = 1 VAL [pendingIo=1, stopped=1, stoppingEvent=1, stoppingFlag=1] [L652] COND TRUE -1 !(cond) VAL [pendingIo=1, stopped=1, stoppingEvent=1, stoppingFlag=1] [L653] -1 __VERIFIER_error() VAL [pendingIo=1, stopped=1, stoppingEvent=1, stoppingFlag=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 93 locations, 1 error locations. UNSAFE Result, 2.8s OverallTime, 7 OverallIterations, 1 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 482 SDtfs, 265 SDslu, 851 SDs, 0 SdLazy, 96 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=771occurred 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, 6 MinimizatonAttempts, 208 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 316 NumberOfCodeBlocks, 316 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 260 ConstructedInterpolants, 0 QuantifiedInterpolants, 22264 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...