/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-09 17:56:34,268 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-09 17:56:34,271 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-09 17:56:34,293 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-09 17:56:34,294 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-09 17:56:34,295 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-09 17:56:34,296 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-09 17:56:34,298 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-09 17:56:34,299 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-09 17:56:34,300 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-09 17:56:34,301 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-09 17:56:34,302 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-09 17:56:34,302 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-09 17:56:34,303 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-09 17:56:34,304 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-09 17:56:34,305 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-09 17:56:34,306 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-09 17:56:34,307 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-09 17:56:34,309 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-09 17:56:34,310 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-09 17:56:34,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-09 17:56:34,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-09 17:56:34,314 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-09 17:56:34,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-09 17:56:34,317 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-09 17:56:34,317 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-09 17:56:34,317 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-09 17:56:34,318 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-09 17:56:34,319 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-09 17:56:34,319 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-09 17:56:34,320 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-09 17:56:34,320 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-09 17:56:34,321 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-09 17:56:34,322 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-09 17:56:34,323 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-09 17:56:34,323 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-09 17:56:34,323 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-09 17:56:34,324 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-09 17:56:34,324 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-09 17:56:34,325 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-09 17:56:34,325 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-09 17:56:34,326 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf [2020-10-09 17:56:34,348 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-09 17:56:34,348 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-09 17:56:34,349 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-09 17:56:34,349 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-09 17:56:34,349 INFO L138 SettingsManager]: * Use SBE=true [2020-10-09 17:56:34,350 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-09 17:56:34,350 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-09 17:56:34,350 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-09 17:56:34,350 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-09 17:56:34,350 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-09 17:56:34,350 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-09 17:56:34,351 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-09 17:56:34,351 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-09 17:56:34,351 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-09 17:56:34,351 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-09 17:56:34,351 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-09 17:56:34,352 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-09 17:56:34,352 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-09 17:56:34,352 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-09 17:56:34,352 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-09 17:56:34,352 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-09 17:56:34,353 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-09 17:56:34,353 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-09 17:56:34,353 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-09 17:56:34,353 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-09 17:56:34,353 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-10-09 17:56:34,353 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-09 17:56:34,354 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-09 17:56:34,354 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-09 17:56:34,354 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-09 17:56:34,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-09 17:56:34,642 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-09 17:56:34,646 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-09 17:56:34,647 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-09 17:56:34,647 INFO L275 PluginConnector]: CDTParser initialized [2020-10-09 17:56:34,648 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_pso.opt.i [2020-10-09 17:56:34,707 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04be0e48a/cb881a9417764dd9852b5bfa37b1eb24/FLAG03029c8be [2020-10-09 17:56:35,186 INFO L306 CDTParser]: Found 1 translation units. [2020-10-09 17:56:35,187 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_pso.opt.i [2020-10-09 17:56:35,202 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04be0e48a/cb881a9417764dd9852b5bfa37b1eb24/FLAG03029c8be [2020-10-09 17:56:35,482 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04be0e48a/cb881a9417764dd9852b5bfa37b1eb24 [2020-10-09 17:56:35,492 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-09 17:56:35,494 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-09 17:56:35,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-09 17:56:35,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-09 17:56:35,499 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-09 17:56:35,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 05:56:35" (1/1) ... [2020-10-09 17:56:35,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23368f1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:56:35, skipping insertion in model container [2020-10-09 17:56:35,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 05:56:35" (1/1) ... [2020-10-09 17:56:35,511 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-09 17:56:35,553 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-09 17:56:36,033 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 17:56:36,045 INFO L203 MainTranslator]: Completed pre-run [2020-10-09 17:56:36,125 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 17:56:36,201 INFO L208 MainTranslator]: Completed translation [2020-10-09 17:56:36,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:56:36 WrapperNode [2020-10-09 17:56:36,201 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-09 17:56:36,202 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-09 17:56:36,202 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-09 17:56:36,202 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-09 17:56:36,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:56:36" (1/1) ... [2020-10-09 17:56:36,231 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:56:36" (1/1) ... [2020-10-09 17:56:36,269 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-09 17:56:36,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-09 17:56:36,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-09 17:56:36,269 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-09 17:56:36,279 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:56:36" (1/1) ... [2020-10-09 17:56:36,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:56:36" (1/1) ... [2020-10-09 17:56:36,284 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:56:36" (1/1) ... [2020-10-09 17:56:36,284 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:56:36" (1/1) ... [2020-10-09 17:56:36,294 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:56:36" (1/1) ... [2020-10-09 17:56:36,298 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:56:36" (1/1) ... [2020-10-09 17:56:36,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:56:36" (1/1) ... [2020-10-09 17:56:36,306 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-09 17:56:36,307 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-09 17:56:36,307 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-09 17:56:36,307 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-09 17:56:36,308 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:56:36" (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 [2020-10-09 17:56:36,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-09 17:56:36,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-09 17:56:36,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-09 17:56:36,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-09 17:56:36,380 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-09 17:56:36,381 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-09 17:56:36,381 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-09 17:56:36,381 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-09 17:56:36,381 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-09 17:56:36,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-09 17:56:36,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-09 17:56:36,383 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-09 17:56:38,180 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-09 17:56:38,181 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-09 17:56:38,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 05:56:38 BoogieIcfgContainer [2020-10-09 17:56:38,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-09 17:56:38,184 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-09 17:56:38,184 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-09 17:56:38,188 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-09 17:56:38,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.10 05:56:35" (1/3) ... [2020-10-09 17:56:38,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@305bb89e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 05:56:38, skipping insertion in model container [2020-10-09 17:56:38,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:56:36" (2/3) ... [2020-10-09 17:56:38,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@305bb89e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 05:56:38, skipping insertion in model container [2020-10-09 17:56:38,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 05:56:38" (3/3) ... [2020-10-09 17:56:38,194 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_pso.opt.i [2020-10-09 17:56:38,206 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-09 17:56:38,214 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-09 17:56:38,215 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-09 17:56:38,253 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,253 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,254 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,254 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,256 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,256 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,256 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,258 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,258 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,258 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,259 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,259 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,259 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,259 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,260 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,260 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,260 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,260 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,260 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,261 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,261 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,266 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,268 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,269 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,273 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,273 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,273 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,275 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,275 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:56:38,294 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-09 17:56:38,318 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 17:56:38,318 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 17:56:38,318 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 17:56:38,319 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 17:56:38,319 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 17:56:38,319 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 17:56:38,319 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 17:56:38,319 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 17:56:38,330 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 79 places, 74 transitions, 158 flow [2020-10-09 17:56:38,370 INFO L129 PetriNetUnfolder]: 2/72 cut-off events. [2020-10-09 17:56:38,370 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 17:56:38,375 INFO L80 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 72 events. 2/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-09 17:56:38,375 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 74 transitions, 158 flow [2020-10-09 17:56:38,386 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 72 transitions, 150 flow [2020-10-09 17:56:38,398 INFO L129 PetriNetUnfolder]: 0/41 cut-off events. [2020-10-09 17:56:38,399 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 17:56:38,399 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 17:56:38,400 INFO L255 CegarLoopForPetriNet]: 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] [2020-10-09 17:56:38,400 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 17:56:38,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 17:56:38,407 INFO L82 PathProgramCache]: Analyzing trace with hash -643034223, now seen corresponding path program 1 times [2020-10-09 17:56:38,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 17:56:38,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2035647127] [2020-10-09 17:56:38,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-10-09 17:56:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 17:56:38,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-09 17:56:38,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 17:56:38,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 17:56:38,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 17:56:38,654 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:56:38,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 17:56:38,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2035647127] [2020-10-09 17:56:38,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 17:56:38,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2020-10-09 17:56:38,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032089612] [2020-10-09 17:56:38,690 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 17:56:38,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 17:56:38,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 17:56:38,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-09 17:56:38,893 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 74 [2020-10-09 17:56:38,896 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 72 transitions, 150 flow. Second operand 4 states. [2020-10-09 17:56:38,896 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 17:56:38,896 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 74 [2020-10-09 17:56:38,898 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 17:56:38,927 INFO L129 PetriNetUnfolder]: 0/69 cut-off events. [2020-10-09 17:56:38,927 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 17:56:38,928 INFO L80 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 69 events. 0/69 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 38 event pairs, 0 based on Foata normal form. 4/71 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2020-10-09 17:56:38,929 INFO L132 encePairwiseOnDemand]: 69/74 looper letters, 0 selfloop transitions, 2 changer transitions 9/69 dead transitions. [2020-10-09 17:56:38,929 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 69 transitions, 148 flow [2020-10-09 17:56:38,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 17:56:38,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 17:56:38,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 214 transitions. [2020-10-09 17:56:38,945 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.963963963963964 [2020-10-09 17:56:38,946 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 214 transitions. [2020-10-09 17:56:38,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 214 transitions. [2020-10-09 17:56:38,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 17:56:38,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 214 transitions. [2020-10-09 17:56:38,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 17:56:38,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 17:56:38,960 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 17:56:38,962 INFO L185 Difference]: Start difference. First operand has 77 places, 72 transitions, 150 flow. Second operand 3 states and 214 transitions. [2020-10-09 17:56:38,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 69 transitions, 148 flow [2020-10-09 17:56:38,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 69 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-09 17:56:38,971 INFO L241 Difference]: Finished difference. Result has 76 places, 60 transitions, 128 flow [2020-10-09 17:56:38,974 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=76, PETRI_TRANSITIONS=60} [2020-10-09 17:56:38,974 INFO L341 CegarLoopForPetriNet]: 77 programPoint places, -1 predicate places. [2020-10-09 17:56:38,975 INFO L481 AbstractCegarLoop]: Abstraction has has 76 places, 60 transitions, 128 flow [2020-10-09 17:56:38,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 17:56:38,975 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 17:56:38,975 INFO L255 CegarLoopForPetriNet]: 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] [2020-10-09 17:56:39,186 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-09 17:56:39,187 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 17:56:39,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 17:56:39,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1471555611, now seen corresponding path program 1 times [2020-10-09 17:56:39,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 17:56:39,189 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2133634699] [2020-10-09 17:56:39,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-10-09 17:56:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 17:56:39,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-09 17:56:39,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 17:56:39,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:56:39,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 17:56:39,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 17:56:39,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 17:56:39,370 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2133634699] [2020-10-09 17:56:39,370 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 17:56:39,371 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2020-10-09 17:56:39,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242902061] [2020-10-09 17:56:39,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-09 17:56:39,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 17:56:39,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-09 17:56:39,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-09 17:56:39,529 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 74 [2020-10-09 17:56:39,530 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 60 transitions, 128 flow. Second operand 8 states. [2020-10-09 17:56:39,530 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 17:56:39,530 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 74 [2020-10-09 17:56:39,531 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 17:56:39,706 INFO L129 PetriNetUnfolder]: 18/160 cut-off events. [2020-10-09 17:56:39,706 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 17:56:39,707 INFO L80 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 160 events. 18/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 579 event pairs, 0 based on Foata normal form. 5/163 useless extension candidates. Maximal degree in co-relation 191. Up to 15 conditions per place. [2020-10-09 17:56:39,708 INFO L132 encePairwiseOnDemand]: 67/74 looper letters, 10 selfloop transitions, 5 changer transitions 23/89 dead transitions. [2020-10-09 17:56:39,708 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 89 transitions, 262 flow [2020-10-09 17:56:39,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-09 17:56:39,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-09 17:56:39,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 860 transitions. [2020-10-09 17:56:39,714 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.893970893970894 [2020-10-09 17:56:39,714 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 860 transitions. [2020-10-09 17:56:39,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 860 transitions. [2020-10-09 17:56:39,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 17:56:39,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 860 transitions. [2020-10-09 17:56:39,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-09 17:56:39,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-09 17:56:39,722 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-09 17:56:39,722 INFO L185 Difference]: Start difference. First operand has 76 places, 60 transitions, 128 flow. Second operand 13 states and 860 transitions. [2020-10-09 17:56:39,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 89 transitions, 262 flow [2020-10-09 17:56:39,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 89 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-09 17:56:39,726 INFO L241 Difference]: Finished difference. Result has 88 places, 62 transitions, 166 flow [2020-10-09 17:56:39,727 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=166, PETRI_PLACES=88, PETRI_TRANSITIONS=62} [2020-10-09 17:56:39,727 INFO L341 CegarLoopForPetriNet]: 77 programPoint places, 11 predicate places. [2020-10-09 17:56:39,727 INFO L481 AbstractCegarLoop]: Abstraction has has 88 places, 62 transitions, 166 flow [2020-10-09 17:56:39,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-09 17:56:39,728 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 17:56:39,728 INFO L255 CegarLoopForPetriNet]: 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] [2020-10-09 17:56:39,939 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-09 17:56:39,940 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 17:56:39,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 17:56:39,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1355481020, now seen corresponding path program 1 times [2020-10-09 17:56:39,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 17:56:39,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [472351736] [2020-10-09 17:56:39,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-10-09 17:56:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 17:56:40,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-09 17:56:40,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 17:56:40,088 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-09 17:56:40,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 17:56:40,142 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-09 17:56:40,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:56:40,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:56:40,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:56:40,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:56:40,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 17:56:40,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 17:56:40,251 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:56:40,253 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:56:40,277 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 1] term [2020-10-09 17:56:40,278 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 17:56:40,281 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-09 17:56:40,342 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-10-09 17:56:40,342 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 17:56:40,347 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 17:56:40,365 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:56:40,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 17:56:40,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [472351736] [2020-10-09 17:56:40,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 17:56:40,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 12 [2020-10-09 17:56:40,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593888594] [2020-10-09 17:56:40,385 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-09 17:56:40,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 17:56:40,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-09 17:56:40,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-10-09 17:56:40,715 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 74 [2020-10-09 17:56:40,716 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 62 transitions, 166 flow. Second operand 12 states. [2020-10-09 17:56:40,717 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 17:56:40,717 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 74 [2020-10-09 17:56:40,717 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 17:56:41,190 INFO L129 PetriNetUnfolder]: 180/491 cut-off events. [2020-10-09 17:56:41,190 INFO L130 PetriNetUnfolder]: For 391/393 co-relation queries the response was YES. [2020-10-09 17:56:41,194 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1128 conditions, 491 events. 180/491 cut-off events. For 391/393 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2582 event pairs, 18 based on Foata normal form. 11/493 useless extension candidates. Maximal degree in co-relation 1078. Up to 191 conditions per place. [2020-10-09 17:56:41,197 INFO L132 encePairwiseOnDemand]: 62/74 looper letters, 16 selfloop transitions, 15 changer transitions 50/129 dead transitions. [2020-10-09 17:56:41,197 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 129 transitions, 556 flow [2020-10-09 17:56:41,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-09 17:56:41,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-09 17:56:41,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1340 transitions. [2020-10-09 17:56:41,202 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8230958230958231 [2020-10-09 17:56:41,202 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1340 transitions. [2020-10-09 17:56:41,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1340 transitions. [2020-10-09 17:56:41,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 17:56:41,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1340 transitions. [2020-10-09 17:56:41,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 23 states. [2020-10-09 17:56:41,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 23 states. [2020-10-09 17:56:41,209 INFO L81 ComplementDD]: Finished complementDD. Result 23 states. [2020-10-09 17:56:41,209 INFO L185 Difference]: Start difference. First operand has 88 places, 62 transitions, 166 flow. Second operand 22 states and 1340 transitions. [2020-10-09 17:56:41,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 129 transitions, 556 flow [2020-10-09 17:56:41,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 129 transitions, 460 flow, removed 48 selfloop flow, removed 9 redundant places. [2020-10-09 17:56:41,219 INFO L241 Difference]: Finished difference. Result has 108 places, 72 transitions, 266 flow [2020-10-09 17:56:41,219 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=266, PETRI_PLACES=108, PETRI_TRANSITIONS=72} [2020-10-09 17:56:41,219 INFO L341 CegarLoopForPetriNet]: 77 programPoint places, 31 predicate places. [2020-10-09 17:56:41,219 INFO L481 AbstractCegarLoop]: Abstraction has has 108 places, 72 transitions, 266 flow [2020-10-09 17:56:41,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-09 17:56:41,220 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 17:56:41,220 INFO L255 CegarLoopForPetriNet]: 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] [2020-10-09 17:56:41,432 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-09 17:56:41,433 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 17:56:41,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 17:56:41,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1845501566, now seen corresponding path program 1 times [2020-10-09 17:56:41,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 17:56:41,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595219658] [2020-10-09 17:56:41,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-10-09 17:56:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 17:56:41,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-09 17:56:41,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 17:56:41,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:56:41,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 17:56:41,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 17:56:41,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 17:56:41,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595219658] [2020-10-09 17:56:41,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 17:56:41,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2020-10-09 17:56:41,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812009647] [2020-10-09 17:56:41,596 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-09 17:56:41,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 17:56:41,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-09 17:56:41,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-09 17:56:41,698 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 74 [2020-10-09 17:56:41,698 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 72 transitions, 266 flow. Second operand 8 states. [2020-10-09 17:56:41,699 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 17:56:41,699 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 74 [2020-10-09 17:56:41,699 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 17:56:41,887 INFO L129 PetriNetUnfolder]: 58/265 cut-off events. [2020-10-09 17:56:41,887 INFO L130 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2020-10-09 17:56:41,889 INFO L80 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 265 events. 58/265 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1444 event pairs, 1 based on Foata normal form. 12/261 useless extension candidates. Maximal degree in co-relation 463. Up to 36 conditions per place. [2020-10-09 17:56:41,890 INFO L132 encePairwiseOnDemand]: 66/74 looper letters, 8 selfloop transitions, 15 changer transitions 11/89 dead transitions. [2020-10-09 17:56:41,890 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 89 transitions, 340 flow [2020-10-09 17:56:41,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-09 17:56:41,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-09 17:56:41,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 777 transitions. [2020-10-09 17:56:41,893 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.875 [2020-10-09 17:56:41,893 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 777 transitions. [2020-10-09 17:56:41,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 777 transitions. [2020-10-09 17:56:41,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 17:56:41,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 777 transitions. [2020-10-09 17:56:41,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-09 17:56:41,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-09 17:56:41,897 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-09 17:56:41,897 INFO L185 Difference]: Start difference. First operand has 108 places, 72 transitions, 266 flow. Second operand 12 states and 777 transitions. [2020-10-09 17:56:41,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 89 transitions, 340 flow [2020-10-09 17:56:41,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 89 transitions, 286 flow, removed 22 selfloop flow, removed 18 redundant places. [2020-10-09 17:56:41,901 INFO L241 Difference]: Finished difference. Result has 90 places, 75 transitions, 239 flow [2020-10-09 17:56:41,902 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=239, PETRI_PLACES=90, PETRI_TRANSITIONS=75} [2020-10-09 17:56:41,902 INFO L341 CegarLoopForPetriNet]: 77 programPoint places, 13 predicate places. [2020-10-09 17:56:41,902 INFO L481 AbstractCegarLoop]: Abstraction has has 90 places, 75 transitions, 239 flow [2020-10-09 17:56:41,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-09 17:56:41,903 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 17:56:41,903 INFO L255 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1] [2020-10-09 17:56:42,114 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-09 17:56:42,115 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 17:56:42,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 17:56:42,115 INFO L82 PathProgramCache]: Analyzing trace with hash 996238524, now seen corresponding path program 1 times [2020-10-09 17:56:42,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 17:56:42,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [31761479] [2020-10-09 17:56:42,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-10-09 17:56:42,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 17:56:42,289 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 17:56:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 17:56:42,340 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 17:56:42,414 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-10-09 17:56:42,414 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 17:56:42,628 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-10-09 17:56:42,652 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:56:42,653 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:56:42,653 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:56:42,654 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:56:42,654 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:56:42,654 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:56:42,654 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:56:42,654 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:56:42,655 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:56:42,655 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:56:42,655 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:56:42,655 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:56:42,655 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:56:42,655 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:56:42,656 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:56:42,656 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:56:42,656 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:56:42,656 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:56:42,656 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:56:42,657 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:56:42,657 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:56:42,657 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:56:42,657 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:56:42,657 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:56:42,658 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:56:42,658 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:56:42,659 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:56:42,659 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:56:42,659 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:56:42,659 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:56:42,660 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:56:42,660 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:56:42,660 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:56:42,660 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:56:42,660 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:56:42,660 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:56:42,661 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:56:42,661 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:56:42,661 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:56:42,661 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:56:42,662 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:56:42,662 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:56:42,662 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:56:42,662 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:56:42,662 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:56:42,662 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:56:42,663 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:56:42,663 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:56:42,663 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:56:42,663 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:56:42,664 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:56:42,664 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:56:42,664 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:56:42,664 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:56:42,664 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:56:42,665 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:56:42,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.10 05:56:42 BasicIcfg [2020-10-09 17:56:42,751 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-09 17:56:42,753 INFO L168 Benchmark]: Toolchain (without parser) took 7258.94 ms. Allocated memory was 251.1 MB in the beginning and 429.9 MB in the end (delta: 178.8 MB). Free memory was 206.4 MB in the beginning and 304.1 MB in the end (delta: -97.6 MB). Peak memory consumption was 81.1 MB. Max. memory is 14.2 GB. [2020-10-09 17:56:42,754 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 251.1 MB. Free memory is still 227.5 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-09 17:56:42,755 INFO L168 Benchmark]: CACSL2BoogieTranslator took 706.77 ms. Allocated memory was 251.1 MB in the beginning and 314.0 MB in the end (delta: 62.9 MB). Free memory was 206.4 MB in the beginning and 266.5 MB in the end (delta: -60.1 MB). Peak memory consumption was 33.2 MB. Max. memory is 14.2 GB. [2020-10-09 17:56:42,756 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.64 ms. Allocated memory is still 314.0 MB. Free memory was 266.5 MB in the beginning and 261.5 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. [2020-10-09 17:56:42,756 INFO L168 Benchmark]: Boogie Preprocessor took 37.38 ms. Allocated memory is still 314.0 MB. Free memory is still 261.5 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-09 17:56:42,761 INFO L168 Benchmark]: RCFGBuilder took 1876.41 ms. Allocated memory was 314.0 MB in the beginning and 358.1 MB in the end (delta: 44.0 MB). Free memory was 259.0 MB in the beginning and 217.1 MB in the end (delta: 41.9 MB). Peak memory consumption was 99.1 MB. Max. memory is 14.2 GB. [2020-10-09 17:56:42,762 INFO L168 Benchmark]: TraceAbstraction took 4566.44 ms. Allocated memory was 358.1 MB in the beginning and 429.9 MB in the end (delta: 71.8 MB). Free memory was 213.7 MB in the beginning and 304.1 MB in the end (delta: -90.4 MB). There was no memory consumed. Max. memory is 14.2 GB. [2020-10-09 17:56:42,772 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.21 ms. Allocated memory is still 251.1 MB. Free memory is still 227.5 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 706.77 ms. Allocated memory was 251.1 MB in the beginning and 314.0 MB in the end (delta: 62.9 MB). Free memory was 206.4 MB in the beginning and 266.5 MB in the end (delta: -60.1 MB). Peak memory consumption was 33.2 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 66.64 ms. Allocated memory is still 314.0 MB. Free memory was 266.5 MB in the beginning and 261.5 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 37.38 ms. Allocated memory is still 314.0 MB. Free memory is still 261.5 MB. There was no memory consumed. Max. memory is 14.2 GB. * RCFGBuilder took 1876.41 ms. Allocated memory was 314.0 MB in the beginning and 358.1 MB in the end (delta: 44.0 MB). Free memory was 259.0 MB in the beginning and 217.1 MB in the end (delta: 41.9 MB). Peak memory consumption was 99.1 MB. Max. memory is 14.2 GB. * TraceAbstraction took 4566.44 ms. Allocated memory was 358.1 MB in the beginning and 429.9 MB in the end (delta: 71.8 MB). Free memory was 213.7 MB in the beginning and 304.1 MB in the end (delta: -90.4 MB). There was no memory consumed. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L697] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L698] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L699] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L701] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L703] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L704] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L705] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L706] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L707] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L708] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L709] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L710] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L711] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L712] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L713] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L714] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L715] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L718] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L719] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L779] 0 pthread_t t2479; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L780] FCALL, FORK 0 pthread_create(&t2479, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] 0 pthread_t t2480; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L782] FCALL, FORK 0 pthread_create(&t2480, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L743] 2 x$w_buff1 = x$w_buff0 [L744] 2 x$w_buff0 = 2 [L745] 2 x$w_buff1_used = x$w_buff0_used [L746] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L748] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L749] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L750] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L751] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L723] 1 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L726] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L757] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L757] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L757] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L757] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L758] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L758] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L759] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L759] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L760] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L760] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L761] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L761] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L729] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L729] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L729] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L729] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L730] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L730] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L731] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L731] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L732] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L733] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L736] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L784] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L788] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L788] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L789] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L789] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L790] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L790] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L791] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L791] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L792] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L792] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L795] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 0 x$flush_delayed = weak$$choice2 [L798] 0 x$mem_tmp = x [L799] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L799] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L800] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L800] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L801] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L801] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1 [L801] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L801] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L801] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L802] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L802] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L803] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L804] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L805] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L806] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L807] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L807] 0 x = x$flush_delayed ? x$mem_tmp : x [L808] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L7] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L7] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 73 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 4.3s, OverallIterations: 5, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 26 SDtfs, 170 SDslu, 232 SDs, 0 SdLazy, 303 SolverSat, 87 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 380 GetRequests, 321 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=266occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 235 NumberOfCodeBlocks, 235 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 350 ConstructedInterpolants, 0 QuantifiedInterpolants, 60591 SizeOfPredicates, 22 NumberOfNonLiveVariables, 515 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...