/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-24 10:56:42,941 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-24 10:56:42,944 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-24 10:56:42,978 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-24 10:56:42,979 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-24 10:56:42,981 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-24 10:56:42,984 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-24 10:56:42,989 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-24 10:56:42,991 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-24 10:56:42,995 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-24 10:56:42,996 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-24 10:56:42,997 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-24 10:56:42,998 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-24 10:56:42,999 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-24 10:56:43,000 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-24 10:56:43,001 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-24 10:56:43,004 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-24 10:56:43,005 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-24 10:56:43,007 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-24 10:56:43,014 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-24 10:56:43,015 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-24 10:56:43,016 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-24 10:56:43,017 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-24 10:56:43,019 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-24 10:56:43,024 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-24 10:56:43,025 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-24 10:56:43,025 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-24 10:56:43,026 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-24 10:56:43,027 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-24 10:56:43,027 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-24 10:56:43,028 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-24 10:56:43,028 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-24 10:56:43,030 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-24 10:56:43,030 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-24 10:56:43,031 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-24 10:56:43,031 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-24 10:56:43,031 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-24 10:56:43,032 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-24 10:56:43,032 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-24 10:56:43,032 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-24 10:56:43,033 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-24 10:56:43,036 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2021-03-24 10:56:43,069 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-24 10:56:43,069 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-24 10:56:43,072 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-24 10:56:43,072 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-24 10:56:43,072 INFO L138 SettingsManager]: * Use SBE=true [2021-03-24 10:56:43,072 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-24 10:56:43,072 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-24 10:56:43,072 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-24 10:56:43,072 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-24 10:56:43,073 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-24 10:56:43,073 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-24 10:56:43,074 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-24 10:56:43,074 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-24 10:56:43,074 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-24 10:56:43,074 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-24 10:56:43,074 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-24 10:56:43,074 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-24 10:56:43,075 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-24 10:56:43,075 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-24 10:56:43,075 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-24 10:56:43,075 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-24 10:56:43,075 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-24 10:56:43,076 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-24 10:56:43,076 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-24 10:56:43,076 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-24 10:56:43,076 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-24 10:56:43,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-24 10:56:43,076 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-24 10:56:43,076 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-24 10:56:43,077 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-24 10:56:43,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-24 10:56:43,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-24 10:56:43,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-24 10:56:43,438 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-24 10:56:43,438 INFO L275 PluginConnector]: CDTParser initialized [2021-03-24 10:56:43,439 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i [2021-03-24 10:56:43,500 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f05c9355/3b24519e9c3a4cea8e3e5e34c99d76ab/FLAG24eb03260 [2021-03-24 10:56:43,964 INFO L306 CDTParser]: Found 1 translation units. [2021-03-24 10:56:43,964 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i [2021-03-24 10:56:43,975 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f05c9355/3b24519e9c3a4cea8e3e5e34c99d76ab/FLAG24eb03260 [2021-03-24 10:56:44,469 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f05c9355/3b24519e9c3a4cea8e3e5e34c99d76ab [2021-03-24 10:56:44,472 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-24 10:56:44,473 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-24 10:56:44,475 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-24 10:56:44,475 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-24 10:56:44,478 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-24 10:56:44,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.03 10:56:44" (1/1) ... [2021-03-24 10:56:44,479 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@652aef2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:56:44, skipping insertion in model container [2021-03-24 10:56:44,480 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.03 10:56:44" (1/1) ... [2021-03-24 10:56:44,485 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-24 10:56:44,516 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-24 10:56:44,648 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i[948,961] [2021-03-24 10:56:44,824 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-24 10:56:44,830 INFO L203 MainTranslator]: Completed pre-run [2021-03-24 10:56:44,840 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i[948,961] [2021-03-24 10:56:44,874 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-24 10:56:44,929 INFO L208 MainTranslator]: Completed translation [2021-03-24 10:56:44,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:56:44 WrapperNode [2021-03-24 10:56:44,930 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-24 10:56:44,932 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-24 10:56:44,933 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-24 10:56:44,933 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-24 10:56:44,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:56:44" (1/1) ... [2021-03-24 10:56:44,953 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:56:44" (1/1) ... [2021-03-24 10:56:44,985 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-24 10:56:44,987 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-24 10:56:44,987 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-24 10:56:44,987 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-24 10:56:44,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:56:44" (1/1) ... [2021-03-24 10:56:44,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:56:44" (1/1) ... [2021-03-24 10:56:44,997 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:56:44" (1/1) ... [2021-03-24 10:56:44,998 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:56:44" (1/1) ... [2021-03-24 10:56:45,004 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:56:44" (1/1) ... [2021-03-24 10:56:45,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:56:44" (1/1) ... [2021-03-24 10:56:45,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:56:44" (1/1) ... [2021-03-24 10:56:45,014 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-24 10:56:45,015 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-24 10:56:45,015 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-24 10:56:45,015 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-24 10:56:45,016 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:56:44" (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 [2021-03-24 10:56:45,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-24 10:56:45,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-24 10:56:45,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-24 10:56:45,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-24 10:56:45,075 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-24 10:56:45,075 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-24 10:56:45,075 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-24 10:56:45,076 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-24 10:56:45,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-24 10:56:45,076 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-24 10:56:45,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-24 10:56:45,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-24 10:56:45,077 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-24 10:56:46,701 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-24 10:56:46,701 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-24 10:56:46,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.03 10:56:46 BoogieIcfgContainer [2021-03-24 10:56:46,704 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-24 10:56:46,705 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-24 10:56:46,705 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-24 10:56:46,707 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-24 10:56:46,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.03 10:56:44" (1/3) ... [2021-03-24 10:56:46,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a601286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.03 10:56:46, skipping insertion in model container [2021-03-24 10:56:46,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:56:44" (2/3) ... [2021-03-24 10:56:46,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a601286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.03 10:56:46, skipping insertion in model container [2021-03-24 10:56:46,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.03 10:56:46" (3/3) ... [2021-03-24 10:56:46,710 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi000_pso.opt.i [2021-03-24 10:56:46,719 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-24 10:56:46,723 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-24 10:56:46,724 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-24 10:56:46,759 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,760 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,760 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,760 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,760 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,760 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,760 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,761 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,761 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,761 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,761 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,761 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,761 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,761 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,762 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,762 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,762 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,762 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,762 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,762 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,762 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,763 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,763 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,763 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,763 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,763 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,765 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,765 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,765 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,765 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,765 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,766 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,766 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,767 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,768 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,768 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,768 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,768 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,768 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,768 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,768 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,769 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,769 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,769 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,770 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,770 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,770 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,770 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,771 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,771 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,771 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,771 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,773 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,773 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,773 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,773 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,773 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,774 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,774 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,774 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,774 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,774 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,774 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,775 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,776 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,776 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,776 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,777 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,777 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,777 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,778 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,778 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,778 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,778 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:56:46,779 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-24 10:56:46,795 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-24 10:56:46,819 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-24 10:56:46,819 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-24 10:56:46,820 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-24 10:56:46,820 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-24 10:56:46,820 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-24 10:56:46,820 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-24 10:56:46,820 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-24 10:56:46,820 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-24 10:56:46,829 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 88 places, 83 transitions, 176 flow [2021-03-24 10:56:46,857 INFO L129 PetriNetUnfolder]: 2/81 cut-off events. [2021-03-24 10:56:46,857 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 10:56:46,860 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 81 events. 2/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2021-03-24 10:56:46,860 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 83 transitions, 176 flow [2021-03-24 10:56:46,864 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 81 transitions, 168 flow [2021-03-24 10:56:46,865 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-24 10:56:46,872 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 81 transitions, 168 flow [2021-03-24 10:56:46,875 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 81 transitions, 168 flow [2021-03-24 10:56:46,876 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 81 transitions, 168 flow [2021-03-24 10:56:46,893 INFO L129 PetriNetUnfolder]: 2/81 cut-off events. [2021-03-24 10:56:46,893 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 10:56:46,894 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 81 events. 2/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2021-03-24 10:56:46,897 INFO L142 LiptonReduction]: Number of co-enabled transitions 1046 [2021-03-24 10:56:47,927 WARN L205 SmtUtils]: Spent 854.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-03-24 10:56:48,257 WARN L205 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-24 10:56:49,776 WARN L205 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 312 DAG size of output: 267 [2021-03-24 10:56:50,365 WARN L205 SmtUtils]: Spent 585.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2021-03-24 10:56:51,030 WARN L205 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-24 10:56:51,434 WARN L205 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-24 10:56:51,545 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-24 10:56:52,695 WARN L205 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 187 [2021-03-24 10:56:52,984 WARN L205 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-24 10:56:53,523 WARN L205 SmtUtils]: Spent 537.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-24 10:56:54,120 WARN L205 SmtUtils]: Spent 595.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-24 10:56:54,135 INFO L154 LiptonReduction]: Checked pairs total: 1826 [2021-03-24 10:56:54,135 INFO L156 LiptonReduction]: Total number of compositions: 57 [2021-03-24 10:56:54,137 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7273 [2021-03-24 10:56:54,151 INFO L129 PetriNetUnfolder]: 0/16 cut-off events. [2021-03-24 10:56:54,152 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 10:56:54,152 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:56:54,153 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:56:54,153 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:56:54,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:56:54,157 INFO L82 PathProgramCache]: Analyzing trace with hash -481716019, now seen corresponding path program 1 times [2021-03-24 10:56:54,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:56:54,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42779423] [2021-03-24 10:56:54,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:56:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:56:54,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:56:54,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:56:54,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:56:54,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:56:54,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 10:56:54,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42779423] [2021-03-24 10:56:54,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:56:54,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-24 10:56:54,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571045643] [2021-03-24 10:56:54,416 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-24 10:56:54,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:56:54,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-24 10:56:54,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-24 10:56:54,428 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 140 [2021-03-24 10:56:54,430 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:54,430 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:56:54,430 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 140 [2021-03-24 10:56:54,431 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:56:54,490 INFO L129 PetriNetUnfolder]: 23/95 cut-off events. [2021-03-24 10:56:54,490 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 10:56:54,491 INFO L84 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 95 events. 23/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 9 based on Foata normal form. 6/88 useless extension candidates. Maximal degree in co-relation 134. Up to 37 conditions per place. [2021-03-24 10:56:54,492 INFO L132 encePairwiseOnDemand]: 136/140 looper letters, 7 selfloop transitions, 2 changer transitions 5/34 dead transitions. [2021-03-24 10:56:54,492 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 34 transitions, 96 flow [2021-03-24 10:56:54,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-24 10:56:54,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-24 10:56:54,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2021-03-24 10:56:54,503 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8761904761904762 [2021-03-24 10:56:54,504 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2021-03-24 10:56:54,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2021-03-24 10:56:54,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:56:54,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2021-03-24 10:56:54,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:54,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:54,515 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:54,517 INFO L185 Difference]: Start difference. First operand has 39 places, 33 transitions, 72 flow. Second operand 3 states and 368 transitions. [2021-03-24 10:56:54,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 34 transitions, 96 flow [2021-03-24 10:56:54,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 34 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-24 10:56:54,521 INFO L241 Difference]: Finished difference. Result has 37 places, 26 transitions, 60 flow [2021-03-24 10:56:54,523 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2021-03-24 10:56:54,523 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2021-03-24 10:56:54,523 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 60 flow [2021-03-24 10:56:54,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:54,524 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:56:54,524 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:56:54,524 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-24 10:56:54,524 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:56:54,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:56:54,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1314646513, now seen corresponding path program 1 times [2021-03-24 10:56:54,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:56:54,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906424339] [2021-03-24 10:56:54,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:56:54,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:56:54,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:56:54,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:56:54,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:56:54,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:56:54,608 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 10:56:54,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 10:56:54,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 10:56:54,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906424339] [2021-03-24 10:56:54,612 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:56:54,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-24 10:56:54,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011960598] [2021-03-24 10:56:54,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-24 10:56:54,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:56:54,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-24 10:56:54,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-24 10:56:54,615 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 140 [2021-03-24 10:56:54,616 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:54,616 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:56:54,616 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 140 [2021-03-24 10:56:54,616 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:56:54,640 INFO L129 PetriNetUnfolder]: 0/31 cut-off events. [2021-03-24 10:56:54,640 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 10:56:54,640 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 31 events. 0/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 2/32 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-24 10:56:54,641 INFO L132 encePairwiseOnDemand]: 136/140 looper letters, 2 selfloop transitions, 2 changer transitions 3/28 dead transitions. [2021-03-24 10:56:54,641 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 28 transitions, 76 flow [2021-03-24 10:56:54,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-24 10:56:54,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-24 10:56:54,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2021-03-24 10:56:54,644 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8685714285714285 [2021-03-24 10:56:54,644 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 608 transitions. [2021-03-24 10:56:54,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 608 transitions. [2021-03-24 10:56:54,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:56:54,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 608 transitions. [2021-03-24 10:56:54,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:54,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:54,649 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:54,649 INFO L185 Difference]: Start difference. First operand has 37 places, 26 transitions, 60 flow. Second operand 5 states and 608 transitions. [2021-03-24 10:56:54,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 28 transitions, 76 flow [2021-03-24 10:56:54,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 28 transitions, 72 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-24 10:56:54,650 INFO L241 Difference]: Finished difference. Result has 38 places, 25 transitions, 66 flow [2021-03-24 10:56:54,650 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2021-03-24 10:56:54,651 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2021-03-24 10:56:54,651 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 66 flow [2021-03-24 10:56:54,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:54,651 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:56:54,651 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:56:54,651 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-24 10:56:54,652 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:56:54,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:56:54,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1188631962, now seen corresponding path program 1 times [2021-03-24 10:56:54,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:56:54,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912921981] [2021-03-24 10:56:54,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:56:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:56:54,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:56:54,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:56:54,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:56:54,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:56:54,784 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 10:56:54,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 10:56:54,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 10:56:54,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912921981] [2021-03-24 10:56:54,790 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:56:54,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-24 10:56:54,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396571750] [2021-03-24 10:56:54,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-24 10:56:54,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:56:54,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-24 10:56:54,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-24 10:56:54,794 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 140 [2021-03-24 10:56:54,794 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:54,794 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:56:54,795 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 140 [2021-03-24 10:56:54,795 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:56:54,821 INFO L129 PetriNetUnfolder]: 0/29 cut-off events. [2021-03-24 10:56:54,821 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-03-24 10:56:54,822 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 29 events. 0/29 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 2/31 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-24 10:56:54,822 INFO L132 encePairwiseOnDemand]: 136/140 looper letters, 2 selfloop transitions, 2 changer transitions 2/27 dead transitions. [2021-03-24 10:56:54,822 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 27 transitions, 84 flow [2021-03-24 10:56:54,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-24 10:56:54,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-24 10:56:54,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2021-03-24 10:56:54,824 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8685714285714285 [2021-03-24 10:56:54,824 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 608 transitions. [2021-03-24 10:56:54,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 608 transitions. [2021-03-24 10:56:54,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:56:54,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 608 transitions. [2021-03-24 10:56:54,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:54,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:54,828 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:54,829 INFO L185 Difference]: Start difference. First operand has 38 places, 25 transitions, 66 flow. Second operand 5 states and 608 transitions. [2021-03-24 10:56:54,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 27 transitions, 84 flow [2021-03-24 10:56:54,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 27 transitions, 76 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-24 10:56:54,830 INFO L241 Difference]: Finished difference. Result has 38 places, 25 transitions, 70 flow [2021-03-24 10:56:54,830 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=70, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2021-03-24 10:56:54,830 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2021-03-24 10:56:54,831 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 70 flow [2021-03-24 10:56:54,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:54,831 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:56:54,831 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:56:54,831 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-24 10:56:54,831 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:56:54,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:56:54,832 INFO L82 PathProgramCache]: Analyzing trace with hash -340035960, now seen corresponding path program 1 times [2021-03-24 10:56:54,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:56:54,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361096606] [2021-03-24 10:56:54,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:56:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:56:54,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:56:54,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:56:54,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:56:54,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:56:54,919 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 10:56:54,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 10:56:54,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 10:56:54,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361096606] [2021-03-24 10:56:54,923 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:56:54,923 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-24 10:56:54,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302007677] [2021-03-24 10:56:54,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-24 10:56:54,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:56:54,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-24 10:56:54,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-24 10:56:54,926 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 140 [2021-03-24 10:56:54,926 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:54,926 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:56:54,926 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 140 [2021-03-24 10:56:54,926 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:56:54,980 INFO L129 PetriNetUnfolder]: 2/50 cut-off events. [2021-03-24 10:56:54,980 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-03-24 10:56:54,981 INFO L84 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 50 events. 2/50 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 3/52 useless extension candidates. Maximal degree in co-relation 86. Up to 10 conditions per place. [2021-03-24 10:56:54,981 INFO L132 encePairwiseOnDemand]: 136/140 looper letters, 7 selfloop transitions, 2 changer transitions 3/30 dead transitions. [2021-03-24 10:56:54,982 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 30 transitions, 112 flow [2021-03-24 10:56:54,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-24 10:56:54,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-24 10:56:54,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 599 transitions. [2021-03-24 10:56:54,984 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8557142857142858 [2021-03-24 10:56:54,984 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 599 transitions. [2021-03-24 10:56:54,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 599 transitions. [2021-03-24 10:56:54,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:56:54,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 599 transitions. [2021-03-24 10:56:54,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:54,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:54,988 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:54,989 INFO L185 Difference]: Start difference. First operand has 38 places, 25 transitions, 70 flow. Second operand 5 states and 599 transitions. [2021-03-24 10:56:54,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 30 transitions, 112 flow [2021-03-24 10:56:54,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 30 transitions, 95 flow, removed 4 selfloop flow, removed 5 redundant places. [2021-03-24 10:56:54,990 INFO L241 Difference]: Finished difference. Result has 38 places, 25 transitions, 70 flow [2021-03-24 10:56:54,990 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=70, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2021-03-24 10:56:54,990 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2021-03-24 10:56:54,991 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 70 flow [2021-03-24 10:56:54,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:54,991 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:56:54,991 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:56:54,991 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-24 10:56:54,991 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:56:54,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:56:54,992 INFO L82 PathProgramCache]: Analyzing trace with hash -186569484, now seen corresponding path program 1 times [2021-03-24 10:56:54,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:56:54,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584897568] [2021-03-24 10:56:54,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:56:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:56:55,103 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:56:55,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:56:55,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:56:55,105 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 10:56:55,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:56:55,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-24 10:56:55,130 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:56:55,131 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-24 10:56:55,141 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:56:55,141 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-24 10:56:55,151 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 10:56:55,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 10:56:55,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 10:56:55,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584897568] [2021-03-24 10:56:55,158 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:56:55,158 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-24 10:56:55,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895116053] [2021-03-24 10:56:55,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-24 10:56:55,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:56:55,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-24 10:56:55,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-03-24 10:56:55,164 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 140 [2021-03-24 10:56:55,165 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 70 flow. Second operand has 7 states, 7 states have (on average 104.85714285714286) internal successors, (734), 7 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:55,166 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:56:55,166 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 140 [2021-03-24 10:56:55,166 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:56:55,262 INFO L129 PetriNetUnfolder]: 22/83 cut-off events. [2021-03-24 10:56:55,263 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-03-24 10:56:55,263 INFO L84 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 83 events. 22/83 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 237 event pairs, 11 based on Foata normal form. 6/89 useless extension candidates. Maximal degree in co-relation 157. Up to 40 conditions per place. [2021-03-24 10:56:55,264 INFO L132 encePairwiseOnDemand]: 133/140 looper letters, 8 selfloop transitions, 5 changer transitions 6/35 dead transitions. [2021-03-24 10:56:55,264 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 35 transitions, 132 flow [2021-03-24 10:56:55,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-24 10:56:55,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-24 10:56:55,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 749 transitions. [2021-03-24 10:56:55,267 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7642857142857142 [2021-03-24 10:56:55,267 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 749 transitions. [2021-03-24 10:56:55,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 749 transitions. [2021-03-24 10:56:55,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:56:55,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 749 transitions. [2021-03-24 10:56:55,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:55,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 140.0) internal successors, (1120), 8 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:55,272 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 140.0) internal successors, (1120), 8 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:55,272 INFO L185 Difference]: Start difference. First operand has 38 places, 25 transitions, 70 flow. Second operand 7 states and 749 transitions. [2021-03-24 10:56:55,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 35 transitions, 132 flow [2021-03-24 10:56:55,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 35 transitions, 124 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-24 10:56:55,275 INFO L241 Difference]: Finished difference. Result has 41 places, 27 transitions, 93 flow [2021-03-24 10:56:55,275 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=93, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2021-03-24 10:56:55,275 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2021-03-24 10:56:55,275 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 93 flow [2021-03-24 10:56:55,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 104.85714285714286) internal successors, (734), 7 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:55,277 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:56:55,277 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:56:55,277 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-24 10:56:55,277 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:56:55,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:56:55,278 INFO L82 PathProgramCache]: Analyzing trace with hash -725758236, now seen corresponding path program 1 times [2021-03-24 10:56:55,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:56:55,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769631701] [2021-03-24 10:56:55,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:56:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:56:55,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:56:55,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:56:55,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:56:55,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:56:55,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:56:55,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:56:55,350 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 10:56:55,350 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 10:56:55,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 10:56:55,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769631701] [2021-03-24 10:56:55,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:56:55,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-24 10:56:55,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957184657] [2021-03-24 10:56:55,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-24 10:56:55,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:56:55,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-24 10:56:55,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-24 10:56:55,360 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2021-03-24 10:56:55,360 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 114.6) internal successors, (573), 5 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:55,360 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:56:55,361 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2021-03-24 10:56:55,361 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:56:55,410 INFO L129 PetriNetUnfolder]: 9/57 cut-off events. [2021-03-24 10:56:55,411 INFO L130 PetriNetUnfolder]: For 52/53 co-relation queries the response was YES. [2021-03-24 10:56:55,411 INFO L84 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 57 events. 9/57 cut-off events. For 52/53 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 155 event pairs, 3 based on Foata normal form. 4/61 useless extension candidates. Maximal degree in co-relation 130. Up to 22 conditions per place. [2021-03-24 10:56:55,411 INFO L132 encePairwiseOnDemand]: 136/140 looper letters, 8 selfloop transitions, 1 changer transitions 3/31 dead transitions. [2021-03-24 10:56:55,411 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 31 transitions, 133 flow [2021-03-24 10:56:55,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-24 10:56:55,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-24 10:56:55,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 578 transitions. [2021-03-24 10:56:55,413 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8257142857142857 [2021-03-24 10:56:55,414 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 578 transitions. [2021-03-24 10:56:55,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 578 transitions. [2021-03-24 10:56:55,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:56:55,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 578 transitions. [2021-03-24 10:56:55,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:55,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:55,421 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:55,421 INFO L185 Difference]: Start difference. First operand has 41 places, 27 transitions, 93 flow. Second operand 5 states and 578 transitions. [2021-03-24 10:56:55,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 31 transitions, 133 flow [2021-03-24 10:56:55,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 124 flow, removed 1 selfloop flow, removed 4 redundant places. [2021-03-24 10:56:55,425 INFO L241 Difference]: Finished difference. Result has 42 places, 27 transitions, 93 flow [2021-03-24 10:56:55,425 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=93, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2021-03-24 10:56:55,425 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2021-03-24 10:56:55,425 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 27 transitions, 93 flow [2021-03-24 10:56:55,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 114.6) internal successors, (573), 5 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:55,426 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:56:55,426 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:56:55,426 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-24 10:56:55,426 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:56:55,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:56:55,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1374471004, now seen corresponding path program 2 times [2021-03-24 10:56:55,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:56:55,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198969104] [2021-03-24 10:56:55,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:56:55,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:56:55,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:56:55,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:56:55,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:56:55,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:56:55,513 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:56:55,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 10:56:55,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:56:55,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-24 10:56:55,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:56:55,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-24 10:56:55,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:56:55,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-24 10:56:55,560 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 10:56:55,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 10:56:55,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 10:56:55,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198969104] [2021-03-24 10:56:55,565 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:56:55,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-24 10:56:55,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315406532] [2021-03-24 10:56:55,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-24 10:56:55,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:56:55,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-24 10:56:55,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-03-24 10:56:55,567 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 140 [2021-03-24 10:56:55,568 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 27 transitions, 93 flow. Second operand has 8 states, 8 states have (on average 102.0) internal successors, (816), 8 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:55,568 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:56:55,568 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 140 [2021-03-24 10:56:55,568 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:56:55,684 INFO L129 PetriNetUnfolder]: 22/91 cut-off events. [2021-03-24 10:56:55,684 INFO L130 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2021-03-24 10:56:55,686 INFO L84 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 91 events. 22/91 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 296 event pairs, 2 based on Foata normal form. 5/96 useless extension candidates. Maximal degree in co-relation 220. Up to 36 conditions per place. [2021-03-24 10:56:55,687 INFO L132 encePairwiseOnDemand]: 132/140 looper letters, 10 selfloop transitions, 7 changer transitions 5/37 dead transitions. [2021-03-24 10:56:55,687 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 37 transitions, 181 flow [2021-03-24 10:56:55,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-24 10:56:55,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-24 10:56:55,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 830 transitions. [2021-03-24 10:56:55,691 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7410714285714286 [2021-03-24 10:56:55,692 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 830 transitions. [2021-03-24 10:56:55,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 830 transitions. [2021-03-24 10:56:55,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:56:55,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 830 transitions. [2021-03-24 10:56:55,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 103.75) internal successors, (830), 8 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:55,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 140.0) internal successors, (1260), 9 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:55,696 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 140.0) internal successors, (1260), 9 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:55,696 INFO L185 Difference]: Start difference. First operand has 42 places, 27 transitions, 93 flow. Second operand 8 states and 830 transitions. [2021-03-24 10:56:55,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 37 transitions, 181 flow [2021-03-24 10:56:55,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 37 transitions, 172 flow, removed 4 selfloop flow, removed 3 redundant places. [2021-03-24 10:56:55,698 INFO L241 Difference]: Finished difference. Result has 47 places, 29 transitions, 128 flow [2021-03-24 10:56:55,699 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=128, PETRI_PLACES=47, PETRI_TRANSITIONS=29} [2021-03-24 10:56:55,699 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, 8 predicate places. [2021-03-24 10:56:55,699 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 29 transitions, 128 flow [2021-03-24 10:56:55,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 102.0) internal successors, (816), 8 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:55,699 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:56:55,699 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:56:55,700 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-24 10:56:55,700 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:56:55,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:56:55,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1489425535, now seen corresponding path program 1 times [2021-03-24 10:56:55,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:56:55,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578763786] [2021-03-24 10:56:55,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:56:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:56:55,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:56:55,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:56:55,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:56:55,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:56:55,748 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-24 10:56:55,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 10:56:55,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:56:55,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:56:55,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 10:56:55,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578763786] [2021-03-24 10:56:55,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:56:55,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-24 10:56:55,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519674821] [2021-03-24 10:56:55,756 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-24 10:56:55,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:56:55,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-24 10:56:55,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-24 10:56:55,761 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2021-03-24 10:56:55,761 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 29 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:55,761 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:56:55,761 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2021-03-24 10:56:55,761 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:56:55,798 INFO L129 PetriNetUnfolder]: 14/77 cut-off events. [2021-03-24 10:56:55,798 INFO L130 PetriNetUnfolder]: For 89/92 co-relation queries the response was YES. [2021-03-24 10:56:55,798 INFO L84 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 77 events. 14/77 cut-off events. For 89/92 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 240 event pairs, 5 based on Foata normal form. 7/83 useless extension candidates. Maximal degree in co-relation 193. Up to 25 conditions per place. [2021-03-24 10:56:55,799 INFO L132 encePairwiseOnDemand]: 135/140 looper letters, 4 selfloop transitions, 5 changer transitions 3/36 dead transitions. [2021-03-24 10:56:55,799 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 36 transitions, 166 flow [2021-03-24 10:56:55,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-24 10:56:55,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-24 10:56:55,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 579 transitions. [2021-03-24 10:56:55,801 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8271428571428572 [2021-03-24 10:56:55,801 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 579 transitions. [2021-03-24 10:56:55,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 579 transitions. [2021-03-24 10:56:55,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:56:55,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 579 transitions. [2021-03-24 10:56:55,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:55,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:55,805 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:55,805 INFO L185 Difference]: Start difference. First operand has 47 places, 29 transitions, 128 flow. Second operand 5 states and 579 transitions. [2021-03-24 10:56:55,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 36 transitions, 166 flow [2021-03-24 10:56:55,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 36 transitions, 152 flow, removed 2 selfloop flow, removed 5 redundant places. [2021-03-24 10:56:55,808 INFO L241 Difference]: Finished difference. Result has 47 places, 33 transitions, 151 flow [2021-03-24 10:56:55,808 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2021-03-24 10:56:55,808 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, 8 predicate places. [2021-03-24 10:56:55,808 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 151 flow [2021-03-24 10:56:55,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:55,809 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:56:55,809 INFO L263 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] [2021-03-24 10:56:55,809 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-24 10:56:55,809 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:56:55,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:56:55,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1575104507, now seen corresponding path program 1 times [2021-03-24 10:56:55,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:56:55,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366902711] [2021-03-24 10:56:55,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:56:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:56:55,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:56:55,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:56:55,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:56:55,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:56:55,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:56:55,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:56:55,878 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-24 10:56:55,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 10:56:55,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:56:55,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:56:55,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 10:56:55,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366902711] [2021-03-24 10:56:55,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:56:55,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-24 10:56:55,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586364119] [2021-03-24 10:56:55,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-24 10:56:55,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:56:55,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-24 10:56:55,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-24 10:56:55,888 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2021-03-24 10:56:55,889 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:55,889 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:56:55,889 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2021-03-24 10:56:55,889 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:56:55,937 INFO L129 PetriNetUnfolder]: 4/50 cut-off events. [2021-03-24 10:56:55,937 INFO L130 PetriNetUnfolder]: For 57/73 co-relation queries the response was YES. [2021-03-24 10:56:55,937 INFO L84 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 50 events. 4/50 cut-off events. For 57/73 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 102 event pairs, 0 based on Foata normal form. 22/72 useless extension candidates. Maximal degree in co-relation 131. Up to 16 conditions per place. [2021-03-24 10:56:55,937 INFO L132 encePairwiseOnDemand]: 135/140 looper letters, 2 selfloop transitions, 8 changer transitions 2/36 dead transitions. [2021-03-24 10:56:55,937 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 36 transitions, 189 flow [2021-03-24 10:56:55,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-24 10:56:55,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-24 10:56:55,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 805 transitions. [2021-03-24 10:56:55,940 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8214285714285714 [2021-03-24 10:56:55,940 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 805 transitions. [2021-03-24 10:56:55,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 805 transitions. [2021-03-24 10:56:55,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:56:55,941 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 805 transitions. [2021-03-24 10:56:55,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:55,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 140.0) internal successors, (1120), 8 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:55,945 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 140.0) internal successors, (1120), 8 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:55,946 INFO L185 Difference]: Start difference. First operand has 47 places, 33 transitions, 151 flow. Second operand 7 states and 805 transitions. [2021-03-24 10:56:55,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 36 transitions, 189 flow [2021-03-24 10:56:55,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 36 transitions, 163 flow, removed 11 selfloop flow, removed 4 redundant places. [2021-03-24 10:56:55,947 INFO L241 Difference]: Finished difference. Result has 52 places, 34 transitions, 158 flow [2021-03-24 10:56:55,947 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=158, PETRI_PLACES=52, PETRI_TRANSITIONS=34} [2021-03-24 10:56:55,948 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, 13 predicate places. [2021-03-24 10:56:55,948 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 34 transitions, 158 flow [2021-03-24 10:56:55,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:55,948 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:56:55,948 INFO L263 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] [2021-03-24 10:56:55,948 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-24 10:56:55,949 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:56:55,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:56:55,949 INFO L82 PathProgramCache]: Analyzing trace with hash 740185690, now seen corresponding path program 1 times [2021-03-24 10:56:55,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:56:55,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039817868] [2021-03-24 10:56:55,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:56:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:56:56,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:56:56,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:56:56,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:56:56,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:56:56,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:56:56,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:56:56,013 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 10:56:56,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 10:56:56,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 10:56:56,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039817868] [2021-03-24 10:56:56,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:56:56,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-24 10:56:56,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222754480] [2021-03-24 10:56:56,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-24 10:56:56,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:56:56,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-24 10:56:56,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-24 10:56:56,025 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2021-03-24 10:56:56,026 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 34 transitions, 158 flow. Second operand has 5 states, 5 states have (on average 114.6) internal successors, (573), 5 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:56,026 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:56:56,026 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2021-03-24 10:56:56,026 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:56:56,062 INFO L129 PetriNetUnfolder]: 6/73 cut-off events. [2021-03-24 10:56:56,062 INFO L130 PetriNetUnfolder]: For 105/106 co-relation queries the response was YES. [2021-03-24 10:56:56,063 INFO L84 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 73 events. 6/73 cut-off events. For 105/106 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 240 event pairs, 0 based on Foata normal form. 2/75 useless extension candidates. Maximal degree in co-relation 208. Up to 24 conditions per place. [2021-03-24 10:56:56,063 INFO L132 encePairwiseOnDemand]: 136/140 looper letters, 7 selfloop transitions, 1 changer transitions 2/36 dead transitions. [2021-03-24 10:56:56,063 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 36 transitions, 182 flow [2021-03-24 10:56:56,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-24 10:56:56,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-24 10:56:56,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2021-03-24 10:56:56,065 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8228571428571428 [2021-03-24 10:56:56,065 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 576 transitions. [2021-03-24 10:56:56,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 576 transitions. [2021-03-24 10:56:56,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:56:56,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 576 transitions. [2021-03-24 10:56:56,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:56,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:56,069 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:56,069 INFO L185 Difference]: Start difference. First operand has 52 places, 34 transitions, 158 flow. Second operand 5 states and 576 transitions. [2021-03-24 10:56:56,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 36 transitions, 182 flow [2021-03-24 10:56:56,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 36 transitions, 157 flow, removed 6 selfloop flow, removed 6 redundant places. [2021-03-24 10:56:56,073 INFO L241 Difference]: Finished difference. Result has 52 places, 34 transitions, 142 flow [2021-03-24 10:56:56,073 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=52, PETRI_TRANSITIONS=34} [2021-03-24 10:56:56,074 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, 13 predicate places. [2021-03-24 10:56:56,074 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 34 transitions, 142 flow [2021-03-24 10:56:56,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 114.6) internal successors, (573), 5 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:56:56,074 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:56:56,074 INFO L263 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] [2021-03-24 10:56:56,074 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-24 10:56:56,075 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:56:56,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:56:56,075 INFO L82 PathProgramCache]: Analyzing trace with hash 738792516, now seen corresponding path program 2 times [2021-03-24 10:56:56,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:56:56,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222144033] [2021-03-24 10:56:56,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:56:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-24 10:56:56,118 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-24 10:56:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-24 10:56:56,180 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-24 10:56:56,221 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-24 10:56:56,222 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-24 10:56:56,222 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-24 10:56:56,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.03 10:56:56 BasicIcfg [2021-03-24 10:56:56,298 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-24 10:56:56,299 INFO L168 Benchmark]: Toolchain (without parser) took 11825.60 ms. Allocated memory was 408.9 MB in the beginning and 612.4 MB in the end (delta: 203.4 MB). Free memory was 371.7 MB in the beginning and 328.1 MB in the end (delta: 43.6 MB). Peak memory consumption was 247.3 MB. Max. memory is 16.0 GB. [2021-03-24 10:56:56,299 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 408.9 MB. Free memory was 390.1 MB in the beginning and 390.0 MB in the end (delta: 75.0 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-24 10:56:56,299 INFO L168 Benchmark]: CACSL2BoogieTranslator took 456.46 ms. Allocated memory is still 408.9 MB. Free memory was 371.5 MB in the beginning and 369.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. [2021-03-24 10:56:56,299 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.14 ms. Allocated memory is still 408.9 MB. Free memory was 369.0 MB in the beginning and 365.2 MB in the end (delta: 3.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-24 10:56:56,300 INFO L168 Benchmark]: Boogie Preprocessor took 27.30 ms. Allocated memory is still 408.9 MB. Free memory was 365.2 MB in the beginning and 363.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-24 10:56:56,300 INFO L168 Benchmark]: RCFGBuilder took 1689.05 ms. Allocated memory is still 408.9 MB. Free memory was 363.7 MB in the beginning and 341.7 MB in the end (delta: 22.0 MB). Peak memory consumption was 165.7 MB. Max. memory is 16.0 GB. [2021-03-24 10:56:56,300 INFO L168 Benchmark]: TraceAbstraction took 9593.06 ms. Allocated memory was 408.9 MB in the beginning and 612.4 MB in the end (delta: 203.4 MB). Free memory was 340.6 MB in the beginning and 328.1 MB in the end (delta: 12.5 MB). Peak memory consumption was 214.9 MB. Max. memory is 16.0 GB. [2021-03-24 10:56:56,302 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 408.9 MB. Free memory was 390.1 MB in the beginning and 390.0 MB in the end (delta: 75.0 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 456.46 ms. Allocated memory is still 408.9 MB. Free memory was 371.5 MB in the beginning and 369.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 53.14 ms. Allocated memory is still 408.9 MB. Free memory was 369.0 MB in the beginning and 365.2 MB in the end (delta: 3.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 27.30 ms. Allocated memory is still 408.9 MB. Free memory was 365.2 MB in the beginning and 363.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1689.05 ms. Allocated memory is still 408.9 MB. Free memory was 363.7 MB in the beginning and 341.7 MB in the end (delta: 22.0 MB). Peak memory consumption was 165.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 9593.06 ms. Allocated memory was 408.9 MB in the beginning and 612.4 MB in the end (delta: 203.4 MB). Free memory was 340.6 MB in the beginning and 328.1 MB in the end (delta: 12.5 MB). Peak memory consumption was 214.9 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7260.5ms, 86 PlacesBefore, 39 PlacesAfterwards, 81 TransitionsBefore, 33 TransitionsAfterwards, 1046 CoEnabledTransitionPairs, 4 FixpointIterations, 26 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 57 TotalNumberOfCompositions, 1826 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 973, positive: 910, positive conditional: 0, positive unconditional: 910, negative: 63, negative conditional: 0, negative unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 518, positive: 496, positive conditional: 0, positive unconditional: 496, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 518, positive: 496, positive conditional: 0, positive unconditional: 496, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 973, positive: 414, positive conditional: 0, positive unconditional: 414, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 518, unknown conditional: 0, unknown unconditional: 518] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 52, Positive conditional cache size: 0, Positive unconditional cache size: 52, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L733] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L734] 0 _Bool weak$$choice2; [L800] 0 pthread_t t1591; [L801] FCALL, FORK 0 pthread_create(&t1591, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L802] 0 pthread_t t1592; [L803] FCALL, FORK 0 pthread_create(&t1592, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 2 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L763] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L764] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L765] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L766] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 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) [L744] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L744] 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) [L744] 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) [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L745] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L746] 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 [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L747] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L748] 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 [L778] 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) [L778] 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) [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] 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 [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 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 [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L805] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L809] 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) [L809] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L809] 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) [L809] 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) [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L811] 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 [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L812] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L813] 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 [L816] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 0 x$flush_delayed = weak$$choice2 [L819] 0 x$mem_tmp = x [L820] 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) [L820] 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) [L821] 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)) [L821] 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) [L821] 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)) [L821] 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)) [L822] 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)) [L822] 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) [L822] 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)) [L822] 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)) [L823] 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)) [L823] 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) [L823] 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)) [L823] 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)) [L824] 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)) [L824] 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_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L824] 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)) [L824] 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)) [L825] 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)) [L825] EXPR 0 !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) [L825] 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)) [L825] 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)) [L826] 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)) [L826] 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) [L826] 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)) [L826] 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)) [L827] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L828] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L828] 0 x = x$flush_delayed ? x$mem_tmp : x [L829] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 82 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 10.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 9409.1ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 717.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7320.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 48 SDtfs, 33 SDslu, 56 SDs, 0 SdLazy, 179 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 225.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 240.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=9, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 37.5ms SsaConstructionTime, 369.3ms SatisfiabilityAnalysisTime, 665.9ms InterpolantComputationTime, 219 NumberOfCodeBlocks, 219 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 184 ConstructedInterpolants, 0 QuantifiedInterpolants, 663 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...