/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix011_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-24 10:41:01,118 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-24 10:41:01,121 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-24 10:41:01,156 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-24 10:41:01,157 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-24 10:41:01,159 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-24 10:41:01,162 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-24 10:41:01,167 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-24 10:41:01,169 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-24 10:41:01,173 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-24 10:41:01,174 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-24 10:41:01,175 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-24 10:41:01,176 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-24 10:41:01,177 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-24 10:41:01,179 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-24 10:41:01,180 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-24 10:41:01,182 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-24 10:41:01,183 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-24 10:41:01,185 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-24 10:41:01,192 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-24 10:41:01,193 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-24 10:41:01,194 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-24 10:41:01,195 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-24 10:41:01,197 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-24 10:41:01,202 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-24 10:41:01,203 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-24 10:41:01,203 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-24 10:41:01,205 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-24 10:41:01,205 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-24 10:41:01,206 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-24 10:41:01,206 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-24 10:41:01,207 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-24 10:41:01,208 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-24 10:41:01,209 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-24 10:41:01,210 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-24 10:41:01,210 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-24 10:41:01,210 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-24 10:41:01,210 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-24 10:41:01,211 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-24 10:41:01,211 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-24 10:41:01,212 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-24 10:41:01,215 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2021-03-24 10:41:01,248 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-24 10:41:01,249 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-24 10:41:01,251 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-24 10:41:01,252 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-24 10:41:01,252 INFO L138 SettingsManager]: * Use SBE=true [2021-03-24 10:41:01,252 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-24 10:41:01,252 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-24 10:41:01,252 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-24 10:41:01,252 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-24 10:41:01,253 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-24 10:41:01,253 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-24 10:41:01,254 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-24 10:41:01,254 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-24 10:41:01,254 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-24 10:41:01,254 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-24 10:41:01,254 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-24 10:41:01,254 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-24 10:41:01,255 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-24 10:41:01,255 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-24 10:41:01,255 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-24 10:41:01,255 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-24 10:41:01,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-24 10:41:01,255 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-24 10:41:01,256 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-24 10:41:01,256 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-24 10:41:01,256 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-24 10:41:01,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-24 10:41:01,256 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-24 10:41:01,256 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-24 10:41:01,256 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-24 10:41:01,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-24 10:41:01,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-24 10:41:01,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-24 10:41:01,561 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-24 10:41:01,561 INFO L275 PluginConnector]: CDTParser initialized [2021-03-24 10:41:01,562 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_pso.oepc.i [2021-03-24 10:41:01,626 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58c8fb5b5/11d5cefd9d334eb187d9c931520e75c2/FLAG587b5e5b2 [2021-03-24 10:41:02,180 INFO L306 CDTParser]: Found 1 translation units. [2021-03-24 10:41:02,181 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_pso.oepc.i [2021-03-24 10:41:02,199 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58c8fb5b5/11d5cefd9d334eb187d9c931520e75c2/FLAG587b5e5b2 [2021-03-24 10:41:02,460 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58c8fb5b5/11d5cefd9d334eb187d9c931520e75c2 [2021-03-24 10:41:02,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-24 10:41:02,464 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-24 10:41:02,465 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-24 10:41:02,465 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-24 10:41:02,469 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-24 10:41:02,469 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.03 10:41:02" (1/1) ... [2021-03-24 10:41:02,473 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@123da53b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:41:02, skipping insertion in model container [2021-03-24 10:41:02,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.03 10:41:02" (1/1) ... [2021-03-24 10:41:02,481 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-24 10:41:02,519 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-24 10:41:02,676 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_pso.oepc.i[949,962] [2021-03-24 10:41:02,811 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-24 10:41:02,818 INFO L203 MainTranslator]: Completed pre-run [2021-03-24 10:41:02,832 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_pso.oepc.i[949,962] [2021-03-24 10:41:02,883 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-24 10:41:02,944 INFO L208 MainTranslator]: Completed translation [2021-03-24 10:41:02,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:41:02 WrapperNode [2021-03-24 10:41:02,944 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-24 10:41:02,945 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-24 10:41:02,946 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-24 10:41:02,946 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-24 10:41:02,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:41:02" (1/1) ... [2021-03-24 10:41:02,967 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:41:02" (1/1) ... [2021-03-24 10:41:02,988 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-24 10:41:02,989 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-24 10:41:02,989 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-24 10:41:02,989 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-24 10:41:02,997 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:41:02" (1/1) ... [2021-03-24 10:41:02,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:41:02" (1/1) ... [2021-03-24 10:41:03,001 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:41:02" (1/1) ... [2021-03-24 10:41:03,001 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:41:02" (1/1) ... [2021-03-24 10:41:03,009 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:41:02" (1/1) ... [2021-03-24 10:41:03,012 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:41:02" (1/1) ... [2021-03-24 10:41:03,015 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:41:02" (1/1) ... [2021-03-24 10:41:03,019 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-24 10:41:03,020 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-24 10:41:03,020 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-24 10:41:03,020 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-24 10:41:03,021 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:41:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-24 10:41:03,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-24 10:41:03,095 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-24 10:41:03,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-24 10:41:03,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-24 10:41:03,096 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-24 10:41:03,096 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-24 10:41:03,096 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-24 10:41:03,096 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-24 10:41:03,096 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-24 10:41:03,097 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-24 10:41:03,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-24 10:41:03,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-24 10:41:03,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-24 10:41:03,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-24 10:41:03,098 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-24 10:41:05,005 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-24 10:41:05,005 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-24 10:41:05,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.03 10:41:05 BoogieIcfgContainer [2021-03-24 10:41:05,007 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-24 10:41:05,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-24 10:41:05,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-24 10:41:05,011 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-24 10:41:05,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.03 10:41:02" (1/3) ... [2021-03-24 10:41:05,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6077edee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.03 10:41:05, skipping insertion in model container [2021-03-24 10:41:05,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:41:02" (2/3) ... [2021-03-24 10:41:05,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6077edee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.03 10:41:05, skipping insertion in model container [2021-03-24 10:41:05,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.03 10:41:05" (3/3) ... [2021-03-24 10:41:05,013 INFO L111 eAbstractionObserver]: Analyzing ICFG mix011_pso.oepc.i [2021-03-24 10:41:05,018 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-24 10:41:05,025 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-24 10:41:05,026 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-24 10:41:05,065 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,066 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,066 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,066 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,066 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,066 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,066 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,066 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,067 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,067 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,067 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,067 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,067 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,067 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,069 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,069 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,069 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,069 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,069 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,069 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,069 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,070 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,070 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,070 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,070 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,071 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,071 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,072 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,072 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,072 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,072 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,072 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,073 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,073 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,075 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,075 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,075 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,076 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,077 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,077 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,078 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,078 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,078 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,078 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,078 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,078 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,079 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,079 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,079 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,079 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,079 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,079 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,080 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,080 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,080 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,080 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,081 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,081 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,083 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,083 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,083 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,083 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,083 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,083 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,084 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,084 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,084 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,084 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,084 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,084 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,084 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,084 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,099 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,099 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,099 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,099 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,099 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,099 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,099 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,099 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,099 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,099 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,099 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,099 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,099 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,100 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,100 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,100 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,100 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,100 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,100 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,100 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,100 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,100 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,100 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,100 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,100 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,100 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,101 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,101 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,101 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,101 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,110 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,110 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,111 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,112 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,112 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,114 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,115 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,116 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:41:05,119 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-24 10:41:05,135 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-24 10:41:05,165 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-24 10:41:05,165 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-24 10:41:05,166 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-24 10:41:05,166 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-24 10:41:05,166 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-24 10:41:05,166 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-24 10:41:05,166 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-24 10:41:05,167 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-24 10:41:05,182 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 223 flow [2021-03-24 10:41:05,216 INFO L129 PetriNetUnfolder]: 2/101 cut-off events. [2021-03-24 10:41:05,216 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 10:41:05,226 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 101 events. 2/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2021-03-24 10:41:05,227 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 104 transitions, 223 flow [2021-03-24 10:41:05,234 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 101 transitions, 211 flow [2021-03-24 10:41:05,235 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-24 10:41:05,245 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 101 transitions, 211 flow [2021-03-24 10:41:05,247 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 101 transitions, 211 flow [2021-03-24 10:41:05,252 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 109 places, 101 transitions, 211 flow [2021-03-24 10:41:05,277 INFO L129 PetriNetUnfolder]: 2/101 cut-off events. [2021-03-24 10:41:05,277 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 10:41:05,278 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 101 events. 2/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2021-03-24 10:41:05,280 INFO L142 LiptonReduction]: Number of co-enabled transitions 1966 [2021-03-24 10:41:06,268 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-24 10:41:06,627 WARN L205 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-24 10:41:06,763 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-24 10:41:07,577 INFO L154 LiptonReduction]: Checked pairs total: 3623 [2021-03-24 10:41:07,577 INFO L156 LiptonReduction]: Total number of compositions: 69 [2021-03-24 10:41:07,579 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2345 [2021-03-24 10:41:07,585 INFO L129 PetriNetUnfolder]: 0/13 cut-off events. [2021-03-24 10:41:07,585 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 10:41:07,586 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:41:07,586 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:41:07,586 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:41:07,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:41:07,591 INFO L82 PathProgramCache]: Analyzing trace with hash 193613562, now seen corresponding path program 1 times [2021-03-24 10:41:07,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:41:07,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18380870] [2021-03-24 10:41:07,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:41:07,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:41:07,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:41:07,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:41:07,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:41:07,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:41:07,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 10:41:07,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18380870] [2021-03-24 10:41:07,807 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:41:07,807 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-24 10:41:07,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208707368] [2021-03-24 10:41:07,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-24 10:41:07,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:41:07,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-24 10:41:07,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-24 10:41:07,828 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 173 [2021-03-24 10:41:07,832 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:07,833 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:41:07,833 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 173 [2021-03-24 10:41:07,834 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:41:07,932 INFO L129 PetriNetUnfolder]: 49/165 cut-off events. [2021-03-24 10:41:07,932 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 10:41:07,934 INFO L84 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 165 events. 49/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 742 event pairs, 38 based on Foata normal form. 17/173 useless extension candidates. Maximal degree in co-relation 241. Up to 65 conditions per place. [2021-03-24 10:41:07,936 INFO L132 encePairwiseOnDemand]: 169/173 looper letters, 9 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2021-03-24 10:41:07,936 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 43 transitions, 117 flow [2021-03-24 10:41:07,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-24 10:41:07,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-24 10:41:07,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2021-03-24 10:41:07,954 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.905587668593449 [2021-03-24 10:41:07,955 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 470 transitions. [2021-03-24 10:41:07,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 470 transitions. [2021-03-24 10:41:07,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:41:07,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 470 transitions. [2021-03-24 10:41:07,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:07,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:07,972 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:07,975 INFO L185 Difference]: Start difference. First operand has 51 places, 42 transitions, 93 flow. Second operand 3 states and 470 transitions. [2021-03-24 10:41:07,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 43 transitions, 117 flow [2021-03-24 10:41:07,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 43 transitions, 114 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-24 10:41:07,984 INFO L241 Difference]: Finished difference. Result has 48 places, 39 transitions, 88 flow [2021-03-24 10:41:07,986 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2021-03-24 10:41:07,987 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2021-03-24 10:41:07,987 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 88 flow [2021-03-24 10:41:07,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:07,988 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:41:07,988 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:41:07,988 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-24 10:41:07,988 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:41:07,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:41:07,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1828664822, now seen corresponding path program 1 times [2021-03-24 10:41:07,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:41:07,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750449305] [2021-03-24 10:41:07,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:41:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:41:08,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:41:08,118 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:41:08,125 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-24 10:41:08,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-24 10:41:08,135 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 10:41:08,135 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 10:41:08,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 10:41:08,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750449305] [2021-03-24 10:41:08,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:41:08,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-24 10:41:08,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985750606] [2021-03-24 10:41:08,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-24 10:41:08,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:41:08,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-24 10:41:08,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-24 10:41:08,151 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 173 [2021-03-24 10:41:08,152 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:08,152 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:41:08,152 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 173 [2021-03-24 10:41:08,152 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:41:08,342 INFO L129 PetriNetUnfolder]: 251/726 cut-off events. [2021-03-24 10:41:08,342 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 10:41:08,346 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1194 conditions, 726 events. 251/726 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5381 event pairs, 98 based on Foata normal form. 35/712 useless extension candidates. Maximal degree in co-relation 1173. Up to 251 conditions per place. [2021-03-24 10:41:08,349 INFO L132 encePairwiseOnDemand]: 163/173 looper letters, 11 selfloop transitions, 7 changer transitions 18/60 dead transitions. [2021-03-24 10:41:08,349 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 60 transitions, 196 flow [2021-03-24 10:41:08,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-24 10:41:08,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-24 10:41:08,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 715 transitions. [2021-03-24 10:41:08,353 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8265895953757225 [2021-03-24 10:41:08,353 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 715 transitions. [2021-03-24 10:41:08,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 715 transitions. [2021-03-24 10:41:08,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:41:08,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 715 transitions. [2021-03-24 10:41:08,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:08,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:08,360 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:08,360 INFO L185 Difference]: Start difference. First operand has 48 places, 39 transitions, 88 flow. Second operand 5 states and 715 transitions. [2021-03-24 10:41:08,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 60 transitions, 196 flow [2021-03-24 10:41:08,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 60 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-24 10:41:08,362 INFO L241 Difference]: Finished difference. Result has 54 places, 41 transitions, 146 flow [2021-03-24 10:41:08,362 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2021-03-24 10:41:08,362 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2021-03-24 10:41:08,362 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 146 flow [2021-03-24 10:41:08,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:08,363 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:41:08,363 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:41:08,363 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-24 10:41:08,364 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:41:08,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:41:08,365 INFO L82 PathProgramCache]: Analyzing trace with hash 937661469, now seen corresponding path program 1 times [2021-03-24 10:41:08,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:41:08,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338506237] [2021-03-24 10:41:08,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:41:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:41:08,477 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:41:08,478 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:41:08,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:41:08,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:41:08,483 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-24 10:41:08,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-24 10:41:08,495 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 10:41:08,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 10:41:08,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 10:41:08,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338506237] [2021-03-24 10:41:08,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:41:08,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-24 10:41:08,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173974072] [2021-03-24 10:41:08,500 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-24 10:41:08,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:41:08,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-24 10:41:08,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-24 10:41:08,502 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 173 [2021-03-24 10:41:08,503 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 137.2) internal successors, (686), 5 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:08,503 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:41:08,503 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 173 [2021-03-24 10:41:08,503 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:41:08,618 INFO L129 PetriNetUnfolder]: 119/355 cut-off events. [2021-03-24 10:41:08,618 INFO L130 PetriNetUnfolder]: For 226/321 co-relation queries the response was YES. [2021-03-24 10:41:08,619 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1034 conditions, 355 events. 119/355 cut-off events. For 226/321 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1946 event pairs, 16 based on Foata normal form. 27/372 useless extension candidates. Maximal degree in co-relation 1009. Up to 168 conditions per place. [2021-03-24 10:41:08,621 INFO L132 encePairwiseOnDemand]: 163/173 looper letters, 15 selfloop transitions, 9 changer transitions 15/63 dead transitions. [2021-03-24 10:41:08,621 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 63 transitions, 354 flow [2021-03-24 10:41:08,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-24 10:41:08,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-24 10:41:08,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 987 transitions. [2021-03-24 10:41:08,624 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.815028901734104 [2021-03-24 10:41:08,624 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 987 transitions. [2021-03-24 10:41:08,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 987 transitions. [2021-03-24 10:41:08,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:41:08,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 987 transitions. [2021-03-24 10:41:08,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 141.0) internal successors, (987), 7 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:08,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 173.0) internal successors, (1384), 8 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:08,630 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 173.0) internal successors, (1384), 8 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:08,630 INFO L185 Difference]: Start difference. First operand has 54 places, 41 transitions, 146 flow. Second operand 7 states and 987 transitions. [2021-03-24 10:41:08,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 63 transitions, 354 flow [2021-03-24 10:41:08,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 63 transitions, 312 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-24 10:41:08,636 INFO L241 Difference]: Finished difference. Result has 58 places, 45 transitions, 204 flow [2021-03-24 10:41:08,636 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=204, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2021-03-24 10:41:08,636 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2021-03-24 10:41:08,636 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 204 flow [2021-03-24 10:41:08,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 137.2) internal successors, (686), 5 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:08,637 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:41:08,637 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:41:08,637 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-24 10:41:08,637 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:41:08,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:41:08,637 INFO L82 PathProgramCache]: Analyzing trace with hash 705074383, now seen corresponding path program 1 times [2021-03-24 10:41:08,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:41:08,638 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542512619] [2021-03-24 10:41:08,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:41:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:41:08,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:41:08,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:41:08,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:41:08,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:41:08,733 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-24 10:41:08,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-24 10:41:08,744 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 10:41:08,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 10:41:08,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 10:41:08,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542512619] [2021-03-24 10:41:08,748 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:41:08,748 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-24 10:41:08,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937546616] [2021-03-24 10:41:08,748 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-24 10:41:08,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:41:08,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-24 10:41:08,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-24 10:41:08,750 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 173 [2021-03-24 10:41:08,751 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 204 flow. Second operand has 5 states, 5 states have (on average 137.2) internal successors, (686), 5 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:08,751 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:41:08,751 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 173 [2021-03-24 10:41:08,751 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:41:08,877 INFO L129 PetriNetUnfolder]: 96/326 cut-off events. [2021-03-24 10:41:08,877 INFO L130 PetriNetUnfolder]: For 582/643 co-relation queries the response was YES. [2021-03-24 10:41:08,878 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 326 events. 96/326 cut-off events. For 582/643 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1853 event pairs, 38 based on Foata normal form. 28/350 useless extension candidates. Maximal degree in co-relation 1021. Up to 142 conditions per place. [2021-03-24 10:41:08,881 INFO L132 encePairwiseOnDemand]: 163/173 looper letters, 11 selfloop transitions, 16 changer transitions 13/64 dead transitions. [2021-03-24 10:41:08,881 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 64 transitions, 418 flow [2021-03-24 10:41:08,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-24 10:41:08,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-24 10:41:08,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 989 transitions. [2021-03-24 10:41:08,884 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8166804293971924 [2021-03-24 10:41:08,884 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 989 transitions. [2021-03-24 10:41:08,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 989 transitions. [2021-03-24 10:41:08,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:41:08,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 989 transitions. [2021-03-24 10:41:08,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 141.28571428571428) internal successors, (989), 7 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:08,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 173.0) internal successors, (1384), 8 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:08,889 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 173.0) internal successors, (1384), 8 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:08,890 INFO L185 Difference]: Start difference. First operand has 58 places, 45 transitions, 204 flow. Second operand 7 states and 989 transitions. [2021-03-24 10:41:08,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 64 transitions, 418 flow [2021-03-24 10:41:08,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 64 transitions, 400 flow, removed 7 selfloop flow, removed 3 redundant places. [2021-03-24 10:41:08,897 INFO L241 Difference]: Finished difference. Result has 63 places, 49 transitions, 285 flow [2021-03-24 10:41:08,897 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=285, PETRI_PLACES=63, PETRI_TRANSITIONS=49} [2021-03-24 10:41:08,897 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, 12 predicate places. [2021-03-24 10:41:08,897 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 49 transitions, 285 flow [2021-03-24 10:41:08,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 137.2) internal successors, (686), 5 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:08,898 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:41:08,898 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:41:08,898 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-24 10:41:08,898 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:41:08,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:41:08,899 INFO L82 PathProgramCache]: Analyzing trace with hash 897461690, now seen corresponding path program 1 times [2021-03-24 10:41:08,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:41:08,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597777656] [2021-03-24 10:41:08,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:41:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:41:08,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:41:08,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:41:08,968 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:41:08,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:41:08,971 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 10:41:08,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 10:41:08,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 10:41:08,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597777656] [2021-03-24 10:41:08,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:41:08,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-24 10:41:08,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470500327] [2021-03-24 10:41:08,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-24 10:41:08,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:41:08,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-24 10:41:08,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-24 10:41:08,977 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 173 [2021-03-24 10:41:08,978 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 49 transitions, 285 flow. Second operand has 4 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:08,978 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:41:08,978 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 173 [2021-03-24 10:41:08,978 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:41:09,025 INFO L129 PetriNetUnfolder]: 63/234 cut-off events. [2021-03-24 10:41:09,025 INFO L130 PetriNetUnfolder]: For 530/556 co-relation queries the response was YES. [2021-03-24 10:41:09,026 INFO L84 FinitePrefix]: Finished finitePrefix Result has 760 conditions, 234 events. 63/234 cut-off events. For 530/556 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1190 event pairs, 31 based on Foata normal form. 16/246 useless extension candidates. Maximal degree in co-relation 732. Up to 108 conditions per place. [2021-03-24 10:41:09,028 INFO L132 encePairwiseOnDemand]: 169/173 looper letters, 2 selfloop transitions, 4 changer transitions 3/52 dead transitions. [2021-03-24 10:41:09,028 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 52 transitions, 328 flow [2021-03-24 10:41:09,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-24 10:41:09,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-24 10:41:09,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 768 transitions. [2021-03-24 10:41:09,030 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8878612716763006 [2021-03-24 10:41:09,030 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 768 transitions. [2021-03-24 10:41:09,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 768 transitions. [2021-03-24 10:41:09,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:41:09,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 768 transitions. [2021-03-24 10:41:09,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 153.6) internal successors, (768), 5 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:09,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:09,034 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:09,034 INFO L185 Difference]: Start difference. First operand has 63 places, 49 transitions, 285 flow. Second operand 5 states and 768 transitions. [2021-03-24 10:41:09,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 52 transitions, 328 flow [2021-03-24 10:41:09,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 52 transitions, 312 flow, removed 8 selfloop flow, removed 5 redundant places. [2021-03-24 10:41:09,041 INFO L241 Difference]: Finished difference. Result has 62 places, 49 transitions, 287 flow [2021-03-24 10:41:09,041 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=287, PETRI_PLACES=62, PETRI_TRANSITIONS=49} [2021-03-24 10:41:09,041 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2021-03-24 10:41:09,041 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 49 transitions, 287 flow [2021-03-24 10:41:09,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:09,042 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:41:09,042 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:41:09,042 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-24 10:41:09,042 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:41:09,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:41:09,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1368308922, now seen corresponding path program 1 times [2021-03-24 10:41:09,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:41:09,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879743062] [2021-03-24 10:41:09,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:41:09,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:41:09,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:41:09,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:41:09,103 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:41:09,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:41:09,108 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-24 10:41:09,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 10:41:09,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:41:09,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:41:09,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 10:41:09,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879743062] [2021-03-24 10:41:09,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:41:09,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-24 10:41:09,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682912983] [2021-03-24 10:41:09,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-24 10:41:09,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:41:09,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-24 10:41:09,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-24 10:41:09,119 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 173 [2021-03-24 10:41:09,120 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 49 transitions, 287 flow. Second operand has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:09,120 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:41:09,120 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 173 [2021-03-24 10:41:09,120 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:41:09,210 INFO L129 PetriNetUnfolder]: 223/557 cut-off events. [2021-03-24 10:41:09,210 INFO L130 PetriNetUnfolder]: For 367/391 co-relation queries the response was YES. [2021-03-24 10:41:09,213 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 557 events. 223/557 cut-off events. For 367/391 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 3740 event pairs, 91 based on Foata normal form. 43/508 useless extension candidates. Maximal degree in co-relation 1350. Up to 327 conditions per place. [2021-03-24 10:41:09,216 INFO L132 encePairwiseOnDemand]: 167/173 looper letters, 10 selfloop transitions, 8 changer transitions 0/60 dead transitions. [2021-03-24 10:41:09,216 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 60 transitions, 345 flow [2021-03-24 10:41:09,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-24 10:41:09,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-24 10:41:09,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 745 transitions. [2021-03-24 10:41:09,219 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.861271676300578 [2021-03-24 10:41:09,219 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 745 transitions. [2021-03-24 10:41:09,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 745 transitions. [2021-03-24 10:41:09,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:41:09,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 745 transitions. [2021-03-24 10:41:09,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 149.0) internal successors, (745), 5 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:09,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:09,223 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:09,223 INFO L185 Difference]: Start difference. First operand has 62 places, 49 transitions, 287 flow. Second operand 5 states and 745 transitions. [2021-03-24 10:41:09,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 60 transitions, 345 flow [2021-03-24 10:41:09,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 60 transitions, 331 flow, removed 3 selfloop flow, removed 4 redundant places. [2021-03-24 10:41:09,230 INFO L241 Difference]: Finished difference. Result has 63 places, 56 transitions, 333 flow [2021-03-24 10:41:09,230 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=333, PETRI_PLACES=63, PETRI_TRANSITIONS=56} [2021-03-24 10:41:09,230 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, 12 predicate places. [2021-03-24 10:41:09,230 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 333 flow [2021-03-24 10:41:09,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:09,231 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:41:09,231 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:41:09,231 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-24 10:41:09,231 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:41:09,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:41:09,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1439024423, now seen corresponding path program 1 times [2021-03-24 10:41:09,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:41:09,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305211504] [2021-03-24 10:41:09,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:41:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:41:09,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:41:09,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:41:09,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:41:09,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:41:09,288 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:41:09,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:41:09,292 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 10:41:09,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 10:41:09,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 10:41:09,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305211504] [2021-03-24 10:41:09,297 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:41:09,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-24 10:41:09,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609454920] [2021-03-24 10:41:09,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-24 10:41:09,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:41:09,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-24 10:41:09,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-24 10:41:09,299 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 173 [2021-03-24 10:41:09,300 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 56 transitions, 333 flow. Second operand has 5 states, 5 states have (on average 149.4) internal successors, (747), 5 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:09,300 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:41:09,300 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 173 [2021-03-24 10:41:09,300 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:41:09,414 INFO L129 PetriNetUnfolder]: 249/694 cut-off events. [2021-03-24 10:41:09,414 INFO L130 PetriNetUnfolder]: For 812/985 co-relation queries the response was YES. [2021-03-24 10:41:09,417 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2151 conditions, 694 events. 249/694 cut-off events. For 812/985 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 5189 event pairs, 102 based on Foata normal form. 31/670 useless extension candidates. Maximal degree in co-relation 2112. Up to 364 conditions per place. [2021-03-24 10:41:09,420 INFO L132 encePairwiseOnDemand]: 169/173 looper letters, 10 selfloop transitions, 3 changer transitions 4/62 dead transitions. [2021-03-24 10:41:09,420 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 62 transitions, 413 flow [2021-03-24 10:41:09,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-24 10:41:09,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-24 10:41:09,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 752 transitions. [2021-03-24 10:41:09,422 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.869364161849711 [2021-03-24 10:41:09,423 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 752 transitions. [2021-03-24 10:41:09,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 752 transitions. [2021-03-24 10:41:09,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:41:09,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 752 transitions. [2021-03-24 10:41:09,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 150.4) internal successors, (752), 5 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:09,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:09,427 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:09,427 INFO L185 Difference]: Start difference. First operand has 63 places, 56 transitions, 333 flow. Second operand 5 states and 752 transitions. [2021-03-24 10:41:09,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 62 transitions, 413 flow [2021-03-24 10:41:09,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 62 transitions, 409 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-24 10:41:09,432 INFO L241 Difference]: Finished difference. Result has 69 places, 57 transitions, 354 flow [2021-03-24 10:41:09,432 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=354, PETRI_PLACES=69, PETRI_TRANSITIONS=57} [2021-03-24 10:41:09,433 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, 18 predicate places. [2021-03-24 10:41:09,433 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 57 transitions, 354 flow [2021-03-24 10:41:09,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 149.4) internal successors, (747), 5 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:09,433 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:41:09,433 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:41:09,433 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-24 10:41:09,433 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:41:09,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:41:09,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1929510695, now seen corresponding path program 2 times [2021-03-24 10:41:09,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:41:09,434 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883378069] [2021-03-24 10:41:09,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:41:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:41:09,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:41:09,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:41:09,500 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:41:09,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:41:09,502 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:41:09,503 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:41:09,506 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-24 10:41:09,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 10:41:09,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:41:09,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:41:09,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 10:41:09,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883378069] [2021-03-24 10:41:09,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:41:09,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-24 10:41:09,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815136904] [2021-03-24 10:41:09,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-24 10:41:09,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:41:09,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-24 10:41:09,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-24 10:41:09,518 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 173 [2021-03-24 10:41:09,519 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 57 transitions, 354 flow. Second operand has 5 states, 5 states have (on average 145.8) internal successors, (729), 5 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:09,519 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:41:09,519 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 173 [2021-03-24 10:41:09,519 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:41:09,634 INFO L129 PetriNetUnfolder]: 239/643 cut-off events. [2021-03-24 10:41:09,634 INFO L130 PetriNetUnfolder]: For 1001/1774 co-relation queries the response was YES. [2021-03-24 10:41:09,637 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2270 conditions, 643 events. 239/643 cut-off events. For 1001/1774 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 4604 event pairs, 20 based on Foata normal form. 243/823 useless extension candidates. Maximal degree in co-relation 2229. Up to 381 conditions per place. [2021-03-24 10:41:09,640 INFO L132 encePairwiseOnDemand]: 167/173 looper letters, 8 selfloop transitions, 15 changer transitions 3/69 dead transitions. [2021-03-24 10:41:09,640 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 69 transitions, 468 flow [2021-03-24 10:41:09,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-24 10:41:09,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-24 10:41:09,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1043 transitions. [2021-03-24 10:41:09,643 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.861271676300578 [2021-03-24 10:41:09,643 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1043 transitions. [2021-03-24 10:41:09,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1043 transitions. [2021-03-24 10:41:09,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:41:09,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1043 transitions. [2021-03-24 10:41:09,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 149.0) internal successors, (1043), 7 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:09,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 173.0) internal successors, (1384), 8 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:09,649 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 173.0) internal successors, (1384), 8 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:09,650 INFO L185 Difference]: Start difference. First operand has 69 places, 57 transitions, 354 flow. Second operand 7 states and 1043 transitions. [2021-03-24 10:41:09,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 69 transitions, 468 flow [2021-03-24 10:41:09,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 69 transitions, 465 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-24 10:41:09,655 INFO L241 Difference]: Finished difference. Result has 75 places, 64 transitions, 450 flow [2021-03-24 10:41:09,655 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=450, PETRI_PLACES=75, PETRI_TRANSITIONS=64} [2021-03-24 10:41:09,655 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, 24 predicate places. [2021-03-24 10:41:09,655 INFO L480 AbstractCegarLoop]: Abstraction has has 75 places, 64 transitions, 450 flow [2021-03-24 10:41:09,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 145.8) internal successors, (729), 5 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:09,655 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:41:09,656 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:41:09,656 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-24 10:41:09,656 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:41:09,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:41:09,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1863447821, now seen corresponding path program 1 times [2021-03-24 10:41:09,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:41:09,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295913758] [2021-03-24 10:41:09,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:41:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:41:09,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:41:09,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:41:09,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:41:09,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:41:09,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:41:09,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:41:09,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:41:09,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:41:09,830 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-24 10:41:09,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 10:41:09,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:41:09,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:41:09,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 10:41:09,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295913758] [2021-03-24 10:41:09,838 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:41:09,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-24 10:41:09,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360261489] [2021-03-24 10:41:09,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-24 10:41:09,839 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:41:09,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-24 10:41:09,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-24 10:41:09,840 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 173 [2021-03-24 10:41:09,841 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 64 transitions, 450 flow. Second operand has 6 states, 6 states have (on average 145.83333333333334) internal successors, (875), 6 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:09,841 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:41:09,841 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 173 [2021-03-24 10:41:09,841 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:41:09,972 INFO L129 PetriNetUnfolder]: 203/560 cut-off events. [2021-03-24 10:41:09,973 INFO L130 PetriNetUnfolder]: For 2070/3123 co-relation queries the response was YES. [2021-03-24 10:41:09,976 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2544 conditions, 560 events. 203/560 cut-off events. For 2070/3123 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 3967 event pairs, 8 based on Foata normal form. 242/740 useless extension candidates. Maximal degree in co-relation 2500. Up to 342 conditions per place. [2021-03-24 10:41:09,977 INFO L132 encePairwiseOnDemand]: 167/173 looper letters, 5 selfloop transitions, 17 changer transitions 14/71 dead transitions. [2021-03-24 10:41:09,978 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 71 transitions, 542 flow [2021-03-24 10:41:09,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-24 10:41:09,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-24 10:41:09,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1335 transitions. [2021-03-24 10:41:09,981 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8574181117533719 [2021-03-24 10:41:09,981 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1335 transitions. [2021-03-24 10:41:09,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1335 transitions. [2021-03-24 10:41:09,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:41:09,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1335 transitions. [2021-03-24 10:41:09,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 148.33333333333334) internal successors, (1335), 9 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:09,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 173.0) internal successors, (1730), 10 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:09,989 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 173.0) internal successors, (1730), 10 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:09,989 INFO L185 Difference]: Start difference. First operand has 75 places, 64 transitions, 450 flow. Second operand 9 states and 1335 transitions. [2021-03-24 10:41:09,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 71 transitions, 542 flow [2021-03-24 10:41:10,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 71 transitions, 493 flow, removed 16 selfloop flow, removed 4 redundant places. [2021-03-24 10:41:10,003 INFO L241 Difference]: Finished difference. Result has 82 places, 55 transitions, 359 flow [2021-03-24 10:41:10,004 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=359, PETRI_PLACES=82, PETRI_TRANSITIONS=55} [2021-03-24 10:41:10,004 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, 31 predicate places. [2021-03-24 10:41:10,004 INFO L480 AbstractCegarLoop]: Abstraction has has 82 places, 55 transitions, 359 flow [2021-03-24 10:41:10,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 145.83333333333334) internal successors, (875), 6 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:41:10,005 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:41:10,005 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:41:10,005 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-24 10:41:10,005 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:41:10,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:41:10,005 INFO L82 PathProgramCache]: Analyzing trace with hash -595976389, now seen corresponding path program 1 times [2021-03-24 10:41:10,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:41:10,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797758273] [2021-03-24 10:41:10,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:41:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-24 10:41:10,066 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-24 10:41:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-24 10:41:10,143 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-24 10:41:10,187 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-24 10:41:10,187 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-24 10:41:10,187 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-24 10:41:10,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.03 10:41:10 BasicIcfg [2021-03-24 10:41:10,303 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-24 10:41:10,303 INFO L168 Benchmark]: Toolchain (without parser) took 7839.72 ms. Allocated memory was 339.7 MB in the beginning and 457.2 MB in the end (delta: 117.4 MB). Free memory was 302.9 MB in the beginning and 326.0 MB in the end (delta: -23.2 MB). Peak memory consumption was 97.3 MB. Max. memory is 16.0 GB. [2021-03-24 10:41:10,304 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 339.7 MB. Free memory was 321.3 MB in the beginning and 321.2 MB in the end (delta: 75.8 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-24 10:41:10,306 INFO L168 Benchmark]: CACSL2BoogieTranslator took 479.77 ms. Allocated memory is still 339.7 MB. Free memory was 302.7 MB in the beginning and 298.7 MB in the end (delta: 4.0 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. [2021-03-24 10:41:10,307 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.04 ms. Allocated memory is still 339.7 MB. Free memory was 298.7 MB in the beginning and 296.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-24 10:41:10,308 INFO L168 Benchmark]: Boogie Preprocessor took 30.33 ms. Allocated memory is still 339.7 MB. Free memory was 296.6 MB in the beginning and 293.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-24 10:41:10,308 INFO L168 Benchmark]: RCFGBuilder took 1986.89 ms. Allocated memory is still 339.7 MB. Free memory was 293.4 MB in the beginning and 236.2 MB in the end (delta: 57.2 MB). Peak memory consumption was 148.1 MB. Max. memory is 16.0 GB. [2021-03-24 10:41:10,308 INFO L168 Benchmark]: TraceAbstraction took 5294.45 ms. Allocated memory was 339.7 MB in the beginning and 457.2 MB in the end (delta: 117.4 MB). Free memory was 235.6 MB in the beginning and 326.0 MB in the end (delta: -90.5 MB). Peak memory consumption was 28.0 MB. Max. memory is 16.0 GB. [2021-03-24 10:41:10,314 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 339.7 MB. Free memory was 321.3 MB in the beginning and 321.2 MB in the end (delta: 75.8 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 479.77 ms. Allocated memory is still 339.7 MB. Free memory was 302.7 MB in the beginning and 298.7 MB in the end (delta: 4.0 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 43.04 ms. Allocated memory is still 339.7 MB. Free memory was 298.7 MB in the beginning and 296.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 30.33 ms. Allocated memory is still 339.7 MB. Free memory was 296.6 MB in the beginning and 293.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1986.89 ms. Allocated memory is still 339.7 MB. Free memory was 293.4 MB in the beginning and 236.2 MB in the end (delta: 57.2 MB). Peak memory consumption was 148.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 5294.45 ms. Allocated memory was 339.7 MB in the beginning and 457.2 MB in the end (delta: 117.4 MB). Free memory was 235.6 MB in the beginning and 326.0 MB in the end (delta: -90.5 MB). Peak memory consumption was 28.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2329.7ms, 109 PlacesBefore, 51 PlacesAfterwards, 101 TransitionsBefore, 42 TransitionsAfterwards, 1966 CoEnabledTransitionPairs, 5 FixpointIterations, 29 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 69 TotalNumberOfCompositions, 3623 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1655, positive: 1559, positive conditional: 0, positive unconditional: 1559, negative: 96, negative conditional: 0, negative unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 964, positive: 934, positive conditional: 0, positive unconditional: 934, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 964, positive: 934, positive conditional: 0, positive unconditional: 934, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1655, positive: 625, positive conditional: 0, positive unconditional: 625, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 964, unknown conditional: 0, unknown unconditional: 964] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 92, Positive conditional cache size: 0, Positive unconditional cache size: 92, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool a$flush_delayed; [L721] 0 int a$mem_tmp; [L722] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L723] 0 _Bool a$r_buff0_thd1; [L724] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0] [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$read_delayed; [L731] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L732] 0 int a$w_buff0; [L733] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L734] 0 int a$w_buff1; [L735] 0 _Bool a$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t287; [L849] FCALL, FORK 0 pthread_create(&t287, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L850] 0 pthread_t t288; [L851] FCALL, FORK 0 pthread_create(&t288, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L781] 2 y = 1 [L784] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L787] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L852] 0 pthread_t t289; [L853] FCALL, FORK 0 pthread_create(&t289, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L804] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 a$flush_delayed = weak$$choice2 [L813] 3 a$mem_tmp = a [L814] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L814] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L815] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L815] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0) [L815] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L815] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L816] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L816] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1) [L816] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L816] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L817] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L817] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used) [L817] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L817] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L818] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L818] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L819] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3) [L819] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L819] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L820] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L820] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EBX = a [L822] EXPR 3 a$flush_delayed ? a$mem_tmp : a [L822] 3 a = a$flush_delayed ? a$mem_tmp : a [L823] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L764] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L790] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L826] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L826] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L826] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L826] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L827] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L827] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L828] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L828] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L829] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L829] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L830] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L830] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L859] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L859] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L859] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L859] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L860] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L860] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L861] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L861] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L862] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L862] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L863] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L863] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L866] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 103 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 5027.3ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1274.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2413.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 89 SDtfs, 66 SDslu, 93 SDs, 0 SdLazy, 195 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 215.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 212.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=450occurred in iteration=8, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 39.7ms SsaConstructionTime, 332.2ms SatisfiabilityAnalysisTime, 642.8ms InterpolantComputationTime, 241 NumberOfCodeBlocks, 241 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 803 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...