/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix042_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:26:22,848 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:26:22,852 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:26:22,890 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:26:22,890 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:26:22,902 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:26:22,905 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:26:22,907 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:26:22,910 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:26:22,913 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:26:22,915 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:26:22,917 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:26:22,917 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:26:22,921 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:26:22,923 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:26:22,925 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:26:22,927 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:26:22,929 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:26:22,931 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:26:22,937 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:26:22,939 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:26:22,941 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:26:22,942 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:26:22,943 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:26:22,949 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:26:22,949 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:26:22,950 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:26:22,953 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:26:22,954 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:26:22,955 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:26:22,955 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:26:22,956 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:26:22,956 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:26:22,958 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:26:22,960 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:26:22,960 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:26:22,961 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:26:22,961 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:26:22,961 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:26:22,962 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:26:22,963 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:26:22,964 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-SemanticLbe.epf [2020-10-16 01:26:23,008 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:26:23,009 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:26:23,011 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:26:23,011 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:26:23,011 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:26:23,011 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:26:23,012 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:26:23,012 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:26:23,012 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:26:23,012 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:26:23,013 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:26:23,014 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:26:23,014 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:26:23,014 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:26:23,015 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:26:23,015 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:26:23,015 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:26:23,015 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:26:23,015 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:26:23,016 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:26:23,016 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:26:23,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:26:23,016 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:26:23,016 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:26:23,017 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:26:23,017 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:26:23,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:26:23,017 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:26:23,017 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:26:23,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:26:23,330 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:26:23,334 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:26:23,335 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:26:23,336 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:26:23,337 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_tso.opt.i [2020-10-16 01:26:23,388 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccf7547ee/d8c69d734fb240b38ec7f8b2e47f04e6/FLAG553a53d5f [2020-10-16 01:26:23,964 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:26:23,965 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_tso.opt.i [2020-10-16 01:26:23,981 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccf7547ee/d8c69d734fb240b38ec7f8b2e47f04e6/FLAG553a53d5f [2020-10-16 01:26:24,217 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccf7547ee/d8c69d734fb240b38ec7f8b2e47f04e6 [2020-10-16 01:26:24,225 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:26:24,227 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:26:24,229 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:26:24,229 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:26:24,232 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:26:24,233 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:26:24" (1/1) ... [2020-10-16 01:26:24,236 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1adf83c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:26:24, skipping insertion in model container [2020-10-16 01:26:24,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:26:24" (1/1) ... [2020-10-16 01:26:24,244 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:26:24,313 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:26:24,780 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:26:24,802 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:26:24,892 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:26:24,976 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:26:24,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:26:24 WrapperNode [2020-10-16 01:26:24,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:26:24,978 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:26:24,978 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:26:24,978 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:26:24,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:26:24" (1/1) ... [2020-10-16 01:26:25,009 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:26:24" (1/1) ... [2020-10-16 01:26:25,049 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:26:25,050 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:26:25,050 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:26:25,050 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:26:25,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:26:24" (1/1) ... [2020-10-16 01:26:25,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:26:24" (1/1) ... [2020-10-16 01:26:25,068 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:26:24" (1/1) ... [2020-10-16 01:26:25,069 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:26:24" (1/1) ... [2020-10-16 01:26:25,080 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:26:24" (1/1) ... [2020-10-16 01:26:25,084 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:26:24" (1/1) ... [2020-10-16 01:26:25,087 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:26:24" (1/1) ... [2020-10-16 01:26:25,093 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:26:25,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:26:25,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:26:25,094 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:26:25,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:26:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:26:25,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:26:25,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:26:25,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:26:25,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:26:25,167 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:26:25,167 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:26:25,167 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:26:25,168 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:26:25,168 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 01:26:25,168 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 01:26:25,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:26:25,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:26:25,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:26:25,170 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 01:26:26,988 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:26:26,989 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:26:26,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:26:26 BoogieIcfgContainer [2020-10-16 01:26:26,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:26:26,993 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:26:26,993 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:26:26,996 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:26:26,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:26:24" (1/3) ... [2020-10-16 01:26:26,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@698dffe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:26:26, skipping insertion in model container [2020-10-16 01:26:26,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:26:24" (2/3) ... [2020-10-16 01:26:26,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@698dffe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:26:26, skipping insertion in model container [2020-10-16 01:26:26,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:26:26" (3/3) ... [2020-10-16 01:26:27,000 INFO L111 eAbstractionObserver]: Analyzing ICFG mix042_tso.opt.i [2020-10-16 01:26:27,012 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:26:27,021 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:26:27,023 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:26:27,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,054 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,054 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,055 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,056 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,056 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,056 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,056 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,057 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,057 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,057 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,057 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,058 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,058 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,059 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,059 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,060 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,060 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,062 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,062 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,062 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,063 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,067 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,067 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,067 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,068 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,072 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,072 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,072 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,073 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,073 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,073 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,073 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,073 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,074 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,074 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,076 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,076 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,077 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:27,097 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 01:26:27,120 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:26:27,120 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:26:27,120 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:26:27,121 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:26:27,121 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:26:27,121 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:26:27,121 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:26:27,121 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:26:27,137 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 207 flow [2020-10-16 01:26:27,188 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2020-10-16 01:26:27,188 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:26:27,193 INFO L80 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-10-16 01:26:27,194 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 96 transitions, 207 flow [2020-10-16 01:26:27,204 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 93 transitions, 195 flow [2020-10-16 01:26:27,206 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:26:27,209 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 93 transitions, 195 flow [2020-10-16 01:26:27,211 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 93 transitions, 195 flow [2020-10-16 01:26:27,212 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 101 places, 93 transitions, 195 flow [2020-10-16 01:26:27,236 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2020-10-16 01:26:27,236 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:26:27,237 INFO L80 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-10-16 01:26:27,240 INFO L117 LiptonReduction]: Number of co-enabled transitions 1692 [2020-10-16 01:26:27,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:26:27,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:26:27,677 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:26:27,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:26:27,738 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:26:27,739 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:26:27,741 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:26:27,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:26:27,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:26:27,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:26:27,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:26:27,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:26:28,932 WARN L193 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-16 01:26:28,954 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-16 01:26:28,954 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:26:28,956 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:26:28,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:26:29,905 WARN L193 SmtUtils]: Spent 935.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-10-16 01:26:30,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:26:30,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:26:30,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:26:30,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:26:30,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:26:30,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:26:30,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:26:30,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:26:30,644 WARN L193 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 01:26:30,778 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 01:26:31,013 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:26:31,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:26:31,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:26:31,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:26:31,025 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:26:31,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:26:31,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:26:31,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:26:31,072 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:26:31,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:26:31,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:26:31,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:26:31,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:26:31,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:26:31,088 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:26:31,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:26:31,211 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:26:31,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:26:31,212 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:26:31,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:26:31,218 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:26:31,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:26:31,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:26:31,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:26:31,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:26:31,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:26:31,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:26:31,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:26:31,256 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:26:31,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:26:31,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:26:31,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:26:31,485 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:26:31,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:26:31,486 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:26:31,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:26:31,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:26:31,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:26:31,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:26:31,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:26:31,516 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:26:31,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:26:31,518 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:26:31,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:26:31,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:26:31,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:26:31,523 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:26:31,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:26:32,057 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:26:32,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:26:32,059 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:26:32,060 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:26:32,066 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:26:32,067 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:26:32,070 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:26:32,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:26:32,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:26:32,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:26:32,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:26:32,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:26:32,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:26:32,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:26:32,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:26:32,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:26:33,048 WARN L193 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2020-10-16 01:26:33,199 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-16 01:26:33,206 INFO L132 LiptonReduction]: Checked pairs total: 4575 [2020-10-16 01:26:33,206 INFO L134 LiptonReduction]: Total number of compositions: 79 [2020-10-16 01:26:33,217 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6013 [2020-10-16 01:26:33,233 INFO L129 PetriNetUnfolder]: 0/13 cut-off events. [2020-10-16 01:26:33,234 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:26:33,234 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:26:33,235 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:26:33,235 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:26:33,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:26:33,241 INFO L82 PathProgramCache]: Analyzing trace with hash -964678123, now seen corresponding path program 1 times [2020-10-16 01:26:33,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:26:33,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968381052] [2020-10-16 01:26:33,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:26:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:26:33,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:26:33,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968381052] [2020-10-16 01:26:33,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:26:33,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:26:33,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002963381] [2020-10-16 01:26:33,491 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:26:33,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:26:33,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:26:33,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:26:33,509 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 175 [2020-10-16 01:26:33,511 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states. [2020-10-16 01:26:33,512 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:26:33,512 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 175 [2020-10-16 01:26:33,513 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:26:33,576 INFO L129 PetriNetUnfolder]: 16/69 cut-off events. [2020-10-16 01:26:33,577 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:26:33,577 INFO L80 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 69 events. 16/69 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 239 event pairs, 2 based on Foata normal form. 6/72 useless extension candidates. Maximal degree in co-relation 104. Up to 27 conditions per place. [2020-10-16 01:26:33,579 INFO L132 encePairwiseOnDemand]: 171/175 looper letters, 7 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2020-10-16 01:26:33,579 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 26 transitions, 79 flow [2020-10-16 01:26:33,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:26:33,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:26:33,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions. [2020-10-16 01:26:33,597 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8628571428571429 [2020-10-16 01:26:33,598 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 453 transitions. [2020-10-16 01:26:33,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 453 transitions. [2020-10-16 01:26:33,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:26:33,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 453 transitions. [2020-10-16 01:26:33,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:26:33,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:26:33,616 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:26:33,618 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 453 transitions. [2020-10-16 01:26:33,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 26 transitions, 79 flow [2020-10-16 01:26:33,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 26 transitions, 76 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 01:26:33,623 INFO L241 Difference]: Finished difference. Result has 32 places, 23 transitions, 56 flow [2020-10-16 01:26:33,626 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2020-10-16 01:26:33,627 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2020-10-16 01:26:33,627 INFO L481 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2020-10-16 01:26:33,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:26:33,627 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:26:33,627 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:26:33,628 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:26:33,628 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:26:33,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:26:33,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1097435749, now seen corresponding path program 1 times [2020-10-16 01:26:33,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:26:33,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614344687] [2020-10-16 01:26:33,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:26:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:26:33,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:26:33,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614344687] [2020-10-16 01:26:33,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:26:33,897 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:26:33,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704642480] [2020-10-16 01:26:33,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:26:33,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:26:33,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:26:33,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:26:33,902 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 175 [2020-10-16 01:26:33,902 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand 5 states. [2020-10-16 01:26:33,902 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:26:33,902 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 175 [2020-10-16 01:26:33,903 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:26:34,047 INFO L129 PetriNetUnfolder]: 47/116 cut-off events. [2020-10-16 01:26:34,047 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2020-10-16 01:26:34,048 INFO L80 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 116 events. 47/116 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 472 event pairs, 9 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 216. Up to 51 conditions per place. [2020-10-16 01:26:34,049 INFO L132 encePairwiseOnDemand]: 170/175 looper letters, 8 selfloop transitions, 2 changer transitions 9/33 dead transitions. [2020-10-16 01:26:34,049 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 33 transitions, 116 flow [2020-10-16 01:26:34,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:26:34,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:26:34,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 651 transitions. [2020-10-16 01:26:34,054 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.744 [2020-10-16 01:26:34,054 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 651 transitions. [2020-10-16 01:26:34,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 651 transitions. [2020-10-16 01:26:34,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:26:34,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 651 transitions. [2020-10-16 01:26:34,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:26:34,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:26:34,060 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:26:34,060 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 5 states and 651 transitions. [2020-10-16 01:26:34,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 33 transitions, 116 flow [2020-10-16 01:26:34,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 33 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:26:34,062 INFO L241 Difference]: Finished difference. Result has 37 places, 22 transitions, 62 flow [2020-10-16 01:26:34,062 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=62, PETRI_PLACES=37, PETRI_TRANSITIONS=22} [2020-10-16 01:26:34,063 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2020-10-16 01:26:34,063 INFO L481 AbstractCegarLoop]: Abstraction has has 37 places, 22 transitions, 62 flow [2020-10-16 01:26:34,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:26:34,063 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:26:34,063 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:26:34,063 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:26:34,064 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:26:34,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:26:34,064 INFO L82 PathProgramCache]: Analyzing trace with hash 339258869, now seen corresponding path program 1 times [2020-10-16 01:26:34,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:26:34,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854938299] [2020-10-16 01:26:34,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:26:34,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:26:34,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:26:34,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854938299] [2020-10-16 01:26:34,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:26:34,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:26:34,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846826076] [2020-10-16 01:26:34,140 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:26:34,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:26:34,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:26:34,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:26:34,143 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 175 [2020-10-16 01:26:34,143 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 22 transitions, 62 flow. Second operand 4 states. [2020-10-16 01:26:34,143 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:26:34,143 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 175 [2020-10-16 01:26:34,144 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:26:34,173 INFO L129 PetriNetUnfolder]: 0/27 cut-off events. [2020-10-16 01:26:34,173 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-10-16 01:26:34,173 INFO L80 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 27 events. 0/27 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 36 event pairs, 0 based on Foata normal form. 2/29 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2020-10-16 01:26:34,174 INFO L132 encePairwiseOnDemand]: 171/175 looper letters, 2 selfloop transitions, 2 changer transitions 2/24 dead transitions. [2020-10-16 01:26:34,174 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 24 transitions, 80 flow [2020-10-16 01:26:34,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:26:34,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:26:34,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 753 transitions. [2020-10-16 01:26:34,177 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8605714285714285 [2020-10-16 01:26:34,177 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 753 transitions. [2020-10-16 01:26:34,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 753 transitions. [2020-10-16 01:26:34,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:26:34,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 753 transitions. [2020-10-16 01:26:34,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:26:34,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:26:34,182 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:26:34,182 INFO L185 Difference]: Start difference. First operand has 37 places, 22 transitions, 62 flow. Second operand 5 states and 753 transitions. [2020-10-16 01:26:34,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 24 transitions, 80 flow [2020-10-16 01:26:34,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 24 transitions, 72 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 01:26:34,184 INFO L241 Difference]: Finished difference. Result has 37 places, 22 transitions, 66 flow [2020-10-16 01:26:34,184 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=37, PETRI_TRANSITIONS=22} [2020-10-16 01:26:34,184 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2020-10-16 01:26:34,184 INFO L481 AbstractCegarLoop]: Abstraction has has 37 places, 22 transitions, 66 flow [2020-10-16 01:26:34,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:26:34,185 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:26:34,185 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:26:34,185 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:26:34,185 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:26:34,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:26:34,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1927062368, now seen corresponding path program 1 times [2020-10-16 01:26:34,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:26:34,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686092942] [2020-10-16 01:26:34,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:26:34,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:26:34,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:26:34,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686092942] [2020-10-16 01:26:34,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:26:34,328 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:26:34,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360596559] [2020-10-16 01:26:34,329 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:26:34,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:26:34,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:26:34,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:26:34,333 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 175 [2020-10-16 01:26:34,334 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 22 transitions, 66 flow. Second operand 6 states. [2020-10-16 01:26:34,334 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:26:34,334 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 175 [2020-10-16 01:26:34,334 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:26:34,472 INFO L129 PetriNetUnfolder]: 28/95 cut-off events. [2020-10-16 01:26:34,472 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2020-10-16 01:26:34,473 INFO L80 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 95 events. 28/95 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 342 event pairs, 18 based on Foata normal form. 6/100 useless extension candidates. Maximal degree in co-relation 198. Up to 50 conditions per place. [2020-10-16 01:26:34,474 INFO L132 encePairwiseOnDemand]: 169/175 looper letters, 9 selfloop transitions, 5 changer transitions 6/34 dead transitions. [2020-10-16 01:26:34,474 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 34 transitions, 135 flow [2020-10-16 01:26:34,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:26:34,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:26:34,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 766 transitions. [2020-10-16 01:26:34,478 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7295238095238096 [2020-10-16 01:26:34,478 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 766 transitions. [2020-10-16 01:26:34,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 766 transitions. [2020-10-16 01:26:34,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:26:34,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 766 transitions. [2020-10-16 01:26:34,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:26:34,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:26:34,483 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:26:34,484 INFO L185 Difference]: Start difference. First operand has 37 places, 22 transitions, 66 flow. Second operand 6 states and 766 transitions. [2020-10-16 01:26:34,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 34 transitions, 135 flow [2020-10-16 01:26:34,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 34 transitions, 120 flow, removed 4 selfloop flow, removed 5 redundant places. [2020-10-16 01:26:34,486 INFO L241 Difference]: Finished difference. Result has 39 places, 26 transitions, 92 flow [2020-10-16 01:26:34,486 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=92, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2020-10-16 01:26:34,486 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2020-10-16 01:26:34,487 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 92 flow [2020-10-16 01:26:34,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:26:34,487 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:26:34,487 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:26:34,487 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:26:34,487 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:26:34,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:26:34,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1896370169, now seen corresponding path program 1 times [2020-10-16 01:26:34,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:26:34,488 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641312005] [2020-10-16 01:26:34,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:26:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:26:34,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:26:34,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641312005] [2020-10-16 01:26:34,686 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:26:34,687 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:26:34,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963015413] [2020-10-16 01:26:34,687 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:26:34,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:26:34,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:26:34,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:26:34,689 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 175 [2020-10-16 01:26:34,690 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 92 flow. Second operand 7 states. [2020-10-16 01:26:34,690 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:26:34,690 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 175 [2020-10-16 01:26:34,691 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:26:34,870 INFO L129 PetriNetUnfolder]: 25/91 cut-off events. [2020-10-16 01:26:34,870 INFO L130 PetriNetUnfolder]: For 66/68 co-relation queries the response was YES. [2020-10-16 01:26:34,871 INFO L80 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 91 events. 25/91 cut-off events. For 66/68 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 339 event pairs, 0 based on Foata normal form. 7/96 useless extension candidates. Maximal degree in co-relation 221. Up to 33 conditions per place. [2020-10-16 01:26:34,872 INFO L132 encePairwiseOnDemand]: 168/175 looper letters, 10 selfloop transitions, 9 changer transitions 5/38 dead transitions. [2020-10-16 01:26:34,872 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 38 transitions, 182 flow [2020-10-16 01:26:34,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:26:34,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:26:34,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 913 transitions. [2020-10-16 01:26:34,876 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7453061224489796 [2020-10-16 01:26:34,877 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 913 transitions. [2020-10-16 01:26:34,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 913 transitions. [2020-10-16 01:26:34,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:26:34,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 913 transitions. [2020-10-16 01:26:34,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:26:34,883 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:26:34,883 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:26:34,883 INFO L185 Difference]: Start difference. First operand has 39 places, 26 transitions, 92 flow. Second operand 7 states and 913 transitions. [2020-10-16 01:26:34,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 38 transitions, 182 flow [2020-10-16 01:26:34,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 38 transitions, 180 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-16 01:26:34,886 INFO L241 Difference]: Finished difference. Result has 45 places, 30 transitions, 140 flow [2020-10-16 01:26:34,886 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=140, PETRI_PLACES=45, PETRI_TRANSITIONS=30} [2020-10-16 01:26:34,886 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2020-10-16 01:26:34,887 INFO L481 AbstractCegarLoop]: Abstraction has has 45 places, 30 transitions, 140 flow [2020-10-16 01:26:34,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:26:34,887 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:26:34,887 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:26:34,887 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:26:34,887 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:26:34,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:26:34,888 INFO L82 PathProgramCache]: Analyzing trace with hash 6679119, now seen corresponding path program 1 times [2020-10-16 01:26:34,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:26:34,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387291978] [2020-10-16 01:26:34,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:26:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:26:34,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:26:34,954 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387291978] [2020-10-16 01:26:34,954 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:26:34,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:26:34,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181118310] [2020-10-16 01:26:34,955 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:26:34,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:26:34,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:26:34,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:26:34,957 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 175 [2020-10-16 01:26:34,958 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 30 transitions, 140 flow. Second operand 4 states. [2020-10-16 01:26:34,958 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:26:34,958 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 175 [2020-10-16 01:26:34,959 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:26:35,024 INFO L129 PetriNetUnfolder]: 56/165 cut-off events. [2020-10-16 01:26:35,025 INFO L130 PetriNetUnfolder]: For 139/151 co-relation queries the response was YES. [2020-10-16 01:26:35,026 INFO L80 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 165 events. 56/165 cut-off events. For 139/151 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 844 event pairs, 18 based on Foata normal form. 16/167 useless extension candidates. Maximal degree in co-relation 422. Up to 78 conditions per place. [2020-10-16 01:26:35,028 INFO L132 encePairwiseOnDemand]: 169/175 looper letters, 8 selfloop transitions, 8 changer transitions 0/40 dead transitions. [2020-10-16 01:26:35,028 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 40 transitions, 192 flow [2020-10-16 01:26:35,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:26:35,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:26:35,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 723 transitions. [2020-10-16 01:26:35,032 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8262857142857143 [2020-10-16 01:26:35,032 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 723 transitions. [2020-10-16 01:26:35,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 723 transitions. [2020-10-16 01:26:35,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:26:35,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 723 transitions. [2020-10-16 01:26:35,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:26:35,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:26:35,037 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:26:35,037 INFO L185 Difference]: Start difference. First operand has 45 places, 30 transitions, 140 flow. Second operand 5 states and 723 transitions. [2020-10-16 01:26:35,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 40 transitions, 192 flow [2020-10-16 01:26:35,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 178 flow, removed 7 selfloop flow, removed 2 redundant places. [2020-10-16 01:26:35,041 INFO L241 Difference]: Finished difference. Result has 48 places, 37 transitions, 186 flow [2020-10-16 01:26:35,042 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2020-10-16 01:26:35,042 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2020-10-16 01:26:35,042 INFO L481 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 186 flow [2020-10-16 01:26:35,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:26:35,042 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:26:35,042 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:26:35,043 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:26:35,043 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:26:35,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:26:35,043 INFO L82 PathProgramCache]: Analyzing trace with hash -451538249, now seen corresponding path program 1 times [2020-10-16 01:26:35,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:26:35,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313080844] [2020-10-16 01:26:35,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:26:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:26:35,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:26:35,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313080844] [2020-10-16 01:26:35,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:26:35,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:26:35,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060464366] [2020-10-16 01:26:35,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:26:35,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:26:35,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:26:35,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:26:35,119 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 175 [2020-10-16 01:26:35,120 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 186 flow. Second operand 5 states. [2020-10-16 01:26:35,121 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:26:35,149 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 175 [2020-10-16 01:26:35,150 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:26:35,247 INFO L129 PetriNetUnfolder]: 36/128 cut-off events. [2020-10-16 01:26:35,248 INFO L130 PetriNetUnfolder]: For 168/328 co-relation queries the response was YES. [2020-10-16 01:26:35,249 INFO L80 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 128 events. 36/128 cut-off events. For 168/328 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 581 event pairs, 2 based on Foata normal form. 52/173 useless extension candidates. Maximal degree in co-relation 425. Up to 72 conditions per place. [2020-10-16 01:26:35,250 INFO L132 encePairwiseOnDemand]: 169/175 looper letters, 5 selfloop transitions, 15 changer transitions 3/47 dead transitions. [2020-10-16 01:26:35,250 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 47 transitions, 290 flow [2020-10-16 01:26:35,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:26:35,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:26:35,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1012 transitions. [2020-10-16 01:26:35,254 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8261224489795919 [2020-10-16 01:26:35,254 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1012 transitions. [2020-10-16 01:26:35,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1012 transitions. [2020-10-16 01:26:35,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:26:35,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1012 transitions. [2020-10-16 01:26:35,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:26:35,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:26:35,260 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:26:35,260 INFO L185 Difference]: Start difference. First operand has 48 places, 37 transitions, 186 flow. Second operand 7 states and 1012 transitions. [2020-10-16 01:26:35,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 47 transitions, 290 flow [2020-10-16 01:26:35,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 47 transitions, 286 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:26:35,264 INFO L241 Difference]: Finished difference. Result has 56 places, 44 transitions, 281 flow [2020-10-16 01:26:35,265 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=281, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2020-10-16 01:26:35,265 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 22 predicate places. [2020-10-16 01:26:35,265 INFO L481 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 281 flow [2020-10-16 01:26:35,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:26:35,265 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:26:35,265 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:26:35,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:26:35,266 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:26:35,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:26:35,266 INFO L82 PathProgramCache]: Analyzing trace with hash -996447001, now seen corresponding path program 1 times [2020-10-16 01:26:35,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:26:35,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230772183] [2020-10-16 01:26:35,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:26:35,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:26:35,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:26:35,335 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230772183] [2020-10-16 01:26:35,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:26:35,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:26:35,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10294580] [2020-10-16 01:26:35,336 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:26:35,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:26:35,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:26:35,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:26:35,338 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 175 [2020-10-16 01:26:35,339 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 281 flow. Second operand 6 states. [2020-10-16 01:26:35,339 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:26:35,339 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 175 [2020-10-16 01:26:35,339 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:26:35,434 INFO L129 PetriNetUnfolder]: 26/99 cut-off events. [2020-10-16 01:26:35,434 INFO L130 PetriNetUnfolder]: For 421/693 co-relation queries the response was YES. [2020-10-16 01:26:35,435 INFO L80 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 99 events. 26/99 cut-off events. For 421/693 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 423 event pairs, 0 based on Foata normal form. 70/162 useless extension candidates. Maximal degree in co-relation 439. Up to 63 conditions per place. [2020-10-16 01:26:35,436 INFO L132 encePairwiseOnDemand]: 169/175 looper letters, 2 selfloop transitions, 19 changer transitions 3/48 dead transitions. [2020-10-16 01:26:35,436 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 48 transitions, 359 flow [2020-10-16 01:26:35,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 01:26:35,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 01:26:35,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1295 transitions. [2020-10-16 01:26:35,441 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8222222222222222 [2020-10-16 01:26:35,441 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1295 transitions. [2020-10-16 01:26:35,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1295 transitions. [2020-10-16 01:26:35,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:26:35,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1295 transitions. [2020-10-16 01:26:35,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 01:26:35,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 01:26:35,448 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 01:26:35,448 INFO L185 Difference]: Start difference. First operand has 56 places, 44 transitions, 281 flow. Second operand 9 states and 1295 transitions. [2020-10-16 01:26:35,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 48 transitions, 359 flow [2020-10-16 01:26:35,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 48 transitions, 314 flow, removed 17 selfloop flow, removed 4 redundant places. [2020-10-16 01:26:35,453 INFO L241 Difference]: Finished difference. Result has 63 places, 45 transitions, 297 flow [2020-10-16 01:26:35,453 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=297, PETRI_PLACES=63, PETRI_TRANSITIONS=45} [2020-10-16 01:26:35,454 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 29 predicate places. [2020-10-16 01:26:35,454 INFO L481 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 297 flow [2020-10-16 01:26:35,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:26:35,454 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:26:35,454 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:26:35,454 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:26:35,454 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:26:35,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:26:35,455 INFO L82 PathProgramCache]: Analyzing trace with hash 757147492, now seen corresponding path program 1 times [2020-10-16 01:26:35,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:26:35,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497856281] [2020-10-16 01:26:35,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:26:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:26:35,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:26:35,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497856281] [2020-10-16 01:26:35,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:26:35,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 01:26:35,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366300935] [2020-10-16 01:26:35,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 01:26:35,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:26:35,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 01:26:35,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-16 01:26:35,628 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 175 [2020-10-16 01:26:35,628 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 45 transitions, 297 flow. Second operand 10 states. [2020-10-16 01:26:35,628 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:26:35,628 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 175 [2020-10-16 01:26:35,629 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:26:36,047 INFO L129 PetriNetUnfolder]: 187/529 cut-off events. [2020-10-16 01:26:36,048 INFO L130 PetriNetUnfolder]: For 1765/1796 co-relation queries the response was YES. [2020-10-16 01:26:36,052 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2149 conditions, 529 events. 187/529 cut-off events. For 1765/1796 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3805 event pairs, 18 based on Foata normal form. 22/549 useless extension candidates. Maximal degree in co-relation 2122. Up to 150 conditions per place. [2020-10-16 01:26:36,054 INFO L132 encePairwiseOnDemand]: 167/175 looper letters, 28 selfloop transitions, 19 changer transitions 36/100 dead transitions. [2020-10-16 01:26:36,054 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 100 transitions, 908 flow [2020-10-16 01:26:36,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-16 01:26:36,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-16 01:26:36,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1723 transitions. [2020-10-16 01:26:36,060 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.703265306122449 [2020-10-16 01:26:36,060 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1723 transitions. [2020-10-16 01:26:36,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1723 transitions. [2020-10-16 01:26:36,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:26:36,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1723 transitions. [2020-10-16 01:26:36,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-16 01:26:36,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-16 01:26:36,069 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-16 01:26:36,070 INFO L185 Difference]: Start difference. First operand has 63 places, 45 transitions, 297 flow. Second operand 14 states and 1723 transitions. [2020-10-16 01:26:36,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 100 transitions, 908 flow [2020-10-16 01:26:36,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 100 transitions, 727 flow, removed 44 selfloop flow, removed 8 redundant places. [2020-10-16 01:26:36,088 INFO L241 Difference]: Finished difference. Result has 78 places, 55 transitions, 388 flow [2020-10-16 01:26:36,088 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=388, PETRI_PLACES=78, PETRI_TRANSITIONS=55} [2020-10-16 01:26:36,088 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 44 predicate places. [2020-10-16 01:26:36,088 INFO L481 AbstractCegarLoop]: Abstraction has has 78 places, 55 transitions, 388 flow [2020-10-16 01:26:36,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 01:26:36,089 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:26:36,089 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:26:36,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:26:36,089 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:26:36,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:26:36,090 INFO L82 PathProgramCache]: Analyzing trace with hash 207363822, now seen corresponding path program 2 times [2020-10-16 01:26:36,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:26:36,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536579386] [2020-10-16 01:26:36,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:26:36,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:26:36,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:26:36,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536579386] [2020-10-16 01:26:36,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:26:36,295 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-16 01:26:36,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081865755] [2020-10-16 01:26:36,296 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-16 01:26:36,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:26:36,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-16 01:26:36,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-16 01:26:36,299 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 175 [2020-10-16 01:26:36,300 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 55 transitions, 388 flow. Second operand 11 states. [2020-10-16 01:26:36,300 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:26:36,300 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 175 [2020-10-16 01:26:36,300 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:26:36,696 INFO L129 PetriNetUnfolder]: 216/623 cut-off events. [2020-10-16 01:26:36,699 INFO L130 PetriNetUnfolder]: For 1799/1883 co-relation queries the response was YES. [2020-10-16 01:26:36,704 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2483 conditions, 623 events. 216/623 cut-off events. For 1799/1883 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4611 event pairs, 32 based on Foata normal form. 35/638 useless extension candidates. Maximal degree in co-relation 2453. Up to 268 conditions per place. [2020-10-16 01:26:36,706 INFO L132 encePairwiseOnDemand]: 166/175 looper letters, 33 selfloop transitions, 28 changer transitions 13/94 dead transitions. [2020-10-16 01:26:36,707 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 94 transitions, 846 flow [2020-10-16 01:26:36,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 01:26:36,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 01:26:36,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1174 transitions. [2020-10-16 01:26:36,711 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6708571428571428 [2020-10-16 01:26:36,711 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1174 transitions. [2020-10-16 01:26:36,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1174 transitions. [2020-10-16 01:26:36,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:26:36,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1174 transitions. [2020-10-16 01:26:36,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 01:26:36,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 01:26:36,753 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 01:26:36,753 INFO L185 Difference]: Start difference. First operand has 78 places, 55 transitions, 388 flow. Second operand 10 states and 1174 transitions. [2020-10-16 01:26:36,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 94 transitions, 846 flow [2020-10-16 01:26:36,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 94 transitions, 810 flow, removed 12 selfloop flow, removed 8 redundant places. [2020-10-16 01:26:36,766 INFO L241 Difference]: Finished difference. Result has 79 places, 74 transitions, 652 flow [2020-10-16 01:26:36,767 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=652, PETRI_PLACES=79, PETRI_TRANSITIONS=74} [2020-10-16 01:26:36,768 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 45 predicate places. [2020-10-16 01:26:36,768 INFO L481 AbstractCegarLoop]: Abstraction has has 79 places, 74 transitions, 652 flow [2020-10-16 01:26:36,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-16 01:26:36,768 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:26:36,768 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:26:36,768 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 01:26:36,768 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:26:36,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:26:36,769 INFO L82 PathProgramCache]: Analyzing trace with hash 624078184, now seen corresponding path program 3 times [2020-10-16 01:26:36,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:26:36,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800613123] [2020-10-16 01:26:36,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:26:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:26:36,802 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:26:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:26:36,832 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:26:36,864 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:26:36,865 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:26:36,865 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 01:26:36,882 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:26:36,882 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:36,883 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:26:36,883 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:36,884 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:26:36,884 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:36,884 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:26:36,884 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:36,884 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:26:36,885 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:36,885 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:26:36,885 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:36,885 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:26:36,885 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:36,885 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:26:36,886 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:36,886 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:26:36,886 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:36,886 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:26:36,886 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:36,886 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:26:36,887 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:36,887 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:26:36,887 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:36,888 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:26:36,888 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:36,888 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:26:36,888 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:36,889 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:26:36,889 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:36,889 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:26:36,889 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:36,889 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:26:36,889 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:36,890 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:26:36,890 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:36,890 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:26:36,890 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:36,890 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:26:36,891 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:36,891 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:26:36,891 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:36,891 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:26:36,891 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:36,891 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:26:36,892 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:36,892 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:26:36,892 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:36,892 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:26:36,892 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:36,892 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:26:36,893 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:36,893 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:26:36,893 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:36,893 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:26:36,893 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:36,893 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:26:36,894 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:36,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:26:36 BasicIcfg [2020-10-16 01:26:36,952 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:26:36,954 INFO L168 Benchmark]: Toolchain (without parser) took 12727.10 ms. Allocated memory was 252.2 MB in the beginning and 546.3 MB in the end (delta: 294.1 MB). Free memory was 205.4 MB in the beginning and 468.5 MB in the end (delta: -263.0 MB). Peak memory consumption was 31.1 MB. Max. memory is 14.2 GB. [2020-10-16 01:26:36,955 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 252.2 MB. Free memory was 227.7 MB in the beginning and 226.9 MB in the end (delta: 839.2 kB). Peak memory consumption was 839.2 kB. Max. memory is 14.2 GB. [2020-10-16 01:26:36,956 INFO L168 Benchmark]: CACSL2BoogieTranslator took 748.65 ms. Allocated memory was 252.2 MB in the beginning and 317.7 MB in the end (delta: 65.5 MB). Free memory was 205.4 MB in the beginning and 266.4 MB in the end (delta: -61.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 14.2 GB. [2020-10-16 01:26:36,956 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.93 ms. Allocated memory is still 317.7 MB. Free memory was 266.4 MB in the beginning and 263.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. [2020-10-16 01:26:36,957 INFO L168 Benchmark]: Boogie Preprocessor took 43.19 ms. Allocated memory is still 317.7 MB. Free memory was 263.0 MB in the beginning and 261.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.2 GB. [2020-10-16 01:26:36,958 INFO L168 Benchmark]: RCFGBuilder took 1898.17 ms. Allocated memory was 317.7 MB in the beginning and 359.1 MB in the end (delta: 41.4 MB). Free memory was 261.4 MB in the beginning and 206.7 MB in the end (delta: 54.6 MB). Peak memory consumption was 97.9 MB. Max. memory is 14.2 GB. [2020-10-16 01:26:36,959 INFO L168 Benchmark]: TraceAbstraction took 9959.45 ms. Allocated memory was 359.1 MB in the beginning and 546.3 MB in the end (delta: 187.2 MB). Free memory was 206.7 MB in the beginning and 468.5 MB in the end (delta: -261.8 MB). There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:26:36,963 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 252.2 MB. Free memory was 227.7 MB in the beginning and 226.9 MB in the end (delta: 839.2 kB). Peak memory consumption was 839.2 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 748.65 ms. Allocated memory was 252.2 MB in the beginning and 317.7 MB in the end (delta: 65.5 MB). Free memory was 205.4 MB in the beginning and 266.4 MB in the end (delta: -61.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 71.93 ms. Allocated memory is still 317.7 MB. Free memory was 266.4 MB in the beginning and 263.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 43.19 ms. Allocated memory is still 317.7 MB. Free memory was 263.0 MB in the beginning and 261.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1898.17 ms. Allocated memory was 317.7 MB in the beginning and 359.1 MB in the end (delta: 41.4 MB). Free memory was 261.4 MB in the beginning and 206.7 MB in the end (delta: 54.6 MB). Peak memory consumption was 97.9 MB. Max. memory is 14.2 GB. * TraceAbstraction took 9959.45 ms. Allocated memory was 359.1 MB in the beginning and 546.3 MB in the end (delta: 187.2 MB). Free memory was 206.7 MB in the beginning and 468.5 MB in the end (delta: -261.8 MB). There was no memory consumed. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1107 VarBasedMoverChecksPositive, 62 VarBasedMoverChecksNegative, 22 SemBasedMoverChecksPositive, 40 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 147 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.9s, 101 PlacesBefore, 34 PlacesAfterwards, 93 TransitionsBefore, 25 TransitionsAfterwards, 1692 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 79 TotalNumberOfCompositions, 4575 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p0_EAX = 0; [L702] 0 int __unbuffered_p2_EAX = 0; [L704] 0 int __unbuffered_p2_EBX = 0; [L706] 0 int a = 0; [L707] 0 _Bool main$tmp_guard0; [L708] 0 _Bool main$tmp_guard1; [L710] 0 int x = 0; [L712] 0 int y = 0; [L713] 0 _Bool y$flush_delayed; [L714] 0 int y$mem_tmp; [L715] 0 _Bool y$r_buff0_thd0; [L716] 0 _Bool y$r_buff0_thd1; [L717] 0 _Bool y$r_buff0_thd2; [L718] 0 _Bool y$r_buff0_thd3; [L719] 0 _Bool y$r_buff1_thd0; [L720] 0 _Bool y$r_buff1_thd1; [L721] 0 _Bool y$r_buff1_thd2; [L722] 0 _Bool y$r_buff1_thd3; [L723] 0 _Bool y$read_delayed; [L724] 0 int *y$read_delayed_var; [L725] 0 int y$w_buff0; [L726] 0 _Bool y$w_buff0_used; [L727] 0 int y$w_buff1; [L728] 0 _Bool y$w_buff1_used; [L730] 0 int z = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L814] 0 pthread_t t1126; [L815] FCALL, FORK 0 pthread_create(&t1126, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] 0 pthread_t t1127; [L817] FCALL, FORK 0 pthread_create(&t1127, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] 0 pthread_t t1128; [L819] FCALL, FORK 0 pthread_create(&t1128, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L771] 3 y$w_buff1 = y$w_buff0 [L772] 3 y$w_buff0 = 2 [L773] 3 y$w_buff1_used = y$w_buff0_used [L774] 3 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 3 !expression [L7] 3 __VERIFIER_error() [L776] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L777] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L778] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L779] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L780] 3 y$r_buff0_thd3 = (_Bool)1 [L783] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L786] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L736] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L757] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L760] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L761] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L796] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L796] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L744] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L746] 1 return 0; [L764] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 2 return 0; [L799] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 3 return 0; [L821] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L829] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L829] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L832] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L833] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L834] 0 y$flush_delayed = weak$$choice2 [L835] 0 y$mem_tmp = y [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L837] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L838] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L839] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L839] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L840] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L841] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L842] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L842] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L844] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L844] 0 y = y$flush_delayed ? y$mem_tmp : y [L845] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 95 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 9.7s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 48 SDtfs, 57 SDslu, 65 SDs, 0 SdLazy, 708 SolverSat, 96 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=652occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 167 NumberOfCodeBlocks, 167 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 19337 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...