/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/rfi001_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 18:27:50,559 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 18:27:50,561 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 18:27:50,597 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 18:27:50,597 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 18:27:50,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 18:27:50,608 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 18:27:50,611 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 18:27:50,613 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 18:27:50,614 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 18:27:50,615 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 18:27:50,616 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 18:27:50,618 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 18:27:50,621 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 18:27:50,623 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 18:27:50,625 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 18:27:50,627 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 18:27:50,630 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 18:27:50,632 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 18:27:50,638 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 18:27:50,640 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 18:27:50,641 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 18:27:50,642 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 18:27:50,643 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 18:27:50,655 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 18:27:50,655 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 18:27:50,655 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 18:27:50,656 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 18:27:50,657 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 18:27:50,657 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 18:27:50,657 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 18:27:50,658 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 18:27:50,659 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 18:27:50,661 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 18:27:50,663 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 18:27:50,663 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 18:27:50,664 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 18:27:50,664 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 18:27:50,664 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 18:27:50,665 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 18:27:50,666 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 18:27:50,666 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf [2020-10-11 18:27:50,714 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 18:27:50,714 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 18:27:50,715 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 18:27:50,715 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 18:27:50,716 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 18:27:50,716 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 18:27:50,716 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 18:27:50,716 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 18:27:50,716 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 18:27:50,717 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 18:27:50,717 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 18:27:50,717 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 18:27:50,718 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 18:27:50,718 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 18:27:50,718 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 18:27:50,719 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 18:27:50,719 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 18:27:50,719 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 18:27:50,719 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 18:27:50,719 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 18:27:50,720 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 18:27:50,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 18:27:50,720 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 18:27:50,720 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 18:27:50,721 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 18:27:50,721 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 18:27:50,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 18:27:50,721 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-11 18:27:50,722 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-11 18:27:50,722 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 18:27:51,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 18:27:51,066 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 18:27:51,069 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 18:27:51,070 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 18:27:51,071 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 18:27:51,071 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_rmo.opt.i [2020-10-11 18:27:51,126 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05de692a3/bf04a29909214afcaddc023289799350/FLAGd5d7943cc [2020-10-11 18:27:51,634 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 18:27:51,634 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_rmo.opt.i [2020-10-11 18:27:51,652 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05de692a3/bf04a29909214afcaddc023289799350/FLAGd5d7943cc [2020-10-11 18:27:51,960 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05de692a3/bf04a29909214afcaddc023289799350 [2020-10-11 18:27:51,969 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 18:27:51,971 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 18:27:51,972 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 18:27:51,972 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 18:27:51,978 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 18:27:51,979 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:27:51" (1/1) ... [2020-10-11 18:27:51,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27771aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:51, skipping insertion in model container [2020-10-11 18:27:51,985 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:27:51" (1/1) ... [2020-10-11 18:27:51,995 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 18:27:52,069 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 18:27:52,616 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:27:52,629 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 18:27:52,702 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:27:52,778 INFO L208 MainTranslator]: Completed translation [2020-10-11 18:27:52,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:52 WrapperNode [2020-10-11 18:27:52,779 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 18:27:52,780 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 18:27:52,780 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 18:27:52,781 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 18:27:52,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:52" (1/1) ... [2020-10-11 18:27:52,810 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:52" (1/1) ... [2020-10-11 18:27:52,851 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 18:27:52,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 18:27:52,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 18:27:52,852 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 18:27:52,861 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:52" (1/1) ... [2020-10-11 18:27:52,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:52" (1/1) ... [2020-10-11 18:27:52,866 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:52" (1/1) ... [2020-10-11 18:27:52,866 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:52" (1/1) ... [2020-10-11 18:27:52,877 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:52" (1/1) ... [2020-10-11 18:27:52,881 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:52" (1/1) ... [2020-10-11 18:27:52,885 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:52" (1/1) ... [2020-10-11 18:27:52,890 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 18:27:52,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 18:27:52,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 18:27:52,891 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 18:27:52,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:52" (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-11 18:27:52,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 18:27:52,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 18:27:52,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 18:27:52,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 18:27:52,963 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 18:27:52,963 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 18:27:52,963 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 18:27:52,964 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 18:27:52,964 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 18:27:52,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 18:27:52,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 18:27:52,966 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 18:27:54,908 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 18:27:54,909 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 18:27:54,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:27:54 BoogieIcfgContainer [2020-10-11 18:27:54,911 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 18:27:54,913 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 18:27:54,913 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 18:27:54,916 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 18:27:54,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:27:51" (1/3) ... [2020-10-11 18:27:54,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52dbda8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:27:54, skipping insertion in model container [2020-10-11 18:27:54,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:27:52" (2/3) ... [2020-10-11 18:27:54,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52dbda8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:27:54, skipping insertion in model container [2020-10-11 18:27:54,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:27:54" (3/3) ... [2020-10-11 18:27:54,920 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi001_rmo.opt.i [2020-10-11 18:27:54,932 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 18:27:54,940 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 18:27:54,942 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 18:27:54,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,969 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,970 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,972 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,972 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,972 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,972 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,972 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,973 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,973 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,973 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,974 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,975 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,975 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,975 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,975 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,975 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,976 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,976 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,976 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,977 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,977 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,979 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,979 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,979 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,979 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,981 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,981 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,986 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,986 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,986 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,986 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,987 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,987 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,987 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,987 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,987 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,988 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,990 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,990 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,991 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,992 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,992 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,992 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,992 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:54,992 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:27:55,012 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-11 18:27:55,036 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 18:27:55,036 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-11 18:27:55,036 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 18:27:55,036 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 18:27:55,036 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 18:27:55,036 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 18:27:55,037 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 18:27:55,037 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 18:27:55,055 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 84 places, 79 transitions, 168 flow [2020-10-11 18:27:55,110 INFO L129 PetriNetUnfolder]: 2/77 cut-off events. [2020-10-11 18:27:55,111 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:27:55,117 INFO L80 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 77 events. 2/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2020-10-11 18:27:55,117 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 79 transitions, 168 flow [2020-10-11 18:27:55,130 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 77 transitions, 160 flow [2020-10-11 18:27:55,157 INFO L129 PetriNetUnfolder]: 0/44 cut-off events. [2020-10-11 18:27:55,158 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:27:55,158 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:27:55,159 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] [2020-10-11 18:27:55,160 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:27:55,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:27:55,169 INFO L82 PathProgramCache]: Analyzing trace with hash 424462516, now seen corresponding path program 1 times [2020-10-11 18:27:55,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:27:55,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056827130] [2020-10-11 18:27:55,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:27:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:27:55,546 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-11 18:27:55,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056827130] [2020-10-11 18:27:55,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:27:55,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 18:27:55,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890529530] [2020-10-11 18:27:55,562 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 18:27:55,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:27:55,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 18:27:55,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 18:27:55,701 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 79 [2020-10-11 18:27:55,703 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 77 transitions, 160 flow. Second operand 3 states. [2020-10-11 18:27:55,704 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:27:55,705 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 79 [2020-10-11 18:27:55,706 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:27:55,747 INFO L129 PetriNetUnfolder]: 0/74 cut-off events. [2020-10-11 18:27:55,747 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:27:55,748 INFO L80 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 74 events. 0/74 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 4/76 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2020-10-11 18:27:55,749 INFO L132 encePairwiseOnDemand]: 74/79 looper letters, 0 selfloop transitions, 2 changer transitions 9/74 dead transitions. [2020-10-11 18:27:55,750 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 74 transitions, 158 flow [2020-10-11 18:27:55,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 18:27:55,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-11 18:27:55,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 229 transitions. [2020-10-11 18:27:55,770 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9662447257383966 [2020-10-11 18:27:55,771 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 229 transitions. [2020-10-11 18:27:55,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 229 transitions. [2020-10-11 18:27:55,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:27:55,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 229 transitions. [2020-10-11 18:27:55,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-11 18:27:55,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-11 18:27:55,820 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-11 18:27:55,823 INFO L185 Difference]: Start difference. First operand has 82 places, 77 transitions, 160 flow. Second operand 3 states and 229 transitions. [2020-10-11 18:27:55,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 74 transitions, 158 flow [2020-10-11 18:27:55,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 74 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-11 18:27:55,832 INFO L241 Difference]: Finished difference. Result has 81 places, 65 transitions, 138 flow [2020-10-11 18:27:55,835 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=81, PETRI_TRANSITIONS=65} [2020-10-11 18:27:55,836 INFO L341 CegarLoopForPetriNet]: 82 programPoint places, -1 predicate places. [2020-10-11 18:27:55,837 INFO L481 AbstractCegarLoop]: Abstraction has has 81 places, 65 transitions, 138 flow [2020-10-11 18:27:55,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 18:27:55,837 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:27:55,837 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] [2020-10-11 18:27:55,838 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 18:27:55,838 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:27:55,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:27:55,839 INFO L82 PathProgramCache]: Analyzing trace with hash 446928039, now seen corresponding path program 1 times [2020-10-11 18:27:55,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:27:55,839 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939212190] [2020-10-11 18:27:55,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:27:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:27:56,129 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-11 18:27:56,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939212190] [2020-10-11 18:27:56,130 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:27:56,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:27:56,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929849659] [2020-10-11 18:27:56,132 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:27:56,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:27:56,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:27:56,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:27:56,257 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 79 [2020-10-11 18:27:56,257 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 65 transitions, 138 flow. Second operand 6 states. [2020-10-11 18:27:56,258 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:27:56,258 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 79 [2020-10-11 18:27:56,258 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:27:56,379 INFO L129 PetriNetUnfolder]: 3/81 cut-off events. [2020-10-11 18:27:56,379 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:27:56,380 INFO L80 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 81 events. 3/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 104 event pairs, 0 based on Foata normal form. 2/83 useless extension candidates. Maximal degree in co-relation 69. Up to 7 conditions per place. [2020-10-11 18:27:56,380 INFO L132 encePairwiseOnDemand]: 73/79 looper letters, 6 selfloop transitions, 2 changer transitions 10/75 dead transitions. [2020-10-11 18:27:56,381 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 75 transitions, 194 flow [2020-10-11 18:27:56,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:27:56,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:27:56,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 641 transitions. [2020-10-11 18:27:56,388 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9015471167369902 [2020-10-11 18:27:56,388 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 641 transitions. [2020-10-11 18:27:56,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 641 transitions. [2020-10-11 18:27:56,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:27:56,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 641 transitions. [2020-10-11 18:27:56,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:27:56,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:27:56,396 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:27:56,396 INFO L185 Difference]: Start difference. First operand has 81 places, 65 transitions, 138 flow. Second operand 9 states and 641 transitions. [2020-10-11 18:27:56,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 75 transitions, 194 flow [2020-10-11 18:27:56,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 75 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-11 18:27:56,400 INFO L241 Difference]: Finished difference. Result has 85 places, 65 transitions, 154 flow [2020-10-11 18:27:56,401 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=154, PETRI_PLACES=85, PETRI_TRANSITIONS=65} [2020-10-11 18:27:56,402 INFO L341 CegarLoopForPetriNet]: 82 programPoint places, 3 predicate places. [2020-10-11 18:27:56,402 INFO L481 AbstractCegarLoop]: Abstraction has has 85 places, 65 transitions, 154 flow [2020-10-11 18:27:56,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:27:56,402 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:27:56,402 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] [2020-10-11 18:27:56,403 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 18:27:56,403 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:27:56,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:27:56,403 INFO L82 PathProgramCache]: Analyzing trace with hash 589465482, now seen corresponding path program 1 times [2020-10-11 18:27:56,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:27:56,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764242760] [2020-10-11 18:27:56,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:27:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:27:56,743 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-11 18:27:56,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764242760] [2020-10-11 18:27:56,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:27:56,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 18:27:56,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251362381] [2020-10-11 18:27:56,744 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 18:27:56,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:27:56,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 18:27:56,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 18:27:57,437 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 79 [2020-10-11 18:27:57,438 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 65 transitions, 154 flow. Second operand 11 states. [2020-10-11 18:27:57,438 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:27:57,438 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 79 [2020-10-11 18:27:57,439 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:27:57,847 INFO L129 PetriNetUnfolder]: 64/246 cut-off events. [2020-10-11 18:27:57,848 INFO L130 PetriNetUnfolder]: For 59/59 co-relation queries the response was YES. [2020-10-11 18:27:57,852 INFO L80 FinitePrefix]: Finished finitePrefix Result has 465 conditions, 246 events. 64/246 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1045 event pairs, 29 based on Foata normal form. 6/247 useless extension candidates. Maximal degree in co-relation 420. Up to 81 conditions per place. [2020-10-11 18:27:57,855 INFO L132 encePairwiseOnDemand]: 67/79 looper letters, 13 selfloop transitions, 9 changer transitions 22/93 dead transitions. [2020-10-11 18:27:57,855 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 93 transitions, 316 flow [2020-10-11 18:27:57,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:27:57,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:27:57,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 886 transitions. [2020-10-11 18:27:57,861 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8010849909584087 [2020-10-11 18:27:57,861 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 886 transitions. [2020-10-11 18:27:57,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 886 transitions. [2020-10-11 18:27:57,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:27:57,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 886 transitions. [2020-10-11 18:27:57,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:27:57,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:27:57,870 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:27:57,870 INFO L185 Difference]: Start difference. First operand has 85 places, 65 transitions, 154 flow. Second operand 14 states and 886 transitions. [2020-10-11 18:27:57,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 93 transitions, 316 flow [2020-10-11 18:27:57,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 93 transitions, 284 flow, removed 14 selfloop flow, removed 8 redundant places. [2020-10-11 18:27:57,879 INFO L241 Difference]: Finished difference. Result has 92 places, 69 transitions, 196 flow [2020-10-11 18:27:57,879 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=196, PETRI_PLACES=92, PETRI_TRANSITIONS=69} [2020-10-11 18:27:57,880 INFO L341 CegarLoopForPetriNet]: 82 programPoint places, 10 predicate places. [2020-10-11 18:27:57,880 INFO L481 AbstractCegarLoop]: Abstraction has has 92 places, 69 transitions, 196 flow [2020-10-11 18:27:57,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 18:27:57,880 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:27:57,880 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] [2020-10-11 18:27:57,881 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 18:27:57,881 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:27:57,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:27:57,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1487661237, now seen corresponding path program 1 times [2020-10-11 18:27:57,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:27:57,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724456378] [2020-10-11 18:27:57,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:27:58,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:27:58,247 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-11 18:27:58,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724456378] [2020-10-11 18:27:58,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:27:58,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 18:27:58,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265693015] [2020-10-11 18:27:58,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 18:27:58,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:27:58,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 18:27:58,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 18:27:59,266 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 79 [2020-10-11 18:27:59,267 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 69 transitions, 196 flow. Second operand 8 states. [2020-10-11 18:27:59,267 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:27:59,267 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 79 [2020-10-11 18:27:59,267 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:27:59,649 INFO L129 PetriNetUnfolder]: 160/521 cut-off events. [2020-10-11 18:27:59,658 INFO L130 PetriNetUnfolder]: For 599/600 co-relation queries the response was YES. [2020-10-11 18:27:59,665 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 521 events. 160/521 cut-off events. For 599/600 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2998 event pairs, 42 based on Foata normal form. 4/521 useless extension candidates. Maximal degree in co-relation 1116. Up to 117 conditions per place. [2020-10-11 18:27:59,669 INFO L132 encePairwiseOnDemand]: 68/79 looper letters, 27 selfloop transitions, 30 changer transitions 0/108 dead transitions. [2020-10-11 18:27:59,669 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 108 transitions, 463 flow [2020-10-11 18:27:59,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 18:27:59,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-11 18:27:59,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 714 transitions. [2020-10-11 18:27:59,672 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8216340621403913 [2020-10-11 18:27:59,673 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 714 transitions. [2020-10-11 18:27:59,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 714 transitions. [2020-10-11 18:27:59,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:27:59,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 714 transitions. [2020-10-11 18:27:59,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-11 18:27:59,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-11 18:27:59,677 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-11 18:27:59,678 INFO L185 Difference]: Start difference. First operand has 92 places, 69 transitions, 196 flow. Second operand 11 states and 714 transitions. [2020-10-11 18:27:59,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 108 transitions, 463 flow [2020-10-11 18:27:59,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 108 transitions, 449 flow, removed 3 selfloop flow, removed 7 redundant places. [2020-10-11 18:27:59,684 INFO L241 Difference]: Finished difference. Result has 97 places, 97 transitions, 452 flow [2020-10-11 18:27:59,684 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=452, PETRI_PLACES=97, PETRI_TRANSITIONS=97} [2020-10-11 18:27:59,684 INFO L341 CegarLoopForPetriNet]: 82 programPoint places, 15 predicate places. [2020-10-11 18:27:59,685 INFO L481 AbstractCegarLoop]: Abstraction has has 97 places, 97 transitions, 452 flow [2020-10-11 18:27:59,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 18:27:59,685 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:27:59,685 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] [2020-10-11 18:27:59,685 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 18:27:59,686 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:27:59,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:27:59,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1498216363, now seen corresponding path program 2 times [2020-10-11 18:27:59,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:27:59,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437817966] [2020-10-11 18:27:59,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:27:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:27:59,816 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-11 18:27:59,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437817966] [2020-10-11 18:27:59,817 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:27:59,817 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:27:59,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451295489] [2020-10-11 18:27:59,818 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:27:59,818 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:27:59,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:27:59,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:27:59,927 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 79 [2020-10-11 18:27:59,928 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 97 transitions, 452 flow. Second operand 6 states. [2020-10-11 18:27:59,928 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:27:59,928 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 79 [2020-10-11 18:27:59,928 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:28:00,121 INFO L129 PetriNetUnfolder]: 101/372 cut-off events. [2020-10-11 18:28:00,122 INFO L130 PetriNetUnfolder]: For 511/523 co-relation queries the response was YES. [2020-10-11 18:28:00,125 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1040 conditions, 372 events. 101/372 cut-off events. For 511/523 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1864 event pairs, 6 based on Foata normal form. 14/371 useless extension candidates. Maximal degree in co-relation 983. Up to 81 conditions per place. [2020-10-11 18:28:00,127 INFO L132 encePairwiseOnDemand]: 71/79 looper letters, 11 selfloop transitions, 8 changer transitions 31/116 dead transitions. [2020-10-11 18:28:00,127 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 116 transitions, 616 flow [2020-10-11 18:28:00,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:28:00,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:28:00,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 633 transitions. [2020-10-11 18:28:00,131 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.890295358649789 [2020-10-11 18:28:00,131 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 633 transitions. [2020-10-11 18:28:00,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 633 transitions. [2020-10-11 18:28:00,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:28:00,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 633 transitions. [2020-10-11 18:28:00,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:28:00,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:28:00,137 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:28:00,137 INFO L185 Difference]: Start difference. First operand has 97 places, 97 transitions, 452 flow. Second operand 9 states and 633 transitions. [2020-10-11 18:28:00,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 116 transitions, 616 flow [2020-10-11 18:28:00,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 116 transitions, 556 flow, removed 29 selfloop flow, removed 1 redundant places. [2020-10-11 18:28:00,148 INFO L241 Difference]: Finished difference. Result has 110 places, 82 transitions, 333 flow [2020-10-11 18:28:00,148 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=333, PETRI_PLACES=110, PETRI_TRANSITIONS=82} [2020-10-11 18:28:00,149 INFO L341 CegarLoopForPetriNet]: 82 programPoint places, 28 predicate places. [2020-10-11 18:28:00,149 INFO L481 AbstractCegarLoop]: Abstraction has has 110 places, 82 transitions, 333 flow [2020-10-11 18:28:00,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:28:00,149 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:28:00,150 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-11 18:28:00,150 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 18:28:00,150 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:28:00,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:28:00,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1610810307, now seen corresponding path program 1 times [2020-10-11 18:28:00,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:28:00,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421889809] [2020-10-11 18:28:00,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:28:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:28:00,310 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-11 18:28:00,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421889809] [2020-10-11 18:28:00,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:28:00,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:28:00,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835227700] [2020-10-11 18:28:00,311 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:28:00,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:28:00,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:28:00,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:28:00,466 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 79 [2020-10-11 18:28:00,467 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 82 transitions, 333 flow. Second operand 7 states. [2020-10-11 18:28:00,467 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:28:00,467 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 79 [2020-10-11 18:28:00,467 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:28:00,660 INFO L129 PetriNetUnfolder]: 29/204 cut-off events. [2020-10-11 18:28:00,660 INFO L130 PetriNetUnfolder]: For 311/314 co-relation queries the response was YES. [2020-10-11 18:28:00,662 INFO L80 FinitePrefix]: Finished finitePrefix Result has 581 conditions, 204 events. 29/204 cut-off events. For 311/314 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 812 event pairs, 5 based on Foata normal form. 6/208 useless extension candidates. Maximal degree in co-relation 541. Up to 27 conditions per place. [2020-10-11 18:28:00,663 INFO L132 encePairwiseOnDemand]: 71/79 looper letters, 9 selfloop transitions, 12 changer transitions 7/94 dead transitions. [2020-10-11 18:28:00,663 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 94 transitions, 458 flow [2020-10-11 18:28:00,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:28:00,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:28:00,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 832 transitions. [2020-10-11 18:28:00,666 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8776371308016878 [2020-10-11 18:28:00,667 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 832 transitions. [2020-10-11 18:28:00,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 832 transitions. [2020-10-11 18:28:00,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:28:00,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 832 transitions. [2020-10-11 18:28:00,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:28:00,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:28:00,671 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:28:00,672 INFO L185 Difference]: Start difference. First operand has 110 places, 82 transitions, 333 flow. Second operand 12 states and 832 transitions. [2020-10-11 18:28:00,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 94 transitions, 458 flow [2020-10-11 18:28:00,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 94 transitions, 382 flow, removed 28 selfloop flow, removed 16 redundant places. [2020-10-11 18:28:00,677 INFO L241 Difference]: Finished difference. Result has 106 places, 85 transitions, 344 flow [2020-10-11 18:28:00,678 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=344, PETRI_PLACES=106, PETRI_TRANSITIONS=85} [2020-10-11 18:28:00,678 INFO L341 CegarLoopForPetriNet]: 82 programPoint places, 24 predicate places. [2020-10-11 18:28:00,678 INFO L481 AbstractCegarLoop]: Abstraction has has 106 places, 85 transitions, 344 flow [2020-10-11 18:28:00,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:28:00,678 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:28:00,679 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, 1, 1, 1, 1, 1] [2020-10-11 18:28:00,679 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 18:28:00,679 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:28:00,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:28:00,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1393060543, now seen corresponding path program 1 times [2020-10-11 18:28:00,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:28:00,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824706736] [2020-10-11 18:28:00,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:28:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:28:00,851 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-11 18:28:00,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824706736] [2020-10-11 18:28:00,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:28:00,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:28:00,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842497124] [2020-10-11 18:28:00,852 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:28:00,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:28:00,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:28:00,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:28:01,085 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 79 [2020-10-11 18:28:01,086 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 85 transitions, 344 flow. Second operand 7 states. [2020-10-11 18:28:01,086 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:28:01,086 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 79 [2020-10-11 18:28:01,087 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:28:01,220 INFO L129 PetriNetUnfolder]: 38/287 cut-off events. [2020-10-11 18:28:01,220 INFO L130 PetriNetUnfolder]: For 290/293 co-relation queries the response was YES. [2020-10-11 18:28:01,222 INFO L80 FinitePrefix]: Finished finitePrefix Result has 757 conditions, 287 events. 38/287 cut-off events. For 290/293 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1549 event pairs, 8 based on Foata normal form. 1/286 useless extension candidates. Maximal degree in co-relation 709. Up to 40 conditions per place. [2020-10-11 18:28:01,222 INFO L132 encePairwiseOnDemand]: 73/79 looper letters, 9 selfloop transitions, 1 changer transitions 11/90 dead transitions. [2020-10-11 18:28:01,223 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 90 transitions, 384 flow [2020-10-11 18:28:01,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 18:28:01,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-11 18:28:01,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 485 transitions. [2020-10-11 18:28:01,225 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8770343580470162 [2020-10-11 18:28:01,225 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 485 transitions. [2020-10-11 18:28:01,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 485 transitions. [2020-10-11 18:28:01,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:28:01,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 485 transitions. [2020-10-11 18:28:01,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-11 18:28:01,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-11 18:28:01,229 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-11 18:28:01,229 INFO L185 Difference]: Start difference. First operand has 106 places, 85 transitions, 344 flow. Second operand 7 states and 485 transitions. [2020-10-11 18:28:01,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 90 transitions, 384 flow [2020-10-11 18:28:01,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 90 transitions, 363 flow, removed 5 selfloop flow, removed 6 redundant places. [2020-10-11 18:28:01,236 INFO L241 Difference]: Finished difference. Result has 109 places, 79 transitions, 295 flow [2020-10-11 18:28:01,237 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=295, PETRI_PLACES=109, PETRI_TRANSITIONS=79} [2020-10-11 18:28:01,237 INFO L341 CegarLoopForPetriNet]: 82 programPoint places, 27 predicate places. [2020-10-11 18:28:01,237 INFO L481 AbstractCegarLoop]: Abstraction has has 109 places, 79 transitions, 295 flow [2020-10-11 18:28:01,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:28:01,238 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:28:01,238 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, 1, 1, 1, 1, 1] [2020-10-11 18:28:01,238 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 18:28:01,239 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:28:01,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:28:01,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1877904079, now seen corresponding path program 2 times [2020-10-11 18:28:01,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:28:01,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964954498] [2020-10-11 18:28:01,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:28:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:28:01,287 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:28:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:28:01,333 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:28:01,373 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 18:28:01,373 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 18:28:01,374 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 18:28:01,403 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-11 18:28:01,404 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:28:01,405 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-11 18:28:01,405 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:28:01,405 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-11 18:28:01,405 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:28:01,405 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-11 18:28:01,406 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:28:01,406 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-11 18:28:01,406 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:28:01,406 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-11 18:28:01,406 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:28:01,407 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-11 18:28:01,407 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:28:01,407 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-11 18:28:01,407 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:28:01,407 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-11 18:28:01,407 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:28:01,408 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-11 18:28:01,408 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:28:01,408 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-11 18:28:01,408 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:28:01,409 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-11 18:28:01,409 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:28:01,409 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-11 18:28:01,410 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:28:01,410 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-11 18:28:01,410 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:28:01,410 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-11 18:28:01,410 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:28:01,410 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-11 18:28:01,411 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:28:01,411 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-11 18:28:01,411 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:28:01,411 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-11 18:28:01,412 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:28:01,412 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-11 18:28:01,412 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:28:01,412 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-11 18:28:01,412 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:28:01,413 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-11 18:28:01,413 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:28:01,413 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-11 18:28:01,413 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:28:01,413 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-11 18:28:01,414 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:28:01,414 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-11 18:28:01,414 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:28:01,414 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-11 18:28:01,414 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:28:01,414 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-11 18:28:01,415 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:28:01,415 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-11 18:28:01,415 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:28:01,415 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-11 18:28:01,415 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:28:01,416 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-11 18:28:01,416 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:28:01,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:28:01 BasicIcfg [2020-10-11 18:28:01,498 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 18:28:01,502 INFO L168 Benchmark]: Toolchain (without parser) took 9530.15 ms. Allocated memory was 252.7 MB in the beginning and 495.5 MB in the end (delta: 242.7 MB). Free memory was 207.2 MB in the beginning and 224.9 MB in the end (delta: -17.7 MB). Peak memory consumption was 225.0 MB. Max. memory is 14.2 GB. [2020-10-11 18:28:01,505 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 252.7 MB. Free memory is still 229.1 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 18:28:01,506 INFO L168 Benchmark]: CACSL2BoogieTranslator took 807.92 ms. Allocated memory was 252.7 MB in the beginning and 317.2 MB in the end (delta: 64.5 MB). Free memory was 207.2 MB in the beginning and 268.0 MB in the end (delta: -60.8 MB). Peak memory consumption was 27.0 MB. Max. memory is 14.2 GB. [2020-10-11 18:28:01,507 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.11 ms. Allocated memory is still 317.2 MB. Free memory was 268.0 MB in the beginning and 265.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:28:01,509 INFO L168 Benchmark]: Boogie Preprocessor took 38.75 ms. Allocated memory is still 317.2 MB. Free memory was 265.5 MB in the beginning and 263.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:28:01,510 INFO L168 Benchmark]: RCFGBuilder took 2020.72 ms. Allocated memory was 317.2 MB in the beginning and 360.2 MB in the end (delta: 43.0 MB). Free memory was 263.0 MB in the beginning and 216.8 MB in the end (delta: 46.2 MB). Peak memory consumption was 99.9 MB. Max. memory is 14.2 GB. [2020-10-11 18:28:01,511 INFO L168 Benchmark]: TraceAbstraction took 6585.87 ms. Allocated memory was 360.2 MB in the beginning and 495.5 MB in the end (delta: 135.3 MB). Free memory was 216.8 MB in the beginning and 224.9 MB in the end (delta: -8.1 MB). Peak memory consumption was 127.2 MB. Max. memory is 14.2 GB. [2020-10-11 18:28:01,518 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.20 ms. Allocated memory is still 252.7 MB. Free memory is still 229.1 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 807.92 ms. Allocated memory was 252.7 MB in the beginning and 317.2 MB in the end (delta: 64.5 MB). Free memory was 207.2 MB in the beginning and 268.0 MB in the end (delta: -60.8 MB). Peak memory consumption was 27.0 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 71.11 ms. Allocated memory is still 317.2 MB. Free memory was 268.0 MB in the beginning and 265.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 38.75 ms. Allocated memory is still 317.2 MB. Free memory was 265.5 MB in the beginning and 263.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2020.72 ms. Allocated memory was 317.2 MB in the beginning and 360.2 MB in the end (delta: 43.0 MB). Free memory was 263.0 MB in the beginning and 216.8 MB in the end (delta: 46.2 MB). Peak memory consumption was 99.9 MB. Max. memory is 14.2 GB. * TraceAbstraction took 6585.87 ms. Allocated memory was 360.2 MB in the beginning and 495.5 MB in the end (delta: 135.3 MB). Free memory was 216.8 MB in the beginning and 224.9 MB in the end (delta: -8.1 MB). Peak memory consumption was 127.2 MB. 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] [L699] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L701] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L702] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L703] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L705] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L707] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L708] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L709] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L710] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L711] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L712] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L713] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L714] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L715] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L716] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L717] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L718] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L719] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L720] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L721] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L723] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L724] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L725] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] 0 pthread_t t1611; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] FCALL, FORK 0 pthread_create(&t1611, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L793] 0 pthread_t t1612; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L794] FCALL, FORK 0 pthread_create(&t1612, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L749] 2 y$w_buff1 = y$w_buff0 [L750] 2 y$w_buff0 = 2 [L751] 2 y$w_buff1_used = y$w_buff0_used [L752] 2 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L754] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L755] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L756] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L757] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L760] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L735] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L735] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L736] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L737] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L738] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L739] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L742] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L796] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L800] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L800] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L802] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L804] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L807] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 0 y$flush_delayed = weak$$choice2 [L810] 0 y$mem_tmp = y [L811] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L812] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L813] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L813] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1 [L813] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L813] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L814] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L814] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L815] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L815] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L817] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L819] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L819] 0 y = y$flush_delayed ? y$mem_tmp : y [L820] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L7] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L7] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 78 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: 6.3s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 228 SDtfs, 208 SDslu, 571 SDs, 0 SdLazy, 666 SolverSat, 96 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=452occurred in iteration=4, 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.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 428 NumberOfCodeBlocks, 428 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 360 ConstructedInterpolants, 0 QuantifiedInterpolants, 86586 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...