/usr/bin/java -Xmx8000000000 -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-NoLbe-OGIterative-CovSimpl-Hitting.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix027_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f [2021-08-13 15:12:20,871 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-13 15:12:20,872 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-13 15:12:20,896 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-13 15:12:20,896 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-13 15:12:20,899 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-13 15:12:20,902 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-13 15:12:20,906 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-13 15:12:20,908 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-13 15:12:20,911 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-13 15:12:20,911 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-13 15:12:20,912 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-13 15:12:20,913 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-13 15:12:20,914 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-13 15:12:20,915 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-13 15:12:20,916 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-13 15:12:20,916 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-13 15:12:20,917 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-13 15:12:20,921 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-13 15:12:20,927 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-13 15:12:20,928 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-13 15:12:20,929 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-13 15:12:20,930 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-13 15:12:20,930 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-13 15:12:20,939 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-13 15:12:20,939 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-13 15:12:20,939 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-13 15:12:20,939 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-13 15:12:20,940 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-13 15:12:20,940 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-13 15:12:20,942 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-13 15:12:20,943 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-13 15:12:20,944 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-13 15:12:20,944 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-13 15:12:20,945 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-13 15:12:20,945 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-13 15:12:20,945 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-13 15:12:20,945 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-13 15:12:20,946 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-13 15:12:20,946 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-13 15:12:20,946 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-13 15:12:20,948 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-NoLbe-OGIterative-CovSimpl-Hitting.epf [2021-08-13 15:12:20,970 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-13 15:12:20,970 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-13 15:12:20,971 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-13 15:12:20,971 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-13 15:12:20,971 INFO L138 SettingsManager]: * Use SBE=true [2021-08-13 15:12:20,971 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-13 15:12:20,971 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-13 15:12:20,971 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-13 15:12:20,971 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-13 15:12:20,971 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-13 15:12:20,971 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-13 15:12:20,971 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-13 15:12:20,972 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-13 15:12:20,972 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-13 15:12:20,972 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-13 15:12:20,972 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-13 15:12:20,972 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-13 15:12:20,972 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-13 15:12:20,972 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-13 15:12:20,972 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-13 15:12:20,972 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-13 15:12:20,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-13 15:12:20,972 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-13 15:12:20,973 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-13 15:12:20,973 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-13 15:12:20,973 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-13 15:12:20,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-13 15:12:20,973 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-13 15:12:20,973 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-08-13 15:12:20,973 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-13 15:12:20,973 INFO L138 SettingsManager]: * Compute cosets for OwickiGries annotation iteratively=true [2021-08-13 15:12:20,973 INFO L138 SettingsManager]: * Use hitting sets in computation of OwickiGries annotation=true [2021-08-13 15:12:20,973 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-13 15:12:20,973 INFO L138 SettingsManager]: * Simplify away covered predicates in OwickiGries annotation=true 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-08-13 15:12:21,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-13 15:12:21,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-13 15:12:21,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-13 15:12:21,230 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-13 15:12:21,231 INFO L275 PluginConnector]: CDTParser initialized [2021-08-13 15:12:21,232 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_tso.oepc.i [2021-08-13 15:12:21,293 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89bbeb04f/5f39faf7c19a4dc5858161b88422c739/FLAG182e96cba [2021-08-13 15:12:21,751 INFO L306 CDTParser]: Found 1 translation units. [2021-08-13 15:12:21,752 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_tso.oepc.i [2021-08-13 15:12:21,761 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89bbeb04f/5f39faf7c19a4dc5858161b88422c739/FLAG182e96cba [2021-08-13 15:12:21,772 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89bbeb04f/5f39faf7c19a4dc5858161b88422c739 [2021-08-13 15:12:21,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-13 15:12:21,775 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-13 15:12:21,779 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-13 15:12:21,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-13 15:12:21,784 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-13 15:12:21,785 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 03:12:21" (1/1) ... [2021-08-13 15:12:21,786 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c0c5fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:12:21, skipping insertion in model container [2021-08-13 15:12:21,786 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 03:12:21" (1/1) ... [2021-08-13 15:12:21,790 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-13 15:12:21,823 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-13 15:12:21,975 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_tso.oepc.i[949,962] [2021-08-13 15:12:22,108 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 15:12:22,113 INFO L203 MainTranslator]: Completed pre-run [2021-08-13 15:12:22,121 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_tso.oepc.i[949,962] [2021-08-13 15:12:22,167 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 15:12:22,233 INFO L208 MainTranslator]: Completed translation [2021-08-13 15:12:22,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:12:22 WrapperNode [2021-08-13 15:12:22,234 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-13 15:12:22,234 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-13 15:12:22,234 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-13 15:12:22,235 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-13 15:12:22,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:12:22" (1/1) ... [2021-08-13 15:12:22,269 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:12:22" (1/1) ... [2021-08-13 15:12:22,290 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-13 15:12:22,291 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-13 15:12:22,291 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-13 15:12:22,291 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-13 15:12:22,307 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:12:22" (1/1) ... [2021-08-13 15:12:22,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:12:22" (1/1) ... [2021-08-13 15:12:22,310 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:12:22" (1/1) ... [2021-08-13 15:12:22,310 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:12:22" (1/1) ... [2021-08-13 15:12:22,318 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:12:22" (1/1) ... [2021-08-13 15:12:22,321 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:12:22" (1/1) ... [2021-08-13 15:12:22,324 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:12:22" (1/1) ... [2021-08-13 15:12:22,327 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-13 15:12:22,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-13 15:12:22,327 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-13 15:12:22,328 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-13 15:12:22,328 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:12:22" (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-08-13 15:12:22,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-13 15:12:22,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-13 15:12:22,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-13 15:12:22,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-13 15:12:22,456 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-13 15:12:22,456 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-13 15:12:22,456 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-13 15:12:22,456 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-13 15:12:22,456 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-13 15:12:22,456 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-13 15:12:22,456 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-08-13 15:12:22,456 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-08-13 15:12:22,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-13 15:12:22,456 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-13 15:12:22,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-13 15:12:22,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-13 15:12:22,458 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-13 15:12:24,223 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-13 15:12:24,223 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-13 15:12:24,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 03:12:24 BoogieIcfgContainer [2021-08-13 15:12:24,226 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-13 15:12:24,227 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-13 15:12:24,227 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-13 15:12:24,229 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-13 15:12:24,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.08 03:12:21" (1/3) ... [2021-08-13 15:12:24,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e58c040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 03:12:24, skipping insertion in model container [2021-08-13 15:12:24,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:12:22" (2/3) ... [2021-08-13 15:12:24,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e58c040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 03:12:24, skipping insertion in model container [2021-08-13 15:12:24,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 03:12:24" (3/3) ... [2021-08-13 15:12:24,231 INFO L111 eAbstractionObserver]: Analyzing ICFG mix027_tso.oepc.i [2021-08-13 15:12:24,235 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-13 15:12:24,236 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-13 15:12:24,236 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-13 15:12:24,265 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,265 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,265 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,266 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,266 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,266 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,266 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,266 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,269 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,269 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,269 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,269 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,270 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,270 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,271 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,271 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,271 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,271 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,271 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,271 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,272 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,272 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,272 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,272 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,272 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,272 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,272 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,272 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,272 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,272 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,275 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,275 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,275 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,275 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,277 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,277 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,277 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,277 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,277 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,277 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,277 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,278 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,278 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,278 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,278 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,278 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,279 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,279 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,280 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,281 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,282 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,282 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,282 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,286 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,287 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,287 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,287 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,287 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,287 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,287 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,287 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,287 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,287 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,288 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,288 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,289 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,289 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,290 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,291 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,292 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,292 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,293 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,293 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,293 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,293 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,293 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,293 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,293 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,293 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,294 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,294 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,294 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,294 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,294 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,294 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,294 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,295 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,295 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,295 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,296 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,296 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,296 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:12:24,297 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-13 15:12:24,316 INFO L255 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-08-13 15:12:24,337 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-13 15:12:24,337 INFO L379 AbstractCegarLoop]: Hoare is false [2021-08-13 15:12:24,337 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-13 15:12:24,337 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-13 15:12:24,337 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-13 15:12:24,337 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-13 15:12:24,337 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-13 15:12:24,337 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-13 15:12:24,346 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2021-08-13 15:12:24,379 INFO L129 PetriNetUnfolder]: 2/125 cut-off events. [2021-08-13 15:12:24,379 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 15:12:24,389 INFO L84 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2021-08-13 15:12:24,389 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2021-08-13 15:12:24,392 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2021-08-13 15:12:24,403 INFO L129 PetriNetUnfolder]: 0/60 cut-off events. [2021-08-13 15:12:24,404 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 15:12:24,404 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:12:24,404 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 15:12:24,405 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:12:24,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:12:24,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1619171300, now seen corresponding path program 1 times [2021-08-13 15:12:24,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:12:24,414 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37099406] [2021-08-13 15:12:24,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:12:24,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:12:24,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:24,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:12:24,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:24,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:12:24,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 15:12:24,645 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:12:24,646 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37099406] [2021-08-13 15:12:24,647 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37099406] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:12:24,647 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:12:24,647 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-13 15:12:24,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584981314] [2021-08-13 15:12:24,653 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-13 15:12:24,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:12:24,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-13 15:12:24,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-13 15:12:24,665 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 129 [2021-08-13 15:12:24,670 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 125 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 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-08-13 15:12:24,670 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:12:24,670 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 129 [2021-08-13 15:12:24,671 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:12:24,942 INFO L129 PetriNetUnfolder]: 133/824 cut-off events. [2021-08-13 15:12:24,942 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 15:12:24,947 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1043 conditions, 824 events. 133/824 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5509 event pairs, 87 based on Foata normal form. 36/809 useless extension candidates. Maximal degree in co-relation 990. Up to 153 conditions per place. [2021-08-13 15:12:24,952 INFO L132 encePairwiseOnDemand]: 124/129 looper letters, 11 selfloop transitions, 2 changer transitions 0/126 dead transitions. [2021-08-13 15:12:24,952 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 126 transitions, 290 flow [2021-08-13 15:12:24,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-13 15:12:24,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-13 15:12:24,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2021-08-13 15:12:24,961 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9534883720930233 [2021-08-13 15:12:24,962 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2021-08-13 15:12:24,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2021-08-13 15:12:24,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:12:24,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2021-08-13 15:12:24,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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-08-13 15:12:24,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 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-08-13 15:12:24,971 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 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-08-13 15:12:24,972 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 0 predicate places. [2021-08-13 15:12:24,972 INFO L482 AbstractCegarLoop]: Abstraction has has 136 places, 126 transitions, 290 flow [2021-08-13 15:12:24,972 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 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-08-13 15:12:24,972 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:12:24,972 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 15:12:24,973 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-13 15:12:24,973 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:12:24,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:12:24,973 INFO L82 PathProgramCache]: Analyzing trace with hash -272929157, now seen corresponding path program 1 times [2021-08-13 15:12:24,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:12:24,973 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918657203] [2021-08-13 15:12:24,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:12:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:12:25,151 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:25,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:12:25,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:25,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:12:25,161 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 15:12:25,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 15:12:25,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:25,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:12:25,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:25,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:12:25,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:25,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:12:25,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 15:12:25,189 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:12:25,189 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918657203] [2021-08-13 15:12:25,189 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918657203] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:12:25,189 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:12:25,189 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 15:12:25,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980271887] [2021-08-13 15:12:25,196 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 15:12:25,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:12:25,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 15:12:25,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 15:12:25,201 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 129 [2021-08-13 15:12:25,202 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 126 transitions, 290 flow. Second operand has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 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-08-13 15:12:25,202 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:12:25,202 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 129 [2021-08-13 15:12:25,202 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:12:25,448 INFO L129 PetriNetUnfolder]: 221/1327 cut-off events. [2021-08-13 15:12:25,448 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-08-13 15:12:25,453 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1926 conditions, 1327 events. 221/1327 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 11061 event pairs, 83 based on Foata normal form. 0/1276 useless extension candidates. Maximal degree in co-relation 1870. Up to 201 conditions per place. [2021-08-13 15:12:25,458 INFO L132 encePairwiseOnDemand]: 123/129 looper letters, 8 selfloop transitions, 2 changer transitions 13/139 dead transitions. [2021-08-13 15:12:25,458 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 139 transitions, 366 flow [2021-08-13 15:12:25,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 15:12:25,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 15:12:25,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1076 transitions. [2021-08-13 15:12:25,463 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9267872523686477 [2021-08-13 15:12:25,463 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1076 transitions. [2021-08-13 15:12:25,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1076 transitions. [2021-08-13 15:12:25,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:12:25,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1076 transitions. [2021-08-13 15:12:25,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.55555555555556) internal successors, (1076), 9 states have internal predecessors, (1076), 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-08-13 15:12:25,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 129.0) internal successors, (1290), 10 states have internal predecessors, (1290), 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-08-13 15:12:25,470 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 129.0) internal successors, (1290), 10 states have internal predecessors, (1290), 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-08-13 15:12:25,470 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 8 predicate places. [2021-08-13 15:12:25,470 INFO L482 AbstractCegarLoop]: Abstraction has has 144 places, 139 transitions, 366 flow [2021-08-13 15:12:25,471 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 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-08-13 15:12:25,471 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:12:25,471 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 15:12:25,471 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-13 15:12:25,471 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:12:25,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:12:25,472 INFO L82 PathProgramCache]: Analyzing trace with hash -214969216, now seen corresponding path program 1 times [2021-08-13 15:12:25,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:12:25,472 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175226748] [2021-08-13 15:12:25,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:12:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:12:25,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:25,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:12:25,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:25,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:12:25,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:25,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 15:12:25,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:25,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 15:12:25,684 INFO L142 QuantifierPusher]: treesize reduction 10, result has 80.4 percent of original size [2021-08-13 15:12:25,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-08-13 15:12:25,700 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 15:12:25,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 15:12:25,716 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:25,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:12:25,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:25,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:12:25,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:25,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:12:25,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 15:12:25,736 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:12:25,736 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175226748] [2021-08-13 15:12:25,736 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175226748] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:12:25,736 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:12:25,736 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-13 15:12:25,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128828518] [2021-08-13 15:12:25,737 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-08-13 15:12:25,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:12:25,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-13 15:12:25,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-08-13 15:12:25,739 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 129 [2021-08-13 15:12:25,740 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 139 transitions, 366 flow. Second operand has 9 states, 9 states have (on average 109.11111111111111) internal successors, (982), 9 states have internal predecessors, (982), 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-08-13 15:12:25,740 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:12:25,740 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 129 [2021-08-13 15:12:25,740 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:12:26,557 INFO L129 PetriNetUnfolder]: 2114/5579 cut-off events. [2021-08-13 15:12:26,558 INFO L130 PetriNetUnfolder]: For 1658/2363 co-relation queries the response was YES. [2021-08-13 15:12:26,573 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11398 conditions, 5579 events. 2114/5579 cut-off events. For 1658/2363 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 53953 event pairs, 475 based on Foata normal form. 8/5514 useless extension candidates. Maximal degree in co-relation 11337. Up to 1625 conditions per place. [2021-08-13 15:12:26,583 INFO L132 encePairwiseOnDemand]: 116/129 looper letters, 19 selfloop transitions, 13 changer transitions 115/240 dead transitions. [2021-08-13 15:12:26,583 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 240 transitions, 1022 flow [2021-08-13 15:12:26,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-13 15:12:26,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-08-13 15:12:26,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1598 transitions. [2021-08-13 15:12:26,586 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.884828349944629 [2021-08-13 15:12:26,586 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1598 transitions. [2021-08-13 15:12:26,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1598 transitions. [2021-08-13 15:12:26,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:12:26,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1598 transitions. [2021-08-13 15:12:26,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 114.14285714285714) internal successors, (1598), 14 states have internal predecessors, (1598), 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-08-13 15:12:26,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 129.0) internal successors, (1935), 15 states have internal predecessors, (1935), 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-08-13 15:12:26,592 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 129.0) internal successors, (1935), 15 states have internal predecessors, (1935), 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-08-13 15:12:26,592 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 21 predicate places. [2021-08-13 15:12:26,592 INFO L482 AbstractCegarLoop]: Abstraction has has 157 places, 240 transitions, 1022 flow [2021-08-13 15:12:26,593 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 109.11111111111111) internal successors, (982), 9 states have internal predecessors, (982), 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-08-13 15:12:26,593 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:12:26,593 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 15:12:26,593 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-13 15:12:26,593 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:12:26,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:12:26,593 INFO L82 PathProgramCache]: Analyzing trace with hash -125654470, now seen corresponding path program 1 times [2021-08-13 15:12:26,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:12:26,594 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59238079] [2021-08-13 15:12:26,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:12:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:12:26,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:26,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:12:26,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:26,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:12:26,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:26,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 15:12:26,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:26,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 15:12:26,698 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-08-13 15:12:26,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-08-13 15:12:26,721 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-08-13 15:12:26,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-08-13 15:12:26,741 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 15:12:26,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 15:12:26,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:26,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:12:26,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:26,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:12:26,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:26,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:12:26,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 15:12:26,773 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:12:26,773 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59238079] [2021-08-13 15:12:26,773 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59238079] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:12:26,774 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:12:26,774 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-13 15:12:26,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580212626] [2021-08-13 15:12:26,775 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-13 15:12:26,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:12:26,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-13 15:12:26,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-13 15:12:26,777 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 129 [2021-08-13 15:12:26,778 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 240 transitions, 1022 flow. Second operand has 10 states, 10 states have (on average 107.3) internal successors, (1073), 10 states have internal predecessors, (1073), 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-08-13 15:12:26,778 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:12:26,778 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 129 [2021-08-13 15:12:26,778 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:12:27,984 INFO L129 PetriNetUnfolder]: 2912/7899 cut-off events. [2021-08-13 15:12:27,984 INFO L130 PetriNetUnfolder]: For 2644/5113 co-relation queries the response was YES. [2021-08-13 15:12:28,010 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20022 conditions, 7899 events. 2912/7899 cut-off events. For 2644/5113 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 82839 event pairs, 478 based on Foata normal form. 35/7862 useless extension candidates. Maximal degree in co-relation 19954. Up to 2651 conditions per place. [2021-08-13 15:12:28,023 INFO L132 encePairwiseOnDemand]: 115/129 looper letters, 26 selfloop transitions, 17 changer transitions 255/389 dead transitions. [2021-08-13 15:12:28,023 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 389 transitions, 2458 flow [2021-08-13 15:12:28,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-13 15:12:28,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-08-13 15:12:28,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1890 transitions. [2021-08-13 15:12:28,027 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8618331053351573 [2021-08-13 15:12:28,027 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1890 transitions. [2021-08-13 15:12:28,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1890 transitions. [2021-08-13 15:12:28,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:12:28,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1890 transitions. [2021-08-13 15:12:28,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 111.17647058823529) internal successors, (1890), 17 states have internal predecessors, (1890), 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-08-13 15:12:28,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 129.0) internal successors, (2322), 18 states have internal predecessors, (2322), 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-08-13 15:12:28,033 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 129.0) internal successors, (2322), 18 states have internal predecessors, (2322), 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-08-13 15:12:28,033 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 37 predicate places. [2021-08-13 15:12:28,033 INFO L482 AbstractCegarLoop]: Abstraction has has 173 places, 389 transitions, 2458 flow [2021-08-13 15:12:28,033 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 107.3) internal successors, (1073), 10 states have internal predecessors, (1073), 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-08-13 15:12:28,033 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:12:28,034 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 15:12:28,034 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-13 15:12:28,034 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:12:28,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:12:28,034 INFO L82 PathProgramCache]: Analyzing trace with hash 495192509, now seen corresponding path program 1 times [2021-08-13 15:12:28,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:12:28,034 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426089314] [2021-08-13 15:12:28,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:12:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:12:28,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:28,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:12:28,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:28,099 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:12:28,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:28,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 15:12:28,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:28,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 15:12:28,115 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:28,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 15:12:28,127 INFO L142 QuantifierPusher]: treesize reduction 10, result has 80.4 percent of original size [2021-08-13 15:12:28,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-08-13 15:12:28,140 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 15:12:28,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 15:12:28,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:28,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:12:28,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:28,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:12:28,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:28,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:12:28,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 15:12:28,222 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:12:28,222 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426089314] [2021-08-13 15:12:28,222 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426089314] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:12:28,222 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:12:28,222 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-13 15:12:28,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662819220] [2021-08-13 15:12:28,223 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-13 15:12:28,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:12:28,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-13 15:12:28,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-08-13 15:12:28,224 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 129 [2021-08-13 15:12:28,225 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 389 transitions, 2458 flow. Second operand has 10 states, 10 states have (on average 108.2) internal successors, (1082), 10 states have internal predecessors, (1082), 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-08-13 15:12:28,225 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:12:28,225 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 129 [2021-08-13 15:12:28,225 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:12:29,705 INFO L129 PetriNetUnfolder]: 3616/9894 cut-off events. [2021-08-13 15:12:29,706 INFO L130 PetriNetUnfolder]: For 3882/8290 co-relation queries the response was YES. [2021-08-13 15:12:29,734 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30182 conditions, 9894 events. 3616/9894 cut-off events. For 3882/8290 co-relation queries the response was YES. Maximal size of possible extension queue 748. Compared 108541 event pairs, 485 based on Foata normal form. 68/9891 useless extension candidates. Maximal degree in co-relation 30108. Up to 3537 conditions per place. [2021-08-13 15:12:29,749 INFO L132 encePairwiseOnDemand]: 117/129 looper letters, 39 selfloop transitions, 12 changer transitions 410/553 dead transitions. [2021-08-13 15:12:29,749 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 553 transitions, 4668 flow [2021-08-13 15:12:29,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-13 15:12:29,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-08-13 15:12:29,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1695 transitions. [2021-08-13 15:12:29,752 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.875968992248062 [2021-08-13 15:12:29,752 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1695 transitions. [2021-08-13 15:12:29,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1695 transitions. [2021-08-13 15:12:29,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:12:29,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1695 transitions. [2021-08-13 15:12:29,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 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-08-13 15:12:29,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 129.0) internal successors, (2064), 16 states have internal predecessors, (2064), 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-08-13 15:12:29,758 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 129.0) internal successors, (2064), 16 states have internal predecessors, (2064), 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-08-13 15:12:29,758 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 51 predicate places. [2021-08-13 15:12:29,759 INFO L482 AbstractCegarLoop]: Abstraction has has 187 places, 553 transitions, 4668 flow [2021-08-13 15:12:29,759 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 108.2) internal successors, (1082), 10 states have internal predecessors, (1082), 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-08-13 15:12:29,759 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:12:29,759 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 15:12:29,759 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-13 15:12:29,759 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:12:29,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:12:29,760 INFO L82 PathProgramCache]: Analyzing trace with hash -813597802, now seen corresponding path program 1 times [2021-08-13 15:12:29,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:12:29,760 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771657083] [2021-08-13 15:12:29,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:12:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:12:29,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:29,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:12:29,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:29,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:12:29,850 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:29,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 15:12:29,856 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:29,856 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 15:12:29,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:29,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 15:12:29,874 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-08-13 15:12:29,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-08-13 15:12:29,896 INFO L142 QuantifierPusher]: treesize reduction 20, result has 79.6 percent of original size [2021-08-13 15:12:29,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 78 [2021-08-13 15:12:29,904 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 15:12:29,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 15:12:29,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:29,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:12:29,927 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:29,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:12:29,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:29,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:12:29,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 15:12:29,937 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:12:29,937 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771657083] [2021-08-13 15:12:29,937 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771657083] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:12:29,938 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:12:29,938 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-13 15:12:29,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133540005] [2021-08-13 15:12:29,938 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-13 15:12:29,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:12:29,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-13 15:12:29,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-13 15:12:29,942 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 129 [2021-08-13 15:12:29,943 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 553 transitions, 4668 flow. Second operand has 10 states, 10 states have (on average 108.3) internal successors, (1083), 10 states have internal predecessors, (1083), 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-08-13 15:12:29,943 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:12:29,943 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 129 [2021-08-13 15:12:29,943 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:12:31,590 INFO L129 PetriNetUnfolder]: 3929/11112 cut-off events. [2021-08-13 15:12:31,590 INFO L130 PetriNetUnfolder]: For 4977/10682 co-relation queries the response was YES. [2021-08-13 15:12:31,622 INFO L84 FinitePrefix]: Finished finitePrefix Result has 39110 conditions, 11112 events. 3929/11112 cut-off events. For 4977/10682 co-relation queries the response was YES. Maximal size of possible extension queue 839. Compared 126279 event pairs, 498 based on Foata normal form. 100/11142 useless extension candidates. Maximal degree in co-relation 39030. Up to 3970 conditions per place. [2021-08-13 15:12:31,637 INFO L132 encePairwiseOnDemand]: 118/129 looper letters, 41 selfloop transitions, 14 changer transitions 528/675 dead transitions. [2021-08-13 15:12:31,637 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 675 transitions, 7030 flow [2021-08-13 15:12:31,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-13 15:12:31,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-08-13 15:12:31,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1695 transitions. [2021-08-13 15:12:31,643 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.875968992248062 [2021-08-13 15:12:31,643 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1695 transitions. [2021-08-13 15:12:31,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1695 transitions. [2021-08-13 15:12:31,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:12:31,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1695 transitions. [2021-08-13 15:12:31,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 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-08-13 15:12:31,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 129.0) internal successors, (2064), 16 states have internal predecessors, (2064), 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-08-13 15:12:31,660 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 129.0) internal successors, (2064), 16 states have internal predecessors, (2064), 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-08-13 15:12:31,661 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 65 predicate places. [2021-08-13 15:12:31,661 INFO L482 AbstractCegarLoop]: Abstraction has has 201 places, 675 transitions, 7030 flow [2021-08-13 15:12:31,661 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 108.3) internal successors, (1083), 10 states have internal predecessors, (1083), 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-08-13 15:12:31,661 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:12:31,661 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 15:12:31,661 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-13 15:12:31,661 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:12:31,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:12:31,662 INFO L82 PathProgramCache]: Analyzing trace with hash -580392835, now seen corresponding path program 1 times [2021-08-13 15:12:31,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:12:31,662 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649399833] [2021-08-13 15:12:31,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:12:31,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:12:31,712 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:31,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:12:31,713 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:31,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:12:31,716 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 15:12:31,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 15:12:31,728 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:31,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 15:12:31,737 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 15:12:31,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:12:31,743 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:31,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:12:31,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 15:12:31,744 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:12:31,744 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649399833] [2021-08-13 15:12:31,744 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649399833] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:12:31,744 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:12:31,744 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 15:12:31,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098959906] [2021-08-13 15:12:31,744 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 15:12:31,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:12:31,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 15:12:31,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 15:12:31,745 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 129 [2021-08-13 15:12:31,746 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 675 transitions, 7030 flow. Second operand has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 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-08-13 15:12:31,746 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:12:31,746 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 129 [2021-08-13 15:12:31,746 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:12:33,662 INFO L129 PetriNetUnfolder]: 4690/13906 cut-off events. [2021-08-13 15:12:33,662 INFO L130 PetriNetUnfolder]: For 5815/8490 co-relation queries the response was YES. [2021-08-13 15:12:33,748 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43164 conditions, 13906 events. 4690/13906 cut-off events. For 5815/8490 co-relation queries the response was YES. Maximal size of possible extension queue 912. Compared 166702 event pairs, 1044 based on Foata normal form. 15/13346 useless extension candidates. Maximal degree in co-relation 43081. Up to 5315 conditions per place. [2021-08-13 15:12:33,811 INFO L132 encePairwiseOnDemand]: 118/129 looper letters, 29 selfloop transitions, 20 changer transitions 85/504 dead transitions. [2021-08-13 15:12:33,811 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 504 transitions, 4728 flow [2021-08-13 15:12:33,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-13 15:12:33,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-13 15:12:33,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1191 transitions. [2021-08-13 15:12:33,815 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9232558139534883 [2021-08-13 15:12:33,815 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1191 transitions. [2021-08-13 15:12:33,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1191 transitions. [2021-08-13 15:12:33,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:12:33,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1191 transitions. [2021-08-13 15:12:33,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 119.1) internal successors, (1191), 10 states have internal predecessors, (1191), 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-08-13 15:12:33,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 129.0) internal successors, (1419), 11 states have internal predecessors, (1419), 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-08-13 15:12:33,819 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 129.0) internal successors, (1419), 11 states have internal predecessors, (1419), 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-08-13 15:12:33,819 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 65 predicate places. [2021-08-13 15:12:33,819 INFO L482 AbstractCegarLoop]: Abstraction has has 201 places, 504 transitions, 4728 flow [2021-08-13 15:12:33,820 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 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-08-13 15:12:33,820 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:12:33,820 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 15:12:33,820 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-13 15:12:33,820 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:12:33,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:12:33,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1969672449, now seen corresponding path program 1 times [2021-08-13 15:12:33,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:12:33,821 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328415958] [2021-08-13 15:12:33,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:12:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:12:33,959 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:33,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:12:33,960 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:33,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:12:33,963 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:33,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:12:33,967 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 15:12:33,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 15:12:33,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:33,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 15:12:33,985 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 15:12:33,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:12:33,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:33,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:12:33,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 15:12:33,993 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:12:33,993 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328415958] [2021-08-13 15:12:33,993 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328415958] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:12:33,993 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:12:33,993 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 15:12:33,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925591434] [2021-08-13 15:12:33,994 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 15:12:33,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:12:33,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 15:12:33,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-13 15:12:33,995 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 129 [2021-08-13 15:12:33,996 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 504 transitions, 4728 flow. Second operand has 7 states, 7 states have (on average 115.14285714285714) internal successors, (806), 7 states have internal predecessors, (806), 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-08-13 15:12:33,996 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:12:33,996 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 129 [2021-08-13 15:12:33,996 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:12:34,897 INFO L129 PetriNetUnfolder]: 2079/6228 cut-off events. [2021-08-13 15:12:34,897 INFO L130 PetriNetUnfolder]: For 2276/8635 co-relation queries the response was YES. [2021-08-13 15:12:34,919 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18491 conditions, 6228 events. 2079/6228 cut-off events. For 2276/8635 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 64079 event pairs, 295 based on Foata normal form. 550/6431 useless extension candidates. Maximal degree in co-relation 18405. Up to 1450 conditions per place. [2021-08-13 15:12:34,947 INFO L132 encePairwiseOnDemand]: 118/129 looper letters, 52 selfloop transitions, 54 changer transitions 101/408 dead transitions. [2021-08-13 15:12:34,947 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 408 transitions, 3326 flow [2021-08-13 15:12:34,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 15:12:34,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 15:12:34,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1550 transitions. [2021-08-13 15:12:34,950 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9242695289206917 [2021-08-13 15:12:34,950 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1550 transitions. [2021-08-13 15:12:34,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1550 transitions. [2021-08-13 15:12:34,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:12:34,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1550 transitions. [2021-08-13 15:12:34,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 119.23076923076923) internal successors, (1550), 13 states have internal predecessors, (1550), 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-08-13 15:12:34,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 129.0) internal successors, (1806), 14 states have internal predecessors, (1806), 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-08-13 15:12:34,956 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 129.0) internal successors, (1806), 14 states have internal predecessors, (1806), 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-08-13 15:12:34,956 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 77 predicate places. [2021-08-13 15:12:34,956 INFO L482 AbstractCegarLoop]: Abstraction has has 213 places, 408 transitions, 3326 flow [2021-08-13 15:12:34,957 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 115.14285714285714) internal successors, (806), 7 states have internal predecessors, (806), 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-08-13 15:12:34,957 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:12:34,957 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 15:12:34,957 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-13 15:12:34,957 INFO L430 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:12:34,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:12:34,957 INFO L82 PathProgramCache]: Analyzing trace with hash -762893426, now seen corresponding path program 1 times [2021-08-13 15:12:34,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:12:34,958 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840424263] [2021-08-13 15:12:34,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:12:34,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:12:35,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:35,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:12:35,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:35,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:12:35,041 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:35,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 15:12:35,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:35,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 15:12:35,052 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:35,052 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 15:12:35,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:35,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-08-13 15:12:35,070 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:35,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 15:12:35,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:35,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-08-13 15:12:35,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:35,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-08-13 15:12:35,117 INFO L142 QuantifierPusher]: treesize reduction 10, result has 84.8 percent of original size [2021-08-13 15:12:35,118 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 56 [2021-08-13 15:12:35,144 INFO L142 QuantifierPusher]: treesize reduction 17, result has 48.5 percent of original size [2021-08-13 15:12:35,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-08-13 15:12:35,161 INFO L142 QuantifierPusher]: treesize reduction 136, result has 18.6 percent of original size [2021-08-13 15:12:35,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-08-13 15:12:35,183 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 15:12:35,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 15:12:35,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:35,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:12:35,207 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:35,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:12:35,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:35,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:12:35,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 15:12:35,221 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:12:35,221 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840424263] [2021-08-13 15:12:35,221 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840424263] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:12:35,221 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:12:35,221 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-08-13 15:12:35,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119782229] [2021-08-13 15:12:35,222 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-08-13 15:12:35,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:12:35,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-13 15:12:35,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2021-08-13 15:12:35,223 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 129 [2021-08-13 15:12:35,224 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 408 transitions, 3326 flow. Second operand has 16 states, 16 states have (on average 104.125) internal successors, (1666), 16 states have internal predecessors, (1666), 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-08-13 15:12:35,225 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:12:35,225 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 129 [2021-08-13 15:12:35,225 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:12:36,303 INFO L129 PetriNetUnfolder]: 2152/6557 cut-off events. [2021-08-13 15:12:36,303 INFO L130 PetriNetUnfolder]: For 3347/7940 co-relation queries the response was YES. [2021-08-13 15:12:36,331 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21227 conditions, 6557 events. 2152/6557 cut-off events. For 3347/7940 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 68563 event pairs, 285 based on Foata normal form. 69/6284 useless extension candidates. Maximal degree in co-relation 21131. Up to 1602 conditions per place. [2021-08-13 15:12:36,358 INFO L132 encePairwiseOnDemand]: 116/129 looper letters, 94 selfloop transitions, 35 changer transitions 118/443 dead transitions. [2021-08-13 15:12:36,358 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 443 transitions, 4240 flow [2021-08-13 15:12:36,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-13 15:12:36,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-13 15:12:36,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1723 transitions. [2021-08-13 15:12:36,362 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8347868217054264 [2021-08-13 15:12:36,362 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1723 transitions. [2021-08-13 15:12:36,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1723 transitions. [2021-08-13 15:12:36,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:12:36,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1723 transitions. [2021-08-13 15:12:36,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 107.6875) internal successors, (1723), 16 states have internal predecessors, (1723), 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-08-13 15:12:36,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 129.0) internal successors, (2193), 17 states have internal predecessors, (2193), 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-08-13 15:12:36,368 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 129.0) internal successors, (2193), 17 states have internal predecessors, (2193), 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-08-13 15:12:36,369 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 92 predicate places. [2021-08-13 15:12:36,369 INFO L482 AbstractCegarLoop]: Abstraction has has 228 places, 443 transitions, 4240 flow [2021-08-13 15:12:36,369 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 104.125) internal successors, (1666), 16 states have internal predecessors, (1666), 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-08-13 15:12:36,369 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:12:36,369 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 15:12:36,370 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-13 15:12:36,370 INFO L430 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:12:36,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:12:36,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1178521669, now seen corresponding path program 1 times [2021-08-13 15:12:36,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:12:36,370 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131650589] [2021-08-13 15:12:36,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:12:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:12:36,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:36,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:12:36,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:36,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:12:36,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:36,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:12:36,421 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:36,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:12:36,426 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 15:12:36,427 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 15:12:36,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:36,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 15:12:36,449 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 15:12:36,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:12:36,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:36,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:12:36,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 15:12:36,458 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:12:36,458 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131650589] [2021-08-13 15:12:36,458 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131650589] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:12:36,458 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:12:36,458 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-13 15:12:36,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911988541] [2021-08-13 15:12:36,458 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-13 15:12:36,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:12:36,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-13 15:12:36,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-13 15:12:36,460 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 129 [2021-08-13 15:12:36,460 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 443 transitions, 4240 flow. Second operand has 8 states, 8 states have (on average 115.125) internal successors, (921), 8 states have internal predecessors, (921), 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-08-13 15:12:36,460 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:12:36,460 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 129 [2021-08-13 15:12:36,460 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:12:37,092 INFO L129 PetriNetUnfolder]: 1391/3747 cut-off events. [2021-08-13 15:12:37,092 INFO L130 PetriNetUnfolder]: For 2191/13550 co-relation queries the response was YES. [2021-08-13 15:12:37,114 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12694 conditions, 3747 events. 1391/3747 cut-off events. For 2191/13550 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 35266 event pairs, 34 based on Foata normal form. 794/4282 useless extension candidates. Maximal degree in co-relation 12595. Up to 1036 conditions per place. [2021-08-13 15:12:37,132 INFO L132 encePairwiseOnDemand]: 118/129 looper letters, 33 selfloop transitions, 106 changer transitions 86/362 dead transitions. [2021-08-13 15:12:37,133 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 362 transitions, 2864 flow [2021-08-13 15:12:37,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-13 15:12:37,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-13 15:12:37,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1909 transitions. [2021-08-13 15:12:37,135 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9249031007751938 [2021-08-13 15:12:37,135 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1909 transitions. [2021-08-13 15:12:37,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1909 transitions. [2021-08-13 15:12:37,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:12:37,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1909 transitions. [2021-08-13 15:12:37,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 119.3125) internal successors, (1909), 16 states have internal predecessors, (1909), 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-08-13 15:12:37,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 129.0) internal successors, (2193), 17 states have internal predecessors, (2193), 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-08-13 15:12:37,141 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 129.0) internal successors, (2193), 17 states have internal predecessors, (2193), 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-08-13 15:12:37,141 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 86 predicate places. [2021-08-13 15:12:37,142 INFO L482 AbstractCegarLoop]: Abstraction has has 222 places, 362 transitions, 2864 flow [2021-08-13 15:12:37,142 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 115.125) internal successors, (921), 8 states have internal predecessors, (921), 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-08-13 15:12:37,142 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:12:37,142 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-13 15:12:37,142 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-13 15:12:37,142 INFO L430 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:12:37,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:12:37,143 INFO L82 PathProgramCache]: Analyzing trace with hash -11182539, now seen corresponding path program 1 times [2021-08-13 15:12:37,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:12:37,143 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436787056] [2021-08-13 15:12:37,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:12:37,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:12:37,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:37,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:12:37,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:37,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:12:37,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:37,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:12:37,248 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 15:12:37,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 15:12:37,261 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:37,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:12:37,269 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:37,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:12:37,276 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:37,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:12:37,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 15:12:37,277 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:12:37,277 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436787056] [2021-08-13 15:12:37,277 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436787056] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:12:37,277 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:12:37,278 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 15:12:37,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048774099] [2021-08-13 15:12:37,278 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 15:12:37,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:12:37,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 15:12:37,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-13 15:12:37,279 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 129 [2021-08-13 15:12:37,280 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 362 transitions, 2864 flow. Second operand has 7 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 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-08-13 15:12:37,280 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:12:37,280 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 129 [2021-08-13 15:12:37,280 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:12:37,993 INFO L129 PetriNetUnfolder]: 2752/7321 cut-off events. [2021-08-13 15:12:37,994 INFO L130 PetriNetUnfolder]: For 4354/11766 co-relation queries the response was YES. [2021-08-13 15:12:38,034 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25043 conditions, 7321 events. 2752/7321 cut-off events. For 4354/11766 co-relation queries the response was YES. Maximal size of possible extension queue 854. Compared 77523 event pairs, 61 based on Foata normal form. 15/6850 useless extension candidates. Maximal degree in co-relation 24940. Up to 2047 conditions per place. [2021-08-13 15:12:38,063 INFO L132 encePairwiseOnDemand]: 123/129 looper letters, 20 selfloop transitions, 2 changer transitions 114/401 dead transitions. [2021-08-13 15:12:38,063 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 401 transitions, 3560 flow [2021-08-13 15:12:38,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-13 15:12:38,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-08-13 15:12:38,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 834 transitions. [2021-08-13 15:12:38,065 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9235880398671097 [2021-08-13 15:12:38,065 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 834 transitions. [2021-08-13 15:12:38,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 834 transitions. [2021-08-13 15:12:38,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:12:38,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 834 transitions. [2021-08-13 15:12:38,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.14285714285714) internal successors, (834), 7 states have internal predecessors, (834), 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-08-13 15:12:38,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 129.0) internal successors, (1032), 8 states have internal predecessors, (1032), 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-08-13 15:12:38,068 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 129.0) internal successors, (1032), 8 states have internal predecessors, (1032), 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-08-13 15:12:38,068 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 92 predicate places. [2021-08-13 15:12:38,068 INFO L482 AbstractCegarLoop]: Abstraction has has 228 places, 401 transitions, 3560 flow [2021-08-13 15:12:38,068 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 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-08-13 15:12:38,068 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:12:38,068 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-13 15:12:38,069 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-13 15:12:38,069 INFO L430 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:12:38,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:12:38,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1019500583, now seen corresponding path program 2 times [2021-08-13 15:12:38,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:12:38,069 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740201030] [2021-08-13 15:12:38,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:12:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:12:38,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:38,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:12:38,118 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:38,118 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:12:38,120 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:38,120 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:12:38,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:38,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:12:38,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:38,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:12:38,132 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 15:12:38,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 15:12:38,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:38,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 15:12:38,151 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 15:12:38,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:12:38,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:38,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:12:38,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 15:12:38,159 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:12:38,159 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740201030] [2021-08-13 15:12:38,159 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740201030] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:12:38,159 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:12:38,159 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-13 15:12:38,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861616859] [2021-08-13 15:12:38,159 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-08-13 15:12:38,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:12:38,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-13 15:12:38,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-08-13 15:12:38,161 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 129 [2021-08-13 15:12:38,161 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 401 transitions, 3560 flow. Second operand has 9 states, 9 states have (on average 115.11111111111111) internal successors, (1036), 9 states have internal predecessors, (1036), 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-08-13 15:12:38,161 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:12:38,161 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 129 [2021-08-13 15:12:38,161 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:12:39,187 INFO L129 PetriNetUnfolder]: 2611/6555 cut-off events. [2021-08-13 15:12:39,188 INFO L130 PetriNetUnfolder]: For 5793/27856 co-relation queries the response was YES. [2021-08-13 15:12:39,232 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26629 conditions, 6555 events. 2611/6555 cut-off events. For 5793/27856 co-relation queries the response was YES. Maximal size of possible extension queue 854. Compared 70092 event pairs, 22 based on Foata normal form. 1539/7643 useless extension candidates. Maximal degree in co-relation 26523. Up to 2006 conditions per place. [2021-08-13 15:12:39,253 INFO L132 encePairwiseOnDemand]: 118/129 looper letters, 28 selfloop transitions, 111 changer transitions 90/353 dead transitions. [2021-08-13 15:12:39,253 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 353 transitions, 3036 flow [2021-08-13 15:12:39,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-13 15:12:39,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-08-13 15:12:39,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2248 transitions. [2021-08-13 15:12:39,256 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9171766625866993 [2021-08-13 15:12:39,256 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2248 transitions. [2021-08-13 15:12:39,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2248 transitions. [2021-08-13 15:12:39,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:12:39,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2248 transitions. [2021-08-13 15:12:39,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 118.3157894736842) internal successors, (2248), 19 states have internal predecessors, (2248), 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-08-13 15:12:39,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 129.0) internal successors, (2580), 20 states have internal predecessors, (2580), 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-08-13 15:12:39,261 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 129.0) internal successors, (2580), 20 states have internal predecessors, (2580), 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-08-13 15:12:39,261 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 92 predicate places. [2021-08-13 15:12:39,261 INFO L482 AbstractCegarLoop]: Abstraction has has 228 places, 353 transitions, 3036 flow [2021-08-13 15:12:39,262 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 115.11111111111111) internal successors, (1036), 9 states have internal predecessors, (1036), 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-08-13 15:12:39,262 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:12:39,262 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-13 15:12:39,262 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-13 15:12:39,262 INFO L430 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:12:39,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:12:39,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1408861922, now seen corresponding path program 1 times [2021-08-13 15:12:39,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:12:39,263 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408968471] [2021-08-13 15:12:39,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:12:39,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:12:39,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:39,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:12:39,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:39,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:12:39,326 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 15:12:39,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 15:12:39,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:39,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:12:39,343 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:39,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:12:39,350 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:39,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:12:39,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 15:12:39,351 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:12:39,351 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408968471] [2021-08-13 15:12:39,351 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408968471] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:12:39,351 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:12:39,351 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 15:12:39,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689340636] [2021-08-13 15:12:39,352 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 15:12:39,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:12:39,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 15:12:39,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 15:12:39,353 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 129 [2021-08-13 15:12:39,354 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 353 transitions, 3036 flow. Second operand has 6 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 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-08-13 15:12:39,354 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:12:39,354 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 129 [2021-08-13 15:12:39,354 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:12:40,666 INFO L129 PetriNetUnfolder]: 5415/13561 cut-off events. [2021-08-13 15:12:40,666 INFO L130 PetriNetUnfolder]: For 11481/26669 co-relation queries the response was YES. [2021-08-13 15:12:40,759 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55189 conditions, 13561 events. 5415/13561 cut-off events. For 11481/26669 co-relation queries the response was YES. Maximal size of possible extension queue 1701. Compared 162908 event pairs, 46 based on Foata normal form. 30/12618 useless extension candidates. Maximal degree in co-relation 55080. Up to 4159 conditions per place. [2021-08-13 15:12:40,808 INFO L132 encePairwiseOnDemand]: 123/129 looper letters, 10 selfloop transitions, 2 changer transitions 100/365 dead transitions. [2021-08-13 15:12:40,808 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 365 transitions, 3262 flow [2021-08-13 15:12:40,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-13 15:12:40,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-08-13 15:12:40,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 709 transitions. [2021-08-13 15:12:40,809 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9160206718346253 [2021-08-13 15:12:40,809 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 709 transitions. [2021-08-13 15:12:40,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 709 transitions. [2021-08-13 15:12:40,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:12:40,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 709 transitions. [2021-08-13 15:12:40,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 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-08-13 15:12:40,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 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-08-13 15:12:40,811 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 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-08-13 15:12:40,811 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 97 predicate places. [2021-08-13 15:12:40,811 INFO L482 AbstractCegarLoop]: Abstraction has has 233 places, 365 transitions, 3262 flow [2021-08-13 15:12:40,812 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 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-08-13 15:12:40,812 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:12:40,812 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-13 15:12:40,812 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-13 15:12:40,812 INFO L430 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:12:40,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:12:40,812 INFO L82 PathProgramCache]: Analyzing trace with hash 574822254, now seen corresponding path program 2 times [2021-08-13 15:12:40,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:12:40,812 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964199082] [2021-08-13 15:12:40,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:12:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:12:40,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:40,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:12:40,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:40,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:12:40,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:40,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 15:12:40,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:40,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 15:12:40,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:40,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 15:12:40,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:40,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-08-13 15:12:40,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:40,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-08-13 15:12:40,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:40,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-08-13 15:12:40,908 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 15:12:40,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 15:12:40,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:40,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:12:40,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:40,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:12:40,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:40,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:12:40,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 15:12:40,940 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:12:40,941 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964199082] [2021-08-13 15:12:40,941 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964199082] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:12:40,941 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:12:40,941 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-13 15:12:40,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571830348] [2021-08-13 15:12:40,941 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-08-13 15:12:40,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:12:40,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-13 15:12:40,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-08-13 15:12:40,942 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 129 [2021-08-13 15:12:40,943 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 365 transitions, 3262 flow. Second operand has 12 states, 12 states have (on average 104.75) internal successors, (1257), 12 states have internal predecessors, (1257), 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-08-13 15:12:40,943 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:12:40,943 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 129 [2021-08-13 15:12:40,943 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:12:44,204 INFO L129 PetriNetUnfolder]: 10387/25732 cut-off events. [2021-08-13 15:12:44,205 INFO L130 PetriNetUnfolder]: For 28148/62365 co-relation queries the response was YES. [2021-08-13 15:12:44,361 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105759 conditions, 25732 events. 10387/25732 cut-off events. For 28148/62365 co-relation queries the response was YES. Maximal size of possible extension queue 3407. Compared 338102 event pairs, 82 based on Foata normal form. 155/23879 useless extension candidates. Maximal degree in co-relation 105642. Up to 7869 conditions per place. [2021-08-13 15:12:44,392 INFO L132 encePairwiseOnDemand]: 116/129 looper letters, 53 selfloop transitions, 23 changer transitions 135/429 dead transitions. [2021-08-13 15:12:44,393 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 429 transitions, 4460 flow [2021-08-13 15:12:44,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-13 15:12:44,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-08-13 15:12:44,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1288 transitions. [2021-08-13 15:12:44,394 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8320413436692506 [2021-08-13 15:12:44,394 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1288 transitions. [2021-08-13 15:12:44,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1288 transitions. [2021-08-13 15:12:44,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:12:44,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1288 transitions. [2021-08-13 15:12:44,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 107.33333333333333) internal successors, (1288), 12 states have internal predecessors, (1288), 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-08-13 15:12:44,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 129.0) internal successors, (1677), 13 states have internal predecessors, (1677), 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-08-13 15:12:44,397 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 129.0) internal successors, (1677), 13 states have internal predecessors, (1677), 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-08-13 15:12:44,398 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 108 predicate places. [2021-08-13 15:12:44,398 INFO L482 AbstractCegarLoop]: Abstraction has has 244 places, 429 transitions, 4460 flow [2021-08-13 15:12:44,398 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 104.75) internal successors, (1257), 12 states have internal predecessors, (1257), 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-08-13 15:12:44,398 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:12:44,398 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-13 15:12:44,398 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-13 15:12:44,398 INFO L430 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:12:44,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:12:44,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1877362732, now seen corresponding path program 3 times [2021-08-13 15:12:44,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:12:44,399 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372367773] [2021-08-13 15:12:44,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:12:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:12:44,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:44,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:12:44,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:44,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:12:44,474 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:44,474 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 15:12:44,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:44,478 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 15:12:44,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:44,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 15:12:44,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:44,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-08-13 15:12:44,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:44,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 15:12:44,517 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:44,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-08-13 15:12:44,537 INFO L142 QuantifierPusher]: treesize reduction 10, result has 86.7 percent of original size [2021-08-13 15:12:44,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-08-13 15:12:44,551 INFO L142 QuantifierPusher]: treesize reduction 10, result has 87.2 percent of original size [2021-08-13 15:12:44,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 68 [2021-08-13 15:12:44,587 INFO L142 QuantifierPusher]: treesize reduction 11, result has 71.8 percent of original size [2021-08-13 15:12:44,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-08-13 15:12:44,604 INFO L142 QuantifierPusher]: treesize reduction 11, result has 66.7 percent of original size [2021-08-13 15:12:44,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-08-13 15:12:44,618 INFO L142 QuantifierPusher]: treesize reduction 11, result has 59.3 percent of original size [2021-08-13 15:12:44,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-08-13 15:12:44,631 INFO L142 QuantifierPusher]: treesize reduction 21, result has 69.1 percent of original size [2021-08-13 15:12:44,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-08-13 15:12:44,651 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 15:12:44,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 15:12:44,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:44,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:12:44,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:44,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:12:44,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:12:44,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:12:44,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 15:12:44,686 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:12:44,686 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372367773] [2021-08-13 15:12:44,686 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372367773] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:12:44,686 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:12:44,686 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-08-13 15:12:44,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289774272] [2021-08-13 15:12:44,686 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-08-13 15:12:44,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:12:44,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-08-13 15:12:44,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2021-08-13 15:12:44,688 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 129 [2021-08-13 15:12:44,689 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 429 transitions, 4460 flow. Second operand has 17 states, 17 states have (on average 100.47058823529412) internal successors, (1708), 17 states have internal predecessors, (1708), 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-08-13 15:12:44,689 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:12:44,689 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 129 [2021-08-13 15:12:44,689 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:12:49,541 INFO L129 PetriNetUnfolder]: 16062/38664 cut-off events. [2021-08-13 15:12:49,542 INFO L130 PetriNetUnfolder]: For 47051/113181 co-relation queries the response was YES. [2021-08-13 15:12:49,807 INFO L84 FinitePrefix]: Finished finitePrefix Result has 160960 conditions, 38664 events. 16062/38664 cut-off events. For 47051/113181 co-relation queries the response was YES. Maximal size of possible extension queue 5205. Compared 528985 event pairs, 81 based on Foata normal form. 186/35902 useless extension candidates. Maximal degree in co-relation 160829. Up to 12206 conditions per place. [2021-08-13 15:12:49,841 INFO L132 encePairwiseOnDemand]: 116/129 looper letters, 22 selfloop transitions, 10 changer transitions 238/482 dead transitions. [2021-08-13 15:12:49,842 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 482 transitions, 5848 flow [2021-08-13 15:12:49,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 15:12:49,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 15:12:49,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1328 transitions. [2021-08-13 15:12:49,843 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.7918902802623733 [2021-08-13 15:12:49,843 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1328 transitions. [2021-08-13 15:12:49,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1328 transitions. [2021-08-13 15:12:49,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:12:49,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1328 transitions. [2021-08-13 15:12:49,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 102.15384615384616) internal successors, (1328), 13 states have internal predecessors, (1328), 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-08-13 15:12:49,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 129.0) internal successors, (1806), 14 states have internal predecessors, (1806), 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-08-13 15:12:49,846 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 129.0) internal successors, (1806), 14 states have internal predecessors, (1806), 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-08-13 15:12:49,846 INFO L348 CegarLoopForPetriNet]: 136 programPoint places, 120 predicate places. [2021-08-13 15:12:49,847 INFO L482 AbstractCegarLoop]: Abstraction has has 256 places, 482 transitions, 5848 flow [2021-08-13 15:12:49,847 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 100.47058823529412) internal successors, (1708), 17 states have internal predecessors, (1708), 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-08-13 15:12:49,847 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:12:49,847 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-13 15:12:49,847 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-13 15:12:49,847 INFO L430 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:12:49,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:12:49,847 INFO L82 PathProgramCache]: Analyzing trace with hash -456485704, now seen corresponding path program 4 times [2021-08-13 15:12:49,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:12:49,848 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934067523] [2021-08-13 15:12:49,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:12:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 15:12:49,877 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 15:12:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 15:12:49,909 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 15:12:49,951 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-13 15:12:49,953 INFO L651 BasicCegarLoop]: Counterexample might be feasible [2021-08-13 15:12:49,953 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-13 15:12:49,955 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-13 15:12:50,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.08 03:12:50 BasicIcfg [2021-08-13 15:12:50,086 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-13 15:12:50,087 INFO L168 Benchmark]: Toolchain (without parser) took 28311.89 ms. Allocated memory was 178.3 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 140.4 MB in the beginning and 2.8 GB in the end (delta: -2.7 GB). Peak memory consumption was 1.4 GB. Max. memory is 8.0 GB. [2021-08-13 15:12:50,087 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 178.3 MB. Free memory is still 158.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-13 15:12:50,087 INFO L168 Benchmark]: CACSL2BoogieTranslator took 454.45 ms. Allocated memory is still 178.3 MB. Free memory was 140.2 MB in the beginning and 135.4 MB in the end (delta: 4.8 MB). Peak memory consumption was 8.2 MB. Max. memory is 8.0 GB. [2021-08-13 15:12:50,087 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.87 ms. Allocated memory is still 178.3 MB. Free memory was 135.4 MB in the beginning and 132.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-13 15:12:50,087 INFO L168 Benchmark]: Boogie Preprocessor took 36.00 ms. Allocated memory is still 178.3 MB. Free memory was 132.3 MB in the beginning and 129.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-13 15:12:50,087 INFO L168 Benchmark]: RCFGBuilder took 1898.27 ms. Allocated memory was 178.3 MB in the beginning and 252.7 MB in the end (delta: 74.4 MB). Free memory was 129.8 MB in the beginning and 209.3 MB in the end (delta: -79.5 MB). Peak memory consumption was 124.2 MB. Max. memory is 8.0 GB. [2021-08-13 15:12:50,087 INFO L168 Benchmark]: TraceAbstraction took 25859.65 ms. Allocated memory was 252.7 MB in the beginning and 4.2 GB in the end (delta: 3.9 GB). Free memory was 209.3 MB in the beginning and 2.8 GB in the end (delta: -2.6 GB). Peak memory consumption was 1.4 GB. Max. memory is 8.0 GB. [2021-08-13 15:12:50,087 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.10 ms. Allocated memory is still 178.3 MB. Free memory is still 158.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 454.45 ms. Allocated memory is still 178.3 MB. Free memory was 140.2 MB in the beginning and 135.4 MB in the end (delta: 4.8 MB). Peak memory consumption was 8.2 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 55.87 ms. Allocated memory is still 178.3 MB. Free memory was 135.4 MB in the beginning and 132.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 36.00 ms. Allocated memory is still 178.3 MB. Free memory was 132.3 MB in the beginning and 129.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1898.27 ms. Allocated memory was 178.3 MB in the beginning and 252.7 MB in the end (delta: 74.4 MB). Free memory was 129.8 MB in the beginning and 209.3 MB in the end (delta: -79.5 MB). Peak memory consumption was 124.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 25859.65 ms. Allocated memory was 252.7 MB in the beginning and 4.2 GB in the end (delta: 3.9 GB). Free memory was 209.3 MB in the beginning and 2.8 GB in the end (delta: -2.6 GB). Peak memory consumption was 1.4 GB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L718] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L723] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L724] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L725] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L726] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L727] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L728] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L729] 0 _Bool x$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0] [L730] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0] [L731] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L732] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L733] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L734] 0 _Bool x$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0] [L735] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0] [L736] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L737] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L738] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L739] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L740] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L742] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L745] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L746] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L851] 0 pthread_t t737; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L852] FCALL, FORK 0 pthread_create(&t737, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L853] 0 pthread_t t738; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L854] FCALL, FORK 0 pthread_create(&t738, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L855] 0 pthread_t t739; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L856] FCALL, FORK 0 pthread_create(&t739, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L857] 0 pthread_t t740; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L858] FCALL, FORK 0 pthread_create(&t740, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L820] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L823] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L826] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L756] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L806] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L806] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L808] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L810] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L829] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L829] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L830] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L830] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L831] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L832] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L832] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L833] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L833] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 x$flush_delayed = weak$$choice2 [L874] 0 x$mem_tmp = x [L875] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L875] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L876] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L876] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L877] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L877] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L878] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L878] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L879] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L880] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L881] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L883] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L883] 0 x = x$flush_delayed ? x$mem_tmp : x [L884] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 166 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 11.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 25621.4ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 22785.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 55.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 188 SDtfs, 760 SDslu, 806 SDs, 0 SdLazy, 1547 SolverSat, 450 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1323.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 238 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 2279.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=7030occurred in iteration=6, InterpolantAutomatonStates: 185, 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: 64.1ms SsaConstructionTime, 574.8ms SatisfiabilityAnalysisTime, 1872.8ms InterpolantComputationTime, 1412 NumberOfCodeBlocks, 1412 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1297 ConstructedInterpolants, 0 QuantifiedInterpolants, 7880 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...