/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/safe011_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 18:35:17,571 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 18:35:17,574 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 18:35:17,599 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 18:35:17,599 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 18:35:17,600 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 18:35:17,602 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 18:35:17,603 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 18:35:17,608 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 18:35:17,609 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 18:35:17,610 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 18:35:17,611 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 18:35:17,611 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 18:35:17,612 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 18:35:17,613 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 18:35:17,617 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 18:35:17,618 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 18:35:17,619 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 18:35:17,622 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 18:35:17,624 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 18:35:17,626 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 18:35:17,628 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 18:35:17,630 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 18:35:17,630 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 18:35:17,639 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 18:35:17,640 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 18:35:17,640 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 18:35:17,643 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 18:35:17,644 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 18:35:17,645 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 18:35:17,645 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 18:35:17,646 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 18:35:17,647 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 18:35:17,648 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 18:35:17,659 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 18:35:17,659 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 18:35:17,660 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 18:35:17,660 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 18:35:17,661 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 18:35:17,665 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 18:35:17,665 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 18:35:17,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:35:17,712 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 18:35:17,712 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 18:35:17,714 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 18:35:17,714 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 18:35:17,714 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 18:35:17,714 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 18:35:17,715 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 18:35:17,715 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 18:35:17,715 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 18:35:17,716 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 18:35:17,716 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 18:35:17,716 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 18:35:17,716 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 18:35:17,716 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 18:35:17,717 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 18:35:17,717 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 18:35:17,719 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 18:35:17,719 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 18:35:17,719 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 18:35:17,720 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 18:35:17,720 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 18:35:17,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 18:35:17,720 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 18:35:17,720 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 18:35:17,720 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 18:35:17,721 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 18:35:17,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 18:35:17,721 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-11 18:35:17,721 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-11 18:35:17,721 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 18:35:18,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 18:35:18,066 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 18:35:18,070 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 18:35:18,071 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 18:35:18,072 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 18:35:18,072 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.opt.i [2020-10-11 18:35:18,126 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8f24e7ac/eecbba0f4578402bbf7a810f096d250c/FLAGe4d1dc08b [2020-10-11 18:35:18,605 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 18:35:18,607 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.opt.i [2020-10-11 18:35:18,624 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8f24e7ac/eecbba0f4578402bbf7a810f096d250c/FLAGe4d1dc08b [2020-10-11 18:35:18,887 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8f24e7ac/eecbba0f4578402bbf7a810f096d250c [2020-10-11 18:35:18,896 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 18:35:18,898 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 18:35:18,900 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 18:35:18,900 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 18:35:18,904 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 18:35:18,904 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:35:18" (1/1) ... [2020-10-11 18:35:18,908 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1457336f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:35:18, skipping insertion in model container [2020-10-11 18:35:18,908 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:35:18" (1/1) ... [2020-10-11 18:35:18,917 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 18:35:18,981 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 18:35:19,455 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:35:19,573 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 18:35:19,672 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:35:19,781 INFO L208 MainTranslator]: Completed translation [2020-10-11 18:35:19,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:35:19 WrapperNode [2020-10-11 18:35:19,783 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 18:35:19,783 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 18:35:19,784 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 18:35:19,784 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 18:35:19,792 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:35:19" (1/1) ... [2020-10-11 18:35:19,812 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:35:19" (1/1) ... [2020-10-11 18:35:19,850 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 18:35:19,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 18:35:19,850 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 18:35:19,850 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 18:35:19,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:35:19" (1/1) ... [2020-10-11 18:35:19,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:35:19" (1/1) ... [2020-10-11 18:35:19,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:35:19" (1/1) ... [2020-10-11 18:35:19,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:35:19" (1/1) ... [2020-10-11 18:35:19,880 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:35:19" (1/1) ... [2020-10-11 18:35:19,885 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:35:19" (1/1) ... [2020-10-11 18:35:19,889 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:35:19" (1/1) ... [2020-10-11 18:35:19,894 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 18:35:19,895 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 18:35:19,895 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 18:35:19,895 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 18:35:19,896 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:35:19" (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:35:19,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 18:35:19,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 18:35:19,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 18:35:19,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 18:35:19,964 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 18:35:19,964 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 18:35:19,964 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 18:35:19,964 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 18:35:19,964 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-11 18:35:19,964 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-11 18:35:19,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 18:35:19,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 18:35:19,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 18:35:19,967 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:35:22,036 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 18:35:22,037 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 18:35:22,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:35:22 BoogieIcfgContainer [2020-10-11 18:35:22,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 18:35:22,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 18:35:22,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 18:35:22,043 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 18:35:22,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:35:18" (1/3) ... [2020-10-11 18:35:22,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a8d3428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:35:22, skipping insertion in model container [2020-10-11 18:35:22,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:35:19" (2/3) ... [2020-10-11 18:35:22,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a8d3428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:35:22, skipping insertion in model container [2020-10-11 18:35:22,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:35:22" (3/3) ... [2020-10-11 18:35:22,047 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_power.opt.i [2020-10-11 18:35:22,058 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 18:35:22,067 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 18:35:22,068 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 18:35:22,098 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,098 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,098 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,099 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,099 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,101 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,101 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,101 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,102 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,103 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,103 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,103 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,104 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,105 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,105 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,105 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,105 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,107 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,107 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,114 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,115 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,116 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,123 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,123 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,123 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,123 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,124 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,124 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,127 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,128 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,128 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,128 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,128 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:35:22,149 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-11 18:35:22,171 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 18:35:22,171 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-11 18:35:22,171 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 18:35:22,172 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 18:35:22,172 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 18:35:22,172 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 18:35:22,172 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 18:35:22,172 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 18:35:22,187 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow [2020-10-11 18:35:22,236 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-11 18:35:22,236 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:35:22,241 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-11 18:35:22,242 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 92 transitions, 199 flow [2020-10-11 18:35:22,249 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 89 transitions, 187 flow [2020-10-11 18:35:22,263 INFO L129 PetriNetUnfolder]: 0/46 cut-off events. [2020-10-11 18:35:22,263 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:35:22,264 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:35:22,265 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] [2020-10-11 18:35:22,265 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:35:22,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:35:22,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1224958673, now seen corresponding path program 1 times [2020-10-11 18:35:22,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:35:22,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367432359] [2020-10-11 18:35:22,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:35:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:35:22,651 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:35:22,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367432359] [2020-10-11 18:35:22,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:35:22,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 18:35:22,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608557891] [2020-10-11 18:35:22,665 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 18:35:22,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:35:22,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 18:35:22,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 18:35:22,789 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 92 [2020-10-11 18:35:22,791 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 89 transitions, 187 flow. Second operand 3 states. [2020-10-11 18:35:22,791 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:35:22,791 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 92 [2020-10-11 18:35:22,793 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:35:22,823 INFO L129 PetriNetUnfolder]: 0/86 cut-off events. [2020-10-11 18:35:22,824 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:35:22,824 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 86 events. 0/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 59 event pairs, 0 based on Foata normal form. 4/88 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2020-10-11 18:35:22,825 INFO L132 encePairwiseOnDemand]: 87/92 looper letters, 0 selfloop transitions, 2 changer transitions 11/86 dead transitions. [2020-10-11 18:35:22,826 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 86 transitions, 185 flow [2020-10-11 18:35:22,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 18:35:22,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-11 18:35:22,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 268 transitions. [2020-10-11 18:35:22,841 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9710144927536232 [2020-10-11 18:35:22,842 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 268 transitions. [2020-10-11 18:35:22,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 268 transitions. [2020-10-11 18:35:22,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:35:22,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 268 transitions. [2020-10-11 18:35:22,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-11 18:35:22,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-11 18:35:22,858 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-11 18:35:22,860 INFO L185 Difference]: Start difference. First operand has 97 places, 89 transitions, 187 flow. Second operand 3 states and 268 transitions. [2020-10-11 18:35:22,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 86 transitions, 185 flow [2020-10-11 18:35:22,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 86 transitions, 182 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-11 18:35:22,869 INFO L241 Difference]: Finished difference. Result has 95 places, 75 transitions, 160 flow [2020-10-11 18:35:22,872 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=95, PETRI_TRANSITIONS=75} [2020-10-11 18:35:22,873 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, -2 predicate places. [2020-10-11 18:35:22,874 INFO L481 AbstractCegarLoop]: Abstraction has has 95 places, 75 transitions, 160 flow [2020-10-11 18:35:22,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 18:35:22,874 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:35:22,874 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] [2020-10-11 18:35:22,875 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 18:35:22,875 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:35:22,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:35:22,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1029565863, now seen corresponding path program 1 times [2020-10-11 18:35:22,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:35:22,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70414454] [2020-10-11 18:35:22,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:35:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:35:23,164 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:35:23,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70414454] [2020-10-11 18:35:23,165 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:35:23,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:35:23,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124020874] [2020-10-11 18:35:23,167 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:35:23,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:35:23,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:35:23,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:35:23,294 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 92 [2020-10-11 18:35:23,294 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 75 transitions, 160 flow. Second operand 6 states. [2020-10-11 18:35:23,295 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:35:23,295 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 92 [2020-10-11 18:35:23,295 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:35:23,422 INFO L129 PetriNetUnfolder]: 3/101 cut-off events. [2020-10-11 18:35:23,423 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:35:23,424 INFO L80 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 101 events. 3/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 135 event pairs, 0 based on Foata normal form. 2/103 useless extension candidates. Maximal degree in co-relation 96. Up to 7 conditions per place. [2020-10-11 18:35:23,424 INFO L132 encePairwiseOnDemand]: 86/92 looper letters, 6 selfloop transitions, 2 changer transitions 10/85 dead transitions. [2020-10-11 18:35:23,424 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 85 transitions, 216 flow [2020-10-11 18:35:23,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:35:23,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:35:23,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 758 transitions. [2020-10-11 18:35:23,431 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9154589371980676 [2020-10-11 18:35:23,431 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 758 transitions. [2020-10-11 18:35:23,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 758 transitions. [2020-10-11 18:35:23,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:35:23,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 758 transitions. [2020-10-11 18:35:23,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:35:23,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:35:23,440 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:35:23,440 INFO L185 Difference]: Start difference. First operand has 95 places, 75 transitions, 160 flow. Second operand 9 states and 758 transitions. [2020-10-11 18:35:23,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 85 transitions, 216 flow [2020-10-11 18:35:23,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 85 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-11 18:35:23,448 INFO L241 Difference]: Finished difference. Result has 97 places, 75 transitions, 176 flow [2020-10-11 18:35:23,450 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=176, PETRI_PLACES=97, PETRI_TRANSITIONS=75} [2020-10-11 18:35:23,451 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 0 predicate places. [2020-10-11 18:35:23,451 INFO L481 AbstractCegarLoop]: Abstraction has has 97 places, 75 transitions, 176 flow [2020-10-11 18:35:23,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:35:23,451 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:35:23,452 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:35:23,452 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 18:35:23,452 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:35:23,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:35:23,453 INFO L82 PathProgramCache]: Analyzing trace with hash 232362298, now seen corresponding path program 1 times [2020-10-11 18:35:23,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:35:23,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103328276] [2020-10-11 18:35:23,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:35:23,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:35:23,646 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:35:23,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103328276] [2020-10-11 18:35:23,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:35:23,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:35:23,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120129893] [2020-10-11 18:35:23,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:35:23,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:35:23,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:35:23,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:35:23,906 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 92 [2020-10-11 18:35:23,906 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 75 transitions, 176 flow. Second operand 7 states. [2020-10-11 18:35:23,907 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:35:23,907 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 92 [2020-10-11 18:35:23,909 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:35:24,128 INFO L129 PetriNetUnfolder]: 4/98 cut-off events. [2020-10-11 18:35:24,129 INFO L130 PetriNetUnfolder]: For 17/24 co-relation queries the response was YES. [2020-10-11 18:35:24,129 INFO L80 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 98 events. 4/98 cut-off events. For 17/24 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 160 event pairs, 0 based on Foata normal form. 2/100 useless extension candidates. Maximal degree in co-relation 145. Up to 7 conditions per place. [2020-10-11 18:35:24,130 INFO L132 encePairwiseOnDemand]: 84/92 looper letters, 6 selfloop transitions, 4 changer transitions 12/87 dead transitions. [2020-10-11 18:35:24,130 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 87 transitions, 267 flow [2020-10-11 18:35:24,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-11 18:35:24,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-11 18:35:24,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 824 transitions. [2020-10-11 18:35:24,134 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8956521739130435 [2020-10-11 18:35:24,134 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 824 transitions. [2020-10-11 18:35:24,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 824 transitions. [2020-10-11 18:35:24,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:35:24,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 824 transitions. [2020-10-11 18:35:24,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-11 18:35:24,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-11 18:35:24,139 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-11 18:35:24,140 INFO L185 Difference]: Start difference. First operand has 97 places, 75 transitions, 176 flow. Second operand 10 states and 824 transitions. [2020-10-11 18:35:24,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 87 transitions, 267 flow [2020-10-11 18:35:24,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 87 transitions, 233 flow, removed 14 selfloop flow, removed 8 redundant places. [2020-10-11 18:35:24,143 INFO L241 Difference]: Finished difference. Result has 100 places, 75 transitions, 190 flow [2020-10-11 18:35:24,144 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=190, PETRI_PLACES=100, PETRI_TRANSITIONS=75} [2020-10-11 18:35:24,144 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 3 predicate places. [2020-10-11 18:35:24,144 INFO L481 AbstractCegarLoop]: Abstraction has has 100 places, 75 transitions, 190 flow [2020-10-11 18:35:24,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:35:24,145 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:35:24,145 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] [2020-10-11 18:35:24,145 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 18:35:24,146 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:35:24,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:35:24,146 INFO L82 PathProgramCache]: Analyzing trace with hash 816462000, now seen corresponding path program 1 times [2020-10-11 18:35:24,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:35:24,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225145764] [2020-10-11 18:35:24,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:35:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:35:24,299 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:35:24,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225145764] [2020-10-11 18:35:24,299 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:35:24,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:35:24,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308032869] [2020-10-11 18:35:24,300 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:35:24,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:35:24,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:35:24,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:35:24,475 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 92 [2020-10-11 18:35:24,476 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 75 transitions, 190 flow. Second operand 6 states. [2020-10-11 18:35:24,476 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:35:24,476 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 92 [2020-10-11 18:35:24,476 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:35:24,623 INFO L129 PetriNetUnfolder]: 24/178 cut-off events. [2020-10-11 18:35:24,623 INFO L130 PetriNetUnfolder]: For 66/69 co-relation queries the response was YES. [2020-10-11 18:35:24,625 INFO L80 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 178 events. 24/178 cut-off events. For 66/69 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 588 event pairs, 5 based on Foata normal form. 4/181 useless extension candidates. Maximal degree in co-relation 279. Up to 31 conditions per place. [2020-10-11 18:35:24,626 INFO L132 encePairwiseOnDemand]: 85/92 looper letters, 8 selfloop transitions, 3 changer transitions 19/96 dead transitions. [2020-10-11 18:35:24,626 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 96 transitions, 314 flow [2020-10-11 18:35:24,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:35:24,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:35:24,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 761 transitions. [2020-10-11 18:35:24,630 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9190821256038647 [2020-10-11 18:35:24,630 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 761 transitions. [2020-10-11 18:35:24,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 761 transitions. [2020-10-11 18:35:24,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:35:24,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 761 transitions. [2020-10-11 18:35:24,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:35:24,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:35:24,635 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:35:24,635 INFO L185 Difference]: Start difference. First operand has 100 places, 75 transitions, 190 flow. Second operand 9 states and 761 transitions. [2020-10-11 18:35:24,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 96 transitions, 314 flow [2020-10-11 18:35:24,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 96 transitions, 268 flow, removed 18 selfloop flow, removed 10 redundant places. [2020-10-11 18:35:24,639 INFO L241 Difference]: Finished difference. Result has 99 places, 77 transitions, 207 flow [2020-10-11 18:35:24,640 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=207, PETRI_PLACES=99, PETRI_TRANSITIONS=77} [2020-10-11 18:35:24,640 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 2 predicate places. [2020-10-11 18:35:24,640 INFO L481 AbstractCegarLoop]: Abstraction has has 99 places, 77 transitions, 207 flow [2020-10-11 18:35:24,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:35:24,641 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:35:24,641 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] [2020-10-11 18:35:24,641 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 18:35:24,641 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:35:24,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:35:24,642 INFO L82 PathProgramCache]: Analyzing trace with hash -530301641, now seen corresponding path program 1 times [2020-10-11 18:35:24,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:35:24,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940823326] [2020-10-11 18:35:24,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:35:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:35:24,792 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:35:24,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940823326] [2020-10-11 18:35:24,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:35:24,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:35:24,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745332399] [2020-10-11 18:35:24,794 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:35:24,794 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:35:24,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:35:24,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:35:24,969 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 92 [2020-10-11 18:35:24,970 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 77 transitions, 207 flow. Second operand 6 states. [2020-10-11 18:35:24,970 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:35:24,970 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 92 [2020-10-11 18:35:24,970 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:35:25,096 INFO L129 PetriNetUnfolder]: 7/141 cut-off events. [2020-10-11 18:35:25,097 INFO L130 PetriNetUnfolder]: For 115/121 co-relation queries the response was YES. [2020-10-11 18:35:25,098 INFO L80 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 141 events. 7/141 cut-off events. For 115/121 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 382 event pairs, 0 based on Foata normal form. 3/144 useless extension candidates. Maximal degree in co-relation 253. Up to 18 conditions per place. [2020-10-11 18:35:25,099 INFO L132 encePairwiseOnDemand]: 86/92 looper letters, 12 selfloop transitions, 3 changer transitions 10/91 dead transitions. [2020-10-11 18:35:25,099 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 91 transitions, 341 flow [2020-10-11 18:35:25,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:35:25,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:35:25,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 755 transitions. [2020-10-11 18:35:25,102 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9118357487922706 [2020-10-11 18:35:25,102 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 755 transitions. [2020-10-11 18:35:25,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 755 transitions. [2020-10-11 18:35:25,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:35:25,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 755 transitions. [2020-10-11 18:35:25,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:35:25,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:35:25,106 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:35:25,107 INFO L185 Difference]: Start difference. First operand has 99 places, 77 transitions, 207 flow. Second operand 9 states and 755 transitions. [2020-10-11 18:35:25,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 91 transitions, 341 flow [2020-10-11 18:35:25,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 91 transitions, 310 flow, removed 14 selfloop flow, removed 4 redundant places. [2020-10-11 18:35:25,111 INFO L241 Difference]: Finished difference. Result has 104 places, 77 transitions, 219 flow [2020-10-11 18:35:25,112 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=219, PETRI_PLACES=104, PETRI_TRANSITIONS=77} [2020-10-11 18:35:25,112 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 7 predicate places. [2020-10-11 18:35:25,112 INFO L481 AbstractCegarLoop]: Abstraction has has 104 places, 77 transitions, 219 flow [2020-10-11 18:35:25,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:35:25,113 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:35:25,113 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:35:25,113 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 18:35:25,113 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:35:25,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:35:25,114 INFO L82 PathProgramCache]: Analyzing trace with hash 698069081, now seen corresponding path program 1 times [2020-10-11 18:35:25,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:35:25,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685316265] [2020-10-11 18:35:25,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:35:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:35:25,318 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:35:25,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685316265] [2020-10-11 18:35:25,319 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:35:25,321 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 18:35:25,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050996382] [2020-10-11 18:35:25,321 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 18:35:25,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:35:25,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 18:35:25,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-10-11 18:35:25,969 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 92 [2020-10-11 18:35:25,970 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 77 transitions, 219 flow. Second operand 10 states. [2020-10-11 18:35:25,970 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:35:25,971 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 92 [2020-10-11 18:35:25,971 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:35:26,509 INFO L129 PetriNetUnfolder]: 420/1148 cut-off events. [2020-10-11 18:35:26,509 INFO L130 PetriNetUnfolder]: For 1247/1261 co-relation queries the response was YES. [2020-10-11 18:35:26,517 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2503 conditions, 1148 events. 420/1148 cut-off events. For 1247/1261 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 7930 event pairs, 235 based on Foata normal form. 30/1145 useless extension candidates. Maximal degree in co-relation 2445. Up to 411 conditions per place. [2020-10-11 18:35:26,523 INFO L132 encePairwiseOnDemand]: 80/92 looper letters, 15 selfloop transitions, 9 changer transitions 28/112 dead transitions. [2020-10-11 18:35:26,524 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 112 transitions, 423 flow [2020-10-11 18:35:26,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 18:35:26,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 18:35:26,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 990 transitions. [2020-10-11 18:35:26,528 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8277591973244147 [2020-10-11 18:35:26,529 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 990 transitions. [2020-10-11 18:35:26,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 990 transitions. [2020-10-11 18:35:26,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:35:26,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 990 transitions. [2020-10-11 18:35:26,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 18:35:26,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 18:35:26,536 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 18:35:26,536 INFO L185 Difference]: Start difference. First operand has 104 places, 77 transitions, 219 flow. Second operand 13 states and 990 transitions. [2020-10-11 18:35:26,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 112 transitions, 423 flow [2020-10-11 18:35:26,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 112 transitions, 386 flow, removed 17 selfloop flow, removed 7 redundant places. [2020-10-11 18:35:26,547 INFO L241 Difference]: Finished difference. Result has 111 places, 82 transitions, 267 flow [2020-10-11 18:35:26,548 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=267, PETRI_PLACES=111, PETRI_TRANSITIONS=82} [2020-10-11 18:35:26,548 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 14 predicate places. [2020-10-11 18:35:26,548 INFO L481 AbstractCegarLoop]: Abstraction has has 111 places, 82 transitions, 267 flow [2020-10-11 18:35:26,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 18:35:26,548 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:35:26,549 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, 1] [2020-10-11 18:35:26,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 18:35:26,549 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:35:26,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:35:26,550 INFO L82 PathProgramCache]: Analyzing trace with hash -730749851, now seen corresponding path program 1 times [2020-10-11 18:35:26,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:35:26,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788788378] [2020-10-11 18:35:26,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:35:26,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:35:26,951 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:35:26,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788788378] [2020-10-11 18:35:26,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:35:26,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 18:35:26,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634979717] [2020-10-11 18:35:26,953 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 18:35:26,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:35:26,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 18:35:26,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-10-11 18:35:28,152 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 92 [2020-10-11 18:35:28,154 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 82 transitions, 267 flow. Second operand 11 states. [2020-10-11 18:35:28,154 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:35:28,154 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 92 [2020-10-11 18:35:28,154 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:35:28,786 INFO L129 PetriNetUnfolder]: 317/838 cut-off events. [2020-10-11 18:35:28,786 INFO L130 PetriNetUnfolder]: For 1998/2039 co-relation queries the response was YES. [2020-10-11 18:35:28,790 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2739 conditions, 838 events. 317/838 cut-off events. For 1998/2039 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4959 event pairs, 153 based on Foata normal form. 13/834 useless extension candidates. Maximal degree in co-relation 2675. Up to 411 conditions per place. [2020-10-11 18:35:28,796 INFO L132 encePairwiseOnDemand]: 80/92 looper letters, 19 selfloop transitions, 10 changer transitions 26/115 dead transitions. [2020-10-11 18:35:28,796 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 115 transitions, 589 flow [2020-10-11 18:35:28,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 18:35:28,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 18:35:28,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 989 transitions. [2020-10-11 18:35:28,800 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8269230769230769 [2020-10-11 18:35:28,800 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 989 transitions. [2020-10-11 18:35:28,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 989 transitions. [2020-10-11 18:35:28,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:35:28,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 989 transitions. [2020-10-11 18:35:28,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 18:35:28,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 18:35:28,806 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 18:35:28,806 INFO L185 Difference]: Start difference. First operand has 111 places, 82 transitions, 267 flow. Second operand 13 states and 989 transitions. [2020-10-11 18:35:28,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 115 transitions, 589 flow [2020-10-11 18:35:28,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 115 transitions, 569 flow, removed 7 selfloop flow, removed 6 redundant places. [2020-10-11 18:35:28,812 INFO L241 Difference]: Finished difference. Result has 118 places, 86 transitions, 328 flow [2020-10-11 18:35:28,813 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=328, PETRI_PLACES=118, PETRI_TRANSITIONS=86} [2020-10-11 18:35:28,813 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 21 predicate places. [2020-10-11 18:35:28,813 INFO L481 AbstractCegarLoop]: Abstraction has has 118 places, 86 transitions, 328 flow [2020-10-11 18:35:28,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 18:35:28,813 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:35:28,814 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, 1] [2020-10-11 18:35:28,814 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 18:35:28,814 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:35:28,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:35:28,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1445518261, now seen corresponding path program 2 times [2020-10-11 18:35:28,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:35:28,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895378583] [2020-10-11 18:35:28,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:35:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:35:28,982 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:35:28,982 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895378583] [2020-10-11 18:35:28,983 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:35:28,983 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 18:35:28,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270591060] [2020-10-11 18:35:28,984 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 18:35:28,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:35:28,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 18:35:28,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 18:35:29,542 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 92 [2020-10-11 18:35:29,543 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 86 transitions, 328 flow. Second operand 8 states. [2020-10-11 18:35:29,543 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:35:29,543 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 92 [2020-10-11 18:35:29,543 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:35:29,953 INFO L129 PetriNetUnfolder]: 337/925 cut-off events. [2020-10-11 18:35:29,953 INFO L130 PetriNetUnfolder]: For 6227/6395 co-relation queries the response was YES. [2020-10-11 18:35:29,959 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4088 conditions, 925 events. 337/925 cut-off events. For 6227/6395 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5993 event pairs, 88 based on Foata normal form. 31/944 useless extension candidates. Maximal degree in co-relation 4021. Up to 297 conditions per place. [2020-10-11 18:35:29,965 INFO L132 encePairwiseOnDemand]: 82/92 looper letters, 19 selfloop transitions, 11 changer transitions 25/118 dead transitions. [2020-10-11 18:35:29,966 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 118 transitions, 806 flow [2020-10-11 18:35:29,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 18:35:29,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-11 18:35:29,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 885 transitions. [2020-10-11 18:35:29,970 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8745059288537549 [2020-10-11 18:35:29,970 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 885 transitions. [2020-10-11 18:35:29,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 885 transitions. [2020-10-11 18:35:29,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:35:29,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 885 transitions. [2020-10-11 18:35:29,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-11 18:35:29,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-11 18:35:29,976 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-11 18:35:29,976 INFO L185 Difference]: Start difference. First operand has 118 places, 86 transitions, 328 flow. Second operand 11 states and 885 transitions. [2020-10-11 18:35:29,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 118 transitions, 806 flow [2020-10-11 18:35:29,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 118 transitions, 657 flow, removed 73 selfloop flow, removed 8 redundant places. [2020-10-11 18:35:29,987 INFO L241 Difference]: Finished difference. Result has 121 places, 89 transitions, 388 flow [2020-10-11 18:35:29,987 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=388, PETRI_PLACES=121, PETRI_TRANSITIONS=89} [2020-10-11 18:35:29,987 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 24 predicate places. [2020-10-11 18:35:29,988 INFO L481 AbstractCegarLoop]: Abstraction has has 121 places, 89 transitions, 388 flow [2020-10-11 18:35:29,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 18:35:29,988 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:35:29,988 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, 1] [2020-10-11 18:35:29,988 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 18:35:29,988 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:35:29,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:35:29,989 INFO L82 PathProgramCache]: Analyzing trace with hash -733008200, now seen corresponding path program 1 times [2020-10-11 18:35:29,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:35:29,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627049844] [2020-10-11 18:35:29,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:35:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:35:30,171 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:35:30,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627049844] [2020-10-11 18:35:30,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:35:30,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:35:30,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626359166] [2020-10-11 18:35:30,173 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:35:30,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:35:30,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:35:30,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:35:30,273 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 92 [2020-10-11 18:35:30,274 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 89 transitions, 388 flow. Second operand 6 states. [2020-10-11 18:35:30,274 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:35:30,295 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 92 [2020-10-11 18:35:30,295 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:35:30,642 INFO L129 PetriNetUnfolder]: 510/1446 cut-off events. [2020-10-11 18:35:30,643 INFO L130 PetriNetUnfolder]: For 4816/4959 co-relation queries the response was YES. [2020-10-11 18:35:30,657 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4311 conditions, 1446 events. 510/1446 cut-off events. For 4816/4959 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 11179 event pairs, 93 based on Foata normal form. 59/1420 useless extension candidates. Maximal degree in co-relation 4244. Up to 336 conditions per place. [2020-10-11 18:35:30,667 INFO L132 encePairwiseOnDemand]: 83/92 looper letters, 19 selfloop transitions, 16 changer transitions 0/114 dead transitions. [2020-10-11 18:35:30,667 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 114 transitions, 508 flow [2020-10-11 18:35:30,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:35:30,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:35:30,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 748 transitions. [2020-10-11 18:35:30,670 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9033816425120773 [2020-10-11 18:35:30,670 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 748 transitions. [2020-10-11 18:35:30,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 748 transitions. [2020-10-11 18:35:30,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:35:30,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 748 transitions. [2020-10-11 18:35:30,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:35:30,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:35:30,674 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:35:30,674 INFO L185 Difference]: Start difference. First operand has 121 places, 89 transitions, 388 flow. Second operand 9 states and 748 transitions. [2020-10-11 18:35:30,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 114 transitions, 508 flow [2020-10-11 18:35:30,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 114 transitions, 479 flow, removed 8 selfloop flow, removed 6 redundant places. [2020-10-11 18:35:30,686 INFO L241 Difference]: Finished difference. Result has 122 places, 103 transitions, 470 flow [2020-10-11 18:35:30,687 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=470, PETRI_PLACES=122, PETRI_TRANSITIONS=103} [2020-10-11 18:35:30,687 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 25 predicate places. [2020-10-11 18:35:30,687 INFO L481 AbstractCegarLoop]: Abstraction has has 122 places, 103 transitions, 470 flow [2020-10-11 18:35:30,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:35:30,688 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:35:30,688 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, 1, 1] [2020-10-11 18:35:30,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 18:35:30,688 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:35:30,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:35:30,689 INFO L82 PathProgramCache]: Analyzing trace with hash 603183610, now seen corresponding path program 1 times [2020-10-11 18:35:30,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:35:30,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51914667] [2020-10-11 18:35:30,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:35:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:35:30,828 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:35:30,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51914667] [2020-10-11 18:35:30,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:35:30,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:35:30,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727395957] [2020-10-11 18:35:30,829 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:35:30,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:35:30,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:35:30,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:35:30,984 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 92 [2020-10-11 18:35:30,985 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 103 transitions, 470 flow. Second operand 7 states. [2020-10-11 18:35:30,985 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:35:30,985 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 92 [2020-10-11 18:35:30,986 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:35:31,385 INFO L129 PetriNetUnfolder]: 360/1201 cut-off events. [2020-10-11 18:35:31,386 INFO L130 PetriNetUnfolder]: For 2979/3829 co-relation queries the response was YES. [2020-10-11 18:35:31,395 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3882 conditions, 1201 events. 360/1201 cut-off events. For 2979/3829 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 9914 event pairs, 16 based on Foata normal form. 228/1353 useless extension candidates. Maximal degree in co-relation 3813. Up to 342 conditions per place. [2020-10-11 18:35:31,401 INFO L132 encePairwiseOnDemand]: 83/92 looper letters, 15 selfloop transitions, 31 changer transitions 6/131 dead transitions. [2020-10-11 18:35:31,401 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 131 transitions, 755 flow [2020-10-11 18:35:31,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:35:31,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:35:31,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 998 transitions. [2020-10-11 18:35:31,405 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9039855072463768 [2020-10-11 18:35:31,405 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 998 transitions. [2020-10-11 18:35:31,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 998 transitions. [2020-10-11 18:35:31,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:35:31,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 998 transitions. [2020-10-11 18:35:31,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:35:31,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:35:31,413 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:35:31,413 INFO L185 Difference]: Start difference. First operand has 122 places, 103 transitions, 470 flow. Second operand 12 states and 998 transitions. [2020-10-11 18:35:31,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 131 transitions, 755 flow [2020-10-11 18:35:31,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 131 transitions, 753 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-11 18:35:31,424 INFO L241 Difference]: Finished difference. Result has 135 places, 122 transitions, 698 flow [2020-10-11 18:35:31,425 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=698, PETRI_PLACES=135, PETRI_TRANSITIONS=122} [2020-10-11 18:35:31,425 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 38 predicate places. [2020-10-11 18:35:31,425 INFO L481 AbstractCegarLoop]: Abstraction has has 135 places, 122 transitions, 698 flow [2020-10-11 18:35:31,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:35:31,425 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:35:31,426 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, 1, 1, 1, 1, 1] [2020-10-11 18:35:31,426 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 18:35:31,426 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:35:31,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:35:31,426 INFO L82 PathProgramCache]: Analyzing trace with hash -791967763, now seen corresponding path program 1 times [2020-10-11 18:35:31,426 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:35:31,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527351521] [2020-10-11 18:35:31,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:35:31,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:35:31,584 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:35:31,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527351521] [2020-10-11 18:35:31,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:35:31,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 18:35:31,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319144160] [2020-10-11 18:35:31,586 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 18:35:31,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:35:31,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 18:35:31,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 18:35:31,727 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 92 [2020-10-11 18:35:31,727 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 122 transitions, 698 flow. Second operand 8 states. [2020-10-11 18:35:31,727 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:35:31,728 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 92 [2020-10-11 18:35:31,728 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:35:32,227 INFO L129 PetriNetUnfolder]: 296/1073 cut-off events. [2020-10-11 18:35:32,227 INFO L130 PetriNetUnfolder]: For 3873/5060 co-relation queries the response was YES. [2020-10-11 18:35:32,237 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3933 conditions, 1073 events. 296/1073 cut-off events. For 3873/5060 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 9263 event pairs, 2 based on Foata normal form. 227/1225 useless extension candidates. Maximal degree in co-relation 3859. Up to 298 conditions per place. [2020-10-11 18:35:32,243 INFO L132 encePairwiseOnDemand]: 83/92 looper letters, 10 selfloop transitions, 36 changer transitions 22/141 dead transitions. [2020-10-11 18:35:32,243 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 141 transitions, 952 flow [2020-10-11 18:35:32,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:35:32,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:35:32,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1236 transitions. [2020-10-11 18:35:32,248 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8956521739130435 [2020-10-11 18:35:32,249 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1236 transitions. [2020-10-11 18:35:32,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1236 transitions. [2020-10-11 18:35:32,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:35:32,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1236 transitions. [2020-10-11 18:35:32,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:35:32,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:35:32,259 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:35:32,259 INFO L185 Difference]: Start difference. First operand has 135 places, 122 transitions, 698 flow. Second operand 15 states and 1236 transitions. [2020-10-11 18:35:32,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 141 transitions, 952 flow [2020-10-11 18:35:32,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 141 transitions, 760 flow, removed 82 selfloop flow, removed 10 redundant places. [2020-10-11 18:35:32,287 INFO L241 Difference]: Finished difference. Result has 145 places, 116 transitions, 610 flow [2020-10-11 18:35:32,288 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=610, PETRI_PLACES=145, PETRI_TRANSITIONS=116} [2020-10-11 18:35:32,288 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 48 predicate places. [2020-10-11 18:35:32,288 INFO L481 AbstractCegarLoop]: Abstraction has has 145 places, 116 transitions, 610 flow [2020-10-11 18:35:32,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 18:35:32,289 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:35:32,289 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:35:32,289 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 18:35:32,291 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:35:32,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:35:32,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1966124069, now seen corresponding path program 1 times [2020-10-11 18:35:32,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:35:32,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143294162] [2020-10-11 18:35:32,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:35:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:35:32,373 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:35:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:35:32,428 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:35:32,488 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 18:35:32,488 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 18:35:32,489 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 18:35:32,522 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:35:32,522 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:35:32,524 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:35:32,524 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:35:32,525 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:35:32,525 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:35:32,525 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:35:32,525 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:35:32,525 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:35:32,525 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:35:32,526 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:35:32,526 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:35:32,526 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:35:32,526 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:35:32,527 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:35:32,527 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:35:32,527 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:35:32,527 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:35:32,527 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:35:32,527 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:35:32,528 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:35:32,528 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:35:32,528 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:35:32,528 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:35:32,529 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:35:32,529 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:35:32,529 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:35:32,529 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:35:32,529 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:35:32,529 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:35:32,530 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:35:32,530 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:35:32,530 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:35:32,530 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:35:32,531 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:35:32,532 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:35:32,532 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:35:32,532 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:35:32,532 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:35:32,532 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:35:32,533 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:35:32,533 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:35:32,533 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:35:32,533 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:35:32,533 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:35:32,533 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:35:32,534 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:35:32,534 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:35:32,534 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:35:32,534 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:35:32,534 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:35:32,535 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:35:32,535 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:35:32,535 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:35:32,535 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:35:32,535 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:35:32,536 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:35:32,536 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:35:32,536 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:35:32,536 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:35:32,536 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:35:32,536 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:35:32,537 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:35:32,537 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:35:32,537 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:35:32,537 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:35:32,537 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:35:32,538 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:35:32,538 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:35:32,538 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:35:32,538 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:35:32,538 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:35:32,539 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:35:32,539 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:35:32,539 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:35:32,539 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:35:32,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:35:32 BasicIcfg [2020-10-11 18:35:32,684 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 18:35:32,687 INFO L168 Benchmark]: Toolchain (without parser) took 13788.14 ms. Allocated memory was 251.1 MB in the beginning and 568.3 MB in the end (delta: 317.2 MB). Free memory was 206.8 MB in the beginning and 380.5 MB in the end (delta: -173.6 MB). Peak memory consumption was 143.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:35:32,693 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 251.1 MB. Free memory is still 227.5 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 18:35:32,694 INFO L168 Benchmark]: CACSL2BoogieTranslator took 882.88 ms. Allocated memory was 251.1 MB in the beginning and 314.0 MB in the end (delta: 62.9 MB). Free memory was 206.8 MB in the beginning and 266.1 MB in the end (delta: -59.3 MB). Peak memory consumption was 36.1 MB. Max. memory is 14.2 GB. [2020-10-11 18:35:32,695 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.40 ms. Allocated memory is still 314.0 MB. Free memory was 266.1 MB in the beginning and 263.6 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:35:32,695 INFO L168 Benchmark]: Boogie Preprocessor took 44.63 ms. Allocated memory is still 314.0 MB. Free memory was 263.6 MB in the beginning and 261.1 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:35:32,701 INFO L168 Benchmark]: RCFGBuilder took 2144.18 ms. Allocated memory was 314.0 MB in the beginning and 357.6 MB in the end (delta: 43.5 MB). Free memory was 261.1 MB in the beginning and 184.2 MB in the end (delta: 76.9 MB). Peak memory consumption was 120.4 MB. Max. memory is 14.2 GB. [2020-10-11 18:35:32,702 INFO L168 Benchmark]: TraceAbstraction took 10643.97 ms. Allocated memory was 357.6 MB in the beginning and 568.3 MB in the end (delta: 210.8 MB). Free memory was 184.2 MB in the beginning and 380.5 MB in the end (delta: -196.3 MB). Peak memory consumption was 14.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:35:32,708 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.25 ms. Allocated memory is still 251.1 MB. Free memory is still 227.5 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 882.88 ms. Allocated memory was 251.1 MB in the beginning and 314.0 MB in the end (delta: 62.9 MB). Free memory was 206.8 MB in the beginning and 266.1 MB in the end (delta: -59.3 MB). Peak memory consumption was 36.1 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 66.40 ms. Allocated memory is still 314.0 MB. Free memory was 266.1 MB in the beginning and 263.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 44.63 ms. Allocated memory is still 314.0 MB. Free memory was 263.6 MB in the beginning and 261.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2144.18 ms. Allocated memory was 314.0 MB in the beginning and 357.6 MB in the end (delta: 43.5 MB). Free memory was 261.1 MB in the beginning and 184.2 MB in the end (delta: 76.9 MB). Peak memory consumption was 120.4 MB. Max. memory is 14.2 GB. * TraceAbstraction took 10643.97 ms. Allocated memory was 357.6 MB in the beginning and 568.3 MB in the end (delta: 210.8 MB). Free memory was 184.2 MB in the beginning and 380.5 MB in the end (delta: -196.3 MB). Peak memory consumption was 14.5 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: [L698] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L700] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L701] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L702] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L704] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L705] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L706] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L707] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L708] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L709] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L710] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L711] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L712] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L713] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L714] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L715] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L716] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L717] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L718] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L719] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L720] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L722] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L725] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L726] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L807] 0 pthread_t t2028; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L808] FCALL, FORK 0 pthread_create(&t2028, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L809] 0 pthread_t t2029; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L810] FCALL, FORK 0 pthread_create(&t2029, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L750] 2 x$w_buff1 = x$w_buff0 [L751] 2 x$w_buff0 = 2 [L752] 2 x$w_buff1_used = x$w_buff0_used [L753] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L755] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L756] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L757] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L758] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L759] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L811] 0 pthread_t t2030; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t2030, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L762] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L779] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L782] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L730] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L765] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L765] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L767] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L769] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L736] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L736] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L737] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L737] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L738] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L739] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L739] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L740] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L785] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L785] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L786] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L786] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L787] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L787] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L788] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L788] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L789] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L789] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L772] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L792] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L814] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L818] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L818] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L818] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L818] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L819] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L819] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L820] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L820] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L821] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L821] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L822] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L822] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L825] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 0 x$flush_delayed = weak$$choice2 [L828] 0 x$mem_tmp = x [L829] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1 [L829] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L829] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L830] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L830] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L830] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L830] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L831] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L831] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1 [L831] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L831] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L831] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L832] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L832] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L832] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L832] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L833] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L834] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L835] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L835] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L836] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L837] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L837] 0 x = x$flush_delayed ? x$mem_tmp : x [L838] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L7] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L7] 0 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 91 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: 10.3s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 345 SDtfs, 379 SDslu, 1064 SDs, 0 SdLazy, 1055 SolverSat, 201 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=698occurred in iteration=10, 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.6s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 713 NumberOfCodeBlocks, 713 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 633 ConstructedInterpolants, 0 QuantifiedInterpolants, 147089 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...