/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe002_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 20:19:37,124 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 20:19:37,126 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 20:19:37,154 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 20:19:37,155 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 20:19:37,157 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 20:19:37,160 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 20:19:37,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 20:19:37,166 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 20:19:37,170 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 20:19:37,171 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 20:19:37,172 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 20:19:37,172 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 20:19:37,174 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 20:19:37,175 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 20:19:37,176 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 20:19:37,177 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 20:19:37,177 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 20:19:37,181 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 20:19:37,188 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 20:19:37,189 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 20:19:37,191 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 20:19:37,192 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 20:19:37,192 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 20:19:37,193 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 20:19:37,194 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 20:19:37,194 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 20:19:37,194 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 20:19:37,194 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 20:19:37,195 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 20:19:37,195 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 20:19:37,196 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 20:19:37,196 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 20:19:37,196 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 20:19:37,197 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 20:19:37,197 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 20:19:37,198 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 20:19:37,198 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 20:19:37,198 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 20:19:37,198 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 20:19:37,199 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 20:19:37,201 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2021-03-11 20:19:37,232 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 20:19:37,233 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 20:19:37,236 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 20:19:37,236 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 20:19:37,236 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 20:19:37,236 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 20:19:37,236 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 20:19:37,236 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 20:19:37,236 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 20:19:37,237 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 20:19:37,237 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 20:19:37,237 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 20:19:37,237 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 20:19:37,238 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 20:19:37,238 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 20:19:37,238 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 20:19:37,238 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 20:19:37,238 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 20:19:37,238 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 20:19:37,238 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 20:19:37,238 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 20:19:37,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 20:19:37,238 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 20:19:37,239 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 20:19:37,239 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 20:19:37,239 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 20:19:37,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 20:19:37,239 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-11 20:19:37,239 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-11 20:19:37,474 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 20:19:37,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 20:19:37,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 20:19:37,499 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 20:19:37,499 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 20:19:37,500 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_power.opt.i [2021-03-11 20:19:37,549 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00628a492/70c68d38f4eb4f6986f96398154c2bf9/FLAG1f8ef9e6e [2021-03-11 20:19:37,953 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 20:19:37,953 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_power.opt.i [2021-03-11 20:19:37,961 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00628a492/70c68d38f4eb4f6986f96398154c2bf9/FLAG1f8ef9e6e [2021-03-11 20:19:38,292 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00628a492/70c68d38f4eb4f6986f96398154c2bf9 [2021-03-11 20:19:38,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 20:19:38,298 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 20:19:38,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 20:19:38,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 20:19:38,302 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 20:19:38,302 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:19:38" (1/1) ... [2021-03-11 20:19:38,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34cebd5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:19:38, skipping insertion in model container [2021-03-11 20:19:38,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:19:38" (1/1) ... [2021-03-11 20:19:38,308 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 20:19:38,352 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 20:19:38,454 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_power.opt.i[994,1007] [2021-03-11 20:19:38,595 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:19:38,601 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 20:19:38,610 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_power.opt.i[994,1007] [2021-03-11 20:19:38,638 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:19:38,695 INFO L208 MainTranslator]: Completed translation [2021-03-11 20:19:38,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:19:38 WrapperNode [2021-03-11 20:19:38,696 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 20:19:38,697 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 20:19:38,697 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 20:19:38,697 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 20:19:38,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:19:38" (1/1) ... [2021-03-11 20:19:38,729 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:19:38" (1/1) ... [2021-03-11 20:19:38,746 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 20:19:38,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 20:19:38,746 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 20:19:38,746 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 20:19:38,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:19:38" (1/1) ... [2021-03-11 20:19:38,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:19:38" (1/1) ... [2021-03-11 20:19:38,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:19:38" (1/1) ... [2021-03-11 20:19:38,755 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:19:38" (1/1) ... [2021-03-11 20:19:38,760 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:19:38" (1/1) ... [2021-03-11 20:19:38,762 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:19:38" (1/1) ... [2021-03-11 20:19:38,764 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:19:38" (1/1) ... [2021-03-11 20:19:38,767 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 20:19:38,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 20:19:38,767 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 20:19:38,767 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 20:19:38,768 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:19:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 20:19:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 20:19:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 20:19:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 20:19:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 20:19:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 20:19:38,822 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 20:19:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 20:19:38,822 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 20:19:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-11 20:19:38,822 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-11 20:19:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 20:19:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 20:19:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 20:19:38,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 20:19:38,824 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-11 20:19:40,083 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 20:19:40,083 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 20:19:40,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:19:40 BoogieIcfgContainer [2021-03-11 20:19:40,084 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 20:19:40,085 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 20:19:40,085 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 20:19:40,087 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 20:19:40,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 08:19:38" (1/3) ... [2021-03-11 20:19:40,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47907522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:19:40, skipping insertion in model container [2021-03-11 20:19:40,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:19:38" (2/3) ... [2021-03-11 20:19:40,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47907522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:19:40, skipping insertion in model container [2021-03-11 20:19:40,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:19:40" (3/3) ... [2021-03-11 20:19:40,089 INFO L111 eAbstractionObserver]: Analyzing ICFG safe002_power.opt.i [2021-03-11 20:19:40,094 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 20:19:40,097 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 20:19:40,098 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 20:19:40,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,121 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,121 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,121 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,121 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,123 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,123 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,123 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,123 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,123 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,123 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,123 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,123 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,123 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,123 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,123 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,123 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,123 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,124 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,124 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,124 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,124 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,124 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,124 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,124 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,124 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,124 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,124 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,124 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,124 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,131 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,131 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,131 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,131 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,131 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,132 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,132 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,132 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,134 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,134 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,134 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,134 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,134 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,135 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,135 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,135 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,135 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,135 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,135 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,135 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,135 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,135 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,135 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,136 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,136 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,136 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,136 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,136 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,136 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,136 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,136 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,136 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,137 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,137 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,138 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,139 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,140 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,140 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,140 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,140 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,140 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,140 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,140 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,140 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,140 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,142 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,142 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,142 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,143 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,144 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,144 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:19:40,145 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 20:19:40,157 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-11 20:19:40,170 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 20:19:40,171 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-11 20:19:40,171 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 20:19:40,171 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 20:19:40,171 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 20:19:40,171 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 20:19:40,171 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 20:19:40,171 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 20:19:40,178 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-03-11 20:19:40,201 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-11 20:19:40,201 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:19:40,204 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-03-11 20:19:40,204 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow [2021-03-11 20:19:40,207 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2021-03-11 20:19:40,210 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 20:19:40,216 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-11 20:19:40,218 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-11 20:19:40,218 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 197 flow [2021-03-11 20:19:40,230 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-11 20:19:40,230 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:19:40,231 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-03-11 20:19:40,232 INFO L116 LiptonReduction]: Number of co-enabled transitions 1586 [2021-03-11 20:19:40,507 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-11 20:19:40,879 WARN L205 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-11 20:19:41,000 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-11 20:19:41,987 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-11 20:19:42,096 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-11 20:19:43,892 WARN L205 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-11 20:19:44,017 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-11 20:19:44,237 WARN L205 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-11 20:19:44,358 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-11 20:19:44,361 INFO L131 LiptonReduction]: Checked pairs total: 3828 [2021-03-11 20:19:44,361 INFO L133 LiptonReduction]: Total number of compositions: 80 [2021-03-11 20:19:44,362 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4155 [2021-03-11 20:19:44,369 INFO L129 PetriNetUnfolder]: 0/9 cut-off events. [2021-03-11 20:19:44,369 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:19:44,369 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:19:44,370 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2021-03-11 20:19:44,370 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:19:44,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:19:44,373 INFO L82 PathProgramCache]: Analyzing trace with hash 926961124, now seen corresponding path program 1 times [2021-03-11 20:19:44,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:19:44,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492829218] [2021-03-11 20:19:44,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:19:44,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:19:44,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:19:44,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:19:44,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:19:44,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492829218] [2021-03-11 20:19:44,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:19:44,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:19:44,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162499490] [2021-03-11 20:19:44,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:19:44,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:19:44,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:19:44,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:19:44,577 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 177 [2021-03-11 20:19:44,581 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:44,581 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:19:44,581 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 177 [2021-03-11 20:19:44,582 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:19:44,653 INFO L129 PetriNetUnfolder]: 29/103 cut-off events. [2021-03-11 20:19:44,653 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:19:44,655 INFO L84 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 103 events. 29/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 412 event pairs, 15 based on Foata normal form. 11/99 useless extension candidates. Maximal degree in co-relation 157. Up to 41 conditions per place. [2021-03-11 20:19:44,656 INFO L132 encePairwiseOnDemand]: 173/177 looper letters, 7 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2021-03-11 20:19:44,656 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 25 transitions, 77 flow [2021-03-11 20:19:44,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:19:44,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:19:44,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2021-03-11 20:19:44,669 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.864406779661017 [2021-03-11 20:19:44,669 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 459 transitions. [2021-03-11 20:19:44,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 459 transitions. [2021-03-11 20:19:44,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:19:44,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 459 transitions. [2021-03-11 20:19:44,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:44,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 177.0) internal successors, (708), 4 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:44,683 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 177.0) internal successors, (708), 4 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:44,685 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 57 flow. Second operand 3 states and 459 transitions. [2021-03-11 20:19:44,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 25 transitions, 77 flow [2021-03-11 20:19:44,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 25 transitions, 74 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-11 20:19:44,687 INFO L241 Difference]: Finished difference. Result has 31 places, 22 transitions, 54 flow [2021-03-11 20:19:44,689 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2021-03-11 20:19:44,689 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2021-03-11 20:19:44,689 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 54 flow [2021-03-11 20:19:44,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:44,690 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:19:44,690 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:19:44,690 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 20:19:44,690 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:19:44,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:19:44,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1735154930, now seen corresponding path program 1 times [2021-03-11 20:19:44,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:19:44,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270964027] [2021-03-11 20:19:44,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:19:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:19:44,778 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-11 20:19:44,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 20:19:44,787 INFO L142 QuantifierPusher]: treesize reduction 3, result has 90.0 percent of original size [2021-03-11 20:19:44,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-11 20:19:44,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:19:44,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270964027] [2021-03-11 20:19:44,800 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:19:44,800 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 20:19:44,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355345024] [2021-03-11 20:19:44,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:19:44,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:19:44,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:19:44,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:19:44,803 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 177 [2021-03-11 20:19:44,803 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:44,803 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:19:44,803 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 177 [2021-03-11 20:19:44,803 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:19:44,895 INFO L129 PetriNetUnfolder]: 197/468 cut-off events. [2021-03-11 20:19:44,895 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:19:44,897 INFO L84 FinitePrefix]: Finished finitePrefix Result has 826 conditions, 468 events. 197/468 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2768 event pairs, 45 based on Foata normal form. 0/432 useless extension candidates. Maximal degree in co-relation 817. Up to 133 conditions per place. [2021-03-11 20:19:44,898 INFO L132 encePairwiseOnDemand]: 169/177 looper letters, 8 selfloop transitions, 6 changer transitions 15/42 dead transitions. [2021-03-11 20:19:44,898 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 42 transitions, 152 flow [2021-03-11 20:19:44,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:19:44,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:19:44,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 691 transitions. [2021-03-11 20:19:44,900 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7807909604519774 [2021-03-11 20:19:44,900 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 691 transitions. [2021-03-11 20:19:44,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 691 transitions. [2021-03-11 20:19:44,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:19:44,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 691 transitions. [2021-03-11 20:19:44,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.2) internal successors, (691), 5 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-03-11 20:19:44,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 177.0) internal successors, (1062), 6 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:44,903 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 177.0) internal successors, (1062), 6 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:44,904 INFO L185 Difference]: Start difference. First operand has 31 places, 22 transitions, 54 flow. Second operand 5 states and 691 transitions. [2021-03-11 20:19:44,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 42 transitions, 152 flow [2021-03-11 20:19:44,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 42 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:19:44,905 INFO L241 Difference]: Finished difference. Result has 37 places, 26 transitions, 108 flow [2021-03-11 20:19:44,905 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2021-03-11 20:19:44,905 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places. [2021-03-11 20:19:44,905 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 108 flow [2021-03-11 20:19:44,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:44,906 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:19:44,906 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:19:44,906 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 20:19:44,906 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:19:44,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:19:44,906 INFO L82 PathProgramCache]: Analyzing trace with hash 2044885476, now seen corresponding path program 1 times [2021-03-11 20:19:44,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:19:44,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056722018] [2021-03-11 20:19:44,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:19:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:19:44,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:19:44,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:19:44,948 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-11 20:19:44,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 20:19:44,955 INFO L142 QuantifierPusher]: treesize reduction 3, result has 90.0 percent of original size [2021-03-11 20:19:44,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-11 20:19:44,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:19:44,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056722018] [2021-03-11 20:19:44,972 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:19:44,972 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:19:44,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527119731] [2021-03-11 20:19:44,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:19:44,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:19:44,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:19:44,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:19:44,974 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 177 [2021-03-11 20:19:44,975 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:44,975 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:19:44,975 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 177 [2021-03-11 20:19:44,975 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:19:45,059 INFO L129 PetriNetUnfolder]: 65/216 cut-off events. [2021-03-11 20:19:45,059 INFO L130 PetriNetUnfolder]: For 171/259 co-relation queries the response was YES. [2021-03-11 20:19:45,060 INFO L84 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 216 events. 65/216 cut-off events. For 171/259 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1160 event pairs, 0 based on Foata normal form. 20/230 useless extension candidates. Maximal degree in co-relation 621. Up to 83 conditions per place. [2021-03-11 20:19:45,064 INFO L132 encePairwiseOnDemand]: 169/177 looper letters, 12 selfloop transitions, 10 changer transitions 15/50 dead transitions. [2021-03-11 20:19:45,064 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 50 transitions, 324 flow [2021-03-11 20:19:45,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:19:45,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:19:45,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 957 transitions. [2021-03-11 20:19:45,070 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7723970944309927 [2021-03-11 20:19:45,070 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 957 transitions. [2021-03-11 20:19:45,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 957 transitions. [2021-03-11 20:19:45,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:19:45,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 957 transitions. [2021-03-11 20:19:45,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.71428571428572) internal successors, (957), 7 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:45,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 177.0) internal successors, (1416), 8 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:45,074 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 177.0) internal successors, (1416), 8 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:45,075 INFO L185 Difference]: Start difference. First operand has 37 places, 26 transitions, 108 flow. Second operand 7 states and 957 transitions. [2021-03-11 20:19:45,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 50 transitions, 324 flow [2021-03-11 20:19:45,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 50 transitions, 286 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:19:45,077 INFO L241 Difference]: Finished difference. Result has 44 places, 32 transitions, 184 flow [2021-03-11 20:19:45,077 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=184, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2021-03-11 20:19:45,077 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 11 predicate places. [2021-03-11 20:19:45,077 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 184 flow [2021-03-11 20:19:45,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:45,078 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:19:45,078 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:19:45,078 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 20:19:45,078 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:19:45,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:19:45,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1936562033, now seen corresponding path program 1 times [2021-03-11 20:19:45,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:19:45,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848885865] [2021-03-11 20:19:45,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:19:45,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:19:45,115 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:19:45,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:19:45,119 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:19:45,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:19:45,123 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-11 20:19:45,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 20:19:45,130 INFO L142 QuantifierPusher]: treesize reduction 3, result has 90.0 percent of original size [2021-03-11 20:19:45,131 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-11 20:19:45,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:19:45,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848885865] [2021-03-11 20:19:45,144 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:19:45,144 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:19:45,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903423618] [2021-03-11 20:19:45,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:19:45,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:19:45,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:19:45,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:19:45,146 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 177 [2021-03-11 20:19:45,147 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 132.83333333333334) internal successors, (797), 6 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:45,147 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:19:45,147 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 177 [2021-03-11 20:19:45,147 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:19:45,237 INFO L129 PetriNetUnfolder]: 44/167 cut-off events. [2021-03-11 20:19:45,237 INFO L130 PetriNetUnfolder]: For 489/592 co-relation queries the response was YES. [2021-03-11 20:19:45,238 INFO L84 FinitePrefix]: Finished finitePrefix Result has 594 conditions, 167 events. 44/167 cut-off events. For 489/592 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 860 event pairs, 0 based on Foata normal form. 20/183 useless extension candidates. Maximal degree in co-relation 575. Up to 78 conditions per place. [2021-03-11 20:19:45,238 INFO L132 encePairwiseOnDemand]: 169/177 looper letters, 10 selfloop transitions, 8 changer transitions 21/52 dead transitions. [2021-03-11 20:19:45,238 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 412 flow [2021-03-11 20:19:45,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-11 20:19:45,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-11 20:19:45,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1088 transitions. [2021-03-11 20:19:45,241 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.768361581920904 [2021-03-11 20:19:45,241 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1088 transitions. [2021-03-11 20:19:45,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1088 transitions. [2021-03-11 20:19:45,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:19:45,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1088 transitions. [2021-03-11 20:19:45,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:45,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 177.0) internal successors, (1593), 9 states have internal predecessors, (1593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:45,247 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 177.0) internal successors, (1593), 9 states have internal predecessors, (1593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:45,247 INFO L185 Difference]: Start difference. First operand has 44 places, 32 transitions, 184 flow. Second operand 8 states and 1088 transitions. [2021-03-11 20:19:45,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 412 flow [2021-03-11 20:19:45,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 386 flow, removed 13 selfloop flow, removed 4 redundant places. [2021-03-11 20:19:45,252 INFO L241 Difference]: Finished difference. Result has 49 places, 29 transitions, 183 flow [2021-03-11 20:19:45,252 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=183, PETRI_PLACES=49, PETRI_TRANSITIONS=29} [2021-03-11 20:19:45,253 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 16 predicate places. [2021-03-11 20:19:45,253 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 29 transitions, 183 flow [2021-03-11 20:19:45,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 132.83333333333334) internal successors, (797), 6 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:45,253 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:19:45,253 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:19:45,253 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 20:19:45,253 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:19:45,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:19:45,254 INFO L82 PathProgramCache]: Analyzing trace with hash -796767216, now seen corresponding path program 1 times [2021-03-11 20:19:45,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:19:45,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479481565] [2021-03-11 20:19:45,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:19:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:19:45,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:19:45,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:19:45,320 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:19:45,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:19:45,323 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-11 20:19:45,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 20:19:45,333 INFO L142 QuantifierPusher]: treesize reduction 3, result has 90.0 percent of original size [2021-03-11 20:19:45,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-11 20:19:45,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:19:45,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479481565] [2021-03-11 20:19:45,347 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:19:45,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:19:45,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521684262] [2021-03-11 20:19:45,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:19:45,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:19:45,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:19:45,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:19:45,350 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 177 [2021-03-11 20:19:45,350 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 29 transitions, 183 flow. Second operand has 5 states, 5 states have (on average 133.2) internal successors, (666), 5 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:45,351 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:19:45,351 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 177 [2021-03-11 20:19:45,351 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:19:45,394 INFO L129 PetriNetUnfolder]: 14/66 cut-off events. [2021-03-11 20:19:45,395 INFO L130 PetriNetUnfolder]: For 169/199 co-relation queries the response was YES. [2021-03-11 20:19:45,395 INFO L84 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 66 events. 14/66 cut-off events. For 169/199 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 202 event pairs, 3 based on Foata normal form. 11/76 useless extension candidates. Maximal degree in co-relation 235. Up to 29 conditions per place. [2021-03-11 20:19:45,396 INFO L132 encePairwiseOnDemand]: 171/177 looper letters, 11 selfloop transitions, 6 changer transitions 4/34 dead transitions. [2021-03-11 20:19:45,396 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 34 transitions, 259 flow [2021-03-11 20:19:45,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 20:19:45,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-11 20:19:45,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 810 transitions. [2021-03-11 20:19:45,399 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7627118644067796 [2021-03-11 20:19:45,399 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 810 transitions. [2021-03-11 20:19:45,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 810 transitions. [2021-03-11 20:19:45,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:19:45,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 810 transitions. [2021-03-11 20:19:45,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 135.0) internal successors, (810), 6 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:45,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:45,404 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:45,404 INFO L185 Difference]: Start difference. First operand has 49 places, 29 transitions, 183 flow. Second operand 6 states and 810 transitions. [2021-03-11 20:19:45,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 34 transitions, 259 flow [2021-03-11 20:19:45,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 34 transitions, 234 flow, removed 4 selfloop flow, removed 7 redundant places. [2021-03-11 20:19:45,407 INFO L241 Difference]: Finished difference. Result has 47 places, 29 transitions, 180 flow [2021-03-11 20:19:45,407 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=180, PETRI_PLACES=47, PETRI_TRANSITIONS=29} [2021-03-11 20:19:45,407 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 14 predicate places. [2021-03-11 20:19:45,407 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 29 transitions, 180 flow [2021-03-11 20:19:45,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 133.2) internal successors, (666), 5 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:45,407 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:19:45,407 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:19:45,408 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 20:19:45,408 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:19:45,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:19:45,411 INFO L82 PathProgramCache]: Analyzing trace with hash -321949468, now seen corresponding path program 1 times [2021-03-11 20:19:45,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:19:45,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582890420] [2021-03-11 20:19:45,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:19:45,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:19:45,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:19:45,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:19:45,466 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-11 20:19:45,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 20:19:45,475 INFO L142 QuantifierPusher]: treesize reduction 3, result has 90.0 percent of original size [2021-03-11 20:19:45,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-11 20:19:45,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:19:45,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582890420] [2021-03-11 20:19:45,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:19:45,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:19:45,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205949637] [2021-03-11 20:19:45,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:19:45,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:19:45,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:19:45,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:19:45,492 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 177 [2021-03-11 20:19:45,493 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 29 transitions, 180 flow. Second operand has 5 states, 5 states have (on average 133.2) internal successors, (666), 5 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:45,493 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:19:45,493 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 177 [2021-03-11 20:19:45,493 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:19:45,536 INFO L129 PetriNetUnfolder]: 10/56 cut-off events. [2021-03-11 20:19:45,537 INFO L130 PetriNetUnfolder]: For 121/149 co-relation queries the response was YES. [2021-03-11 20:19:45,537 INFO L84 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 56 events. 10/56 cut-off events. For 121/149 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 156 event pairs, 3 based on Foata normal form. 9/64 useless extension candidates. Maximal degree in co-relation 205. Up to 23 conditions per place. [2021-03-11 20:19:45,538 INFO L132 encePairwiseOnDemand]: 169/177 looper letters, 8 selfloop transitions, 10 changer transitions 3/34 dead transitions. [2021-03-11 20:19:45,538 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 34 transitions, 264 flow [2021-03-11 20:19:45,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 20:19:45,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-11 20:19:45,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 811 transitions. [2021-03-11 20:19:45,540 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.763653483992467 [2021-03-11 20:19:45,540 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 811 transitions. [2021-03-11 20:19:45,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 811 transitions. [2021-03-11 20:19:45,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:19:45,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 811 transitions. [2021-03-11 20:19:45,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 135.16666666666666) internal successors, (811), 6 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:45,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:45,545 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:45,545 INFO L185 Difference]: Start difference. First operand has 47 places, 29 transitions, 180 flow. Second operand 6 states and 811 transitions. [2021-03-11 20:19:45,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 34 transitions, 264 flow [2021-03-11 20:19:45,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 34 transitions, 227 flow, removed 9 selfloop flow, removed 5 redundant places. [2021-03-11 20:19:45,547 INFO L241 Difference]: Finished difference. Result has 49 places, 30 transitions, 198 flow [2021-03-11 20:19:45,547 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=198, PETRI_PLACES=49, PETRI_TRANSITIONS=30} [2021-03-11 20:19:45,547 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 16 predicate places. [2021-03-11 20:19:45,547 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 30 transitions, 198 flow [2021-03-11 20:19:45,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 133.2) internal successors, (666), 5 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:45,548 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:19:45,548 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:19:45,548 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 20:19:45,548 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:19:45,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:19:45,554 INFO L82 PathProgramCache]: Analyzing trace with hash 693578824, now seen corresponding path program 1 times [2021-03-11 20:19:45,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:19:45,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514265666] [2021-03-11 20:19:45,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:19:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:19:45,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:19:45,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:19:45,591 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:19:45,592 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:19:45,595 INFO L142 QuantifierPusher]: treesize reduction 3, result has 90.0 percent of original size [2021-03-11 20:19:45,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-11 20:19:45,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:19:45,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514265666] [2021-03-11 20:19:45,611 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:19:45,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:19:45,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306711718] [2021-03-11 20:19:45,612 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:19:45,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:19:45,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:19:45,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:19:45,613 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 177 [2021-03-11 20:19:45,614 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 30 transitions, 198 flow. Second operand has 5 states, 5 states have (on average 137.4) internal successors, (687), 5 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:45,614 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:19:45,614 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 177 [2021-03-11 20:19:45,614 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:19:45,650 INFO L129 PetriNetUnfolder]: 11/67 cut-off events. [2021-03-11 20:19:45,650 INFO L130 PetriNetUnfolder]: For 142/180 co-relation queries the response was YES. [2021-03-11 20:19:45,650 INFO L84 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 67 events. 11/67 cut-off events. For 142/180 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 243 event pairs, 5 based on Foata normal form. 6/72 useless extension candidates. Maximal degree in co-relation 243. Up to 28 conditions per place. [2021-03-11 20:19:45,650 INFO L132 encePairwiseOnDemand]: 172/177 looper letters, 7 selfloop transitions, 5 changer transitions 7/34 dead transitions. [2021-03-11 20:19:45,651 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 34 transitions, 277 flow [2021-03-11 20:19:45,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:19:45,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:19:45,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 692 transitions. [2021-03-11 20:19:45,652 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7819209039548023 [2021-03-11 20:19:45,652 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 692 transitions. [2021-03-11 20:19:45,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 692 transitions. [2021-03-11 20:19:45,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:19:45,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 692 transitions. [2021-03-11 20:19:45,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.4) internal successors, (692), 5 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:45,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 177.0) internal successors, (1062), 6 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:45,658 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 177.0) internal successors, (1062), 6 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:45,658 INFO L185 Difference]: Start difference. First operand has 49 places, 30 transitions, 198 flow. Second operand 5 states and 692 transitions. [2021-03-11 20:19:45,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 34 transitions, 277 flow [2021-03-11 20:19:45,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 34 transitions, 268 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-03-11 20:19:45,659 INFO L241 Difference]: Finished difference. Result has 50 places, 27 transitions, 176 flow [2021-03-11 20:19:45,659 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=176, PETRI_PLACES=50, PETRI_TRANSITIONS=27} [2021-03-11 20:19:45,660 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 17 predicate places. [2021-03-11 20:19:45,660 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 27 transitions, 176 flow [2021-03-11 20:19:45,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 137.4) internal successors, (687), 5 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:45,660 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:19:45,660 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:19:45,660 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 20:19:45,660 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:19:45,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:19:45,661 INFO L82 PathProgramCache]: Analyzing trace with hash 139968590, now seen corresponding path program 2 times [2021-03-11 20:19:45,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:19:45,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777538472] [2021-03-11 20:19:45,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:19:45,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:19:45,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:19:45,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:19:45,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:19:45,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:19:45,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:19:45,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:19:45,692 INFO L142 QuantifierPusher]: treesize reduction 3, result has 90.0 percent of original size [2021-03-11 20:19:45,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-11 20:19:45,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:19:45,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777538472] [2021-03-11 20:19:45,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:19:45,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:19:45,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712359923] [2021-03-11 20:19:45,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:19:45,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:19:45,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:19:45,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:19:45,706 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 177 [2021-03-11 20:19:45,707 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 27 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 137.4) internal successors, (687), 5 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:45,707 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:19:45,707 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 177 [2021-03-11 20:19:45,707 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:19:45,735 INFO L129 PetriNetUnfolder]: 7/46 cut-off events. [2021-03-11 20:19:45,735 INFO L130 PetriNetUnfolder]: For 100/108 co-relation queries the response was YES. [2021-03-11 20:19:45,735 INFO L84 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 46 events. 7/46 cut-off events. For 100/108 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 4 based on Foata normal form. 6/52 useless extension candidates. Maximal degree in co-relation 170. Up to 21 conditions per place. [2021-03-11 20:19:45,736 INFO L132 encePairwiseOnDemand]: 172/177 looper letters, 5 selfloop transitions, 2 changer transitions 7/28 dead transitions. [2021-03-11 20:19:45,736 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 28 transitions, 214 flow [2021-03-11 20:19:45,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 20:19:45,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-11 20:19:45,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 828 transitions. [2021-03-11 20:19:45,737 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7796610169491526 [2021-03-11 20:19:45,737 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 828 transitions. [2021-03-11 20:19:45,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 828 transitions. [2021-03-11 20:19:45,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:19:45,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 828 transitions. [2021-03-11 20:19:45,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 138.0) internal successors, (828), 6 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:45,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:45,741 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:45,741 INFO L185 Difference]: Start difference. First operand has 50 places, 27 transitions, 176 flow. Second operand 6 states and 828 transitions. [2021-03-11 20:19:45,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 28 transitions, 214 flow [2021-03-11 20:19:45,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 28 transitions, 175 flow, removed 5 selfloop flow, removed 9 redundant places. [2021-03-11 20:19:45,742 INFO L241 Difference]: Finished difference. Result has 47 places, 21 transitions, 92 flow [2021-03-11 20:19:45,742 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=92, PETRI_PLACES=47, PETRI_TRANSITIONS=21} [2021-03-11 20:19:45,742 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 14 predicate places. [2021-03-11 20:19:45,742 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 21 transitions, 92 flow [2021-03-11 20:19:45,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 137.4) internal successors, (687), 5 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:45,743 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:19:45,743 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:19:45,743 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 20:19:45,743 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:19:45,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:19:45,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1405723018, now seen corresponding path program 3 times [2021-03-11 20:19:45,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:19:45,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221210173] [2021-03-11 20:19:45,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:19:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:19:45,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:19:45,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:19:45,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:19:45,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:19:45,809 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:19:45,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:19:45,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:19:45,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221210173] [2021-03-11 20:19:45,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:19:45,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:19:45,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391818629] [2021-03-11 20:19:45,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:19:45,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:19:45,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:19:45,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:19:45,811 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 177 [2021-03-11 20:19:45,812 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 21 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:45,812 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:19:45,812 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 177 [2021-03-11 20:19:45,812 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:19:45,846 INFO L129 PetriNetUnfolder]: 36/97 cut-off events. [2021-03-11 20:19:45,847 INFO L130 PetriNetUnfolder]: For 81/84 co-relation queries the response was YES. [2021-03-11 20:19:45,847 INFO L84 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 97 events. 36/97 cut-off events. For 81/84 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 365 event pairs, 19 based on Foata normal form. 8/100 useless extension candidates. Maximal degree in co-relation 236. Up to 49 conditions per place. [2021-03-11 20:19:45,847 INFO L132 encePairwiseOnDemand]: 171/177 looper letters, 5 selfloop transitions, 4 changer transitions 7/31 dead transitions. [2021-03-11 20:19:45,847 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 31 transitions, 144 flow [2021-03-11 20:19:45,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:19:45,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:19:45,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 743 transitions. [2021-03-11 20:19:45,849 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8395480225988701 [2021-03-11 20:19:45,849 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 743 transitions. [2021-03-11 20:19:45,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 743 transitions. [2021-03-11 20:19:45,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:19:45,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 743 transitions. [2021-03-11 20:19:45,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 148.6) internal successors, (743), 5 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:45,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 177.0) internal successors, (1062), 6 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:45,853 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 177.0) internal successors, (1062), 6 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:45,853 INFO L185 Difference]: Start difference. First operand has 47 places, 21 transitions, 92 flow. Second operand 5 states and 743 transitions. [2021-03-11 20:19:45,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 31 transitions, 144 flow [2021-03-11 20:19:45,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 31 transitions, 118 flow, removed 5 selfloop flow, removed 11 redundant places. [2021-03-11 20:19:45,854 INFO L241 Difference]: Finished difference. Result has 39 places, 24 transitions, 102 flow [2021-03-11 20:19:45,854 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=102, PETRI_PLACES=39, PETRI_TRANSITIONS=24} [2021-03-11 20:19:45,854 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places. [2021-03-11 20:19:45,855 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 24 transitions, 102 flow [2021-03-11 20:19:45,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:45,855 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:19:45,855 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:19:45,855 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 20:19:45,855 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:19:45,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:19:45,855 INFO L82 PathProgramCache]: Analyzing trace with hash 109178422, now seen corresponding path program 1 times [2021-03-11 20:19:45,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:19:45,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846170789] [2021-03-11 20:19:45,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:19:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:19:45,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:19:45,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:19:45,916 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:19:45,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:19:45,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:19:45,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:19:45,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:19:45,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:19:45,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:19:45,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846170789] [2021-03-11 20:19:45,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:19:45,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:19:45,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432816002] [2021-03-11 20:19:45,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:19:45,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:19:45,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:19:45,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:19:45,928 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 177 [2021-03-11 20:19:45,929 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 24 transitions, 102 flow. Second operand has 5 states, 5 states have (on average 145.8) internal successors, (729), 5 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:45,929 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:19:45,929 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 177 [2021-03-11 20:19:45,929 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:19:45,960 INFO L129 PetriNetUnfolder]: 19/64 cut-off events. [2021-03-11 20:19:45,961 INFO L130 PetriNetUnfolder]: For 50/63 co-relation queries the response was YES. [2021-03-11 20:19:45,961 INFO L84 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 64 events. 19/64 cut-off events. For 50/63 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 168 event pairs, 5 based on Foata normal form. 13/76 useless extension candidates. Maximal degree in co-relation 201. Up to 36 conditions per place. [2021-03-11 20:19:45,961 INFO L132 encePairwiseOnDemand]: 171/177 looper letters, 5 selfloop transitions, 7 changer transitions 7/34 dead transitions. [2021-03-11 20:19:45,961 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 34 transitions, 198 flow [2021-03-11 20:19:45,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 20:19:45,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-11 20:19:45,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 891 transitions. [2021-03-11 20:19:45,963 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8389830508474576 [2021-03-11 20:19:45,963 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 891 transitions. [2021-03-11 20:19:45,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 891 transitions. [2021-03-11 20:19:45,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:19:45,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 891 transitions. [2021-03-11 20:19:45,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 148.5) internal successors, (891), 6 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:45,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:45,967 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:45,967 INFO L185 Difference]: Start difference. First operand has 39 places, 24 transitions, 102 flow. Second operand 6 states and 891 transitions. [2021-03-11 20:19:45,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 34 transitions, 198 flow [2021-03-11 20:19:45,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 34 transitions, 192 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-11 20:19:45,969 INFO L241 Difference]: Finished difference. Result has 43 places, 27 transitions, 152 flow [2021-03-11 20:19:45,970 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=152, PETRI_PLACES=43, PETRI_TRANSITIONS=27} [2021-03-11 20:19:45,970 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 10 predicate places. [2021-03-11 20:19:45,970 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 27 transitions, 152 flow [2021-03-11 20:19:45,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 145.8) internal successors, (729), 5 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:45,970 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:19:45,970 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:19:45,970 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 20:19:45,971 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:19:45,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:19:45,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1535299855, now seen corresponding path program 1 times [2021-03-11 20:19:45,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:19:45,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239913580] [2021-03-11 20:19:45,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:19:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:19:46,019 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:19:46,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:19:46,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:19:46,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:19:46,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:19:46,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:19:46,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:19:46,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:19:46,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:19:46,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:19:46,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:19:46,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239913580] [2021-03-11 20:19:46,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:19:46,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 20:19:46,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064473603] [2021-03-11 20:19:46,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:19:46,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:19:46,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:19:46,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:19:46,039 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 177 [2021-03-11 20:19:46,039 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 27 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 145.83333333333334) internal successors, (875), 6 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:46,039 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:19:46,039 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 177 [2021-03-11 20:19:46,040 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:19:46,079 INFO L129 PetriNetUnfolder]: 7/36 cut-off events. [2021-03-11 20:19:46,080 INFO L130 PetriNetUnfolder]: For 62/70 co-relation queries the response was YES. [2021-03-11 20:19:46,080 INFO L84 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 36 events. 7/36 cut-off events. For 62/70 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 46 event pairs, 0 based on Foata normal form. 12/48 useless extension candidates. Maximal degree in co-relation 133. Up to 20 conditions per place. [2021-03-11 20:19:46,080 INFO L132 encePairwiseOnDemand]: 171/177 looper letters, 2 selfloop transitions, 10 changer transitions 4/31 dead transitions. [2021-03-11 20:19:46,080 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 31 transitions, 220 flow [2021-03-11 20:19:46,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:19:46,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:19:46,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1033 transitions. [2021-03-11 20:19:46,082 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8337368845843423 [2021-03-11 20:19:46,082 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1033 transitions. [2021-03-11 20:19:46,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1033 transitions. [2021-03-11 20:19:46,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:19:46,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1033 transitions. [2021-03-11 20:19:46,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 147.57142857142858) internal successors, (1033), 7 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:46,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 177.0) internal successors, (1416), 8 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:46,086 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 177.0) internal successors, (1416), 8 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:46,086 INFO L185 Difference]: Start difference. First operand has 43 places, 27 transitions, 152 flow. Second operand 7 states and 1033 transitions. [2021-03-11 20:19:46,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 31 transitions, 220 flow [2021-03-11 20:19:46,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 172 flow, removed 19 selfloop flow, removed 6 redundant places. [2021-03-11 20:19:46,088 INFO L241 Difference]: Finished difference. Result has 44 places, 27 transitions, 142 flow [2021-03-11 20:19:46,088 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=142, PETRI_PLACES=44, PETRI_TRANSITIONS=27} [2021-03-11 20:19:46,089 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 11 predicate places. [2021-03-11 20:19:46,089 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 27 transitions, 142 flow [2021-03-11 20:19:46,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 145.83333333333334) internal successors, (875), 6 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:19:46,089 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:19:46,089 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:19:46,089 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-11 20:19:46,089 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:19:46,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:19:46,090 INFO L82 PathProgramCache]: Analyzing trace with hash 407314761, now seen corresponding path program 1 times [2021-03-11 20:19:46,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:19:46,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915116485] [2021-03-11 20:19:46,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:19:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:19:46,141 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:19:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:19:46,186 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:19:46,218 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 20:19:46,219 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 20:19:46,219 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-11 20:19:46,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 08:19:46 BasicIcfg [2021-03-11 20:19:46,293 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 20:19:46,294 INFO L168 Benchmark]: Toolchain (without parser) took 7998.67 ms. Allocated memory was 255.9 MB in the beginning and 557.8 MB in the end (delta: 302.0 MB). Free memory was 235.2 MB in the beginning and 283.6 MB in the end (delta: -48.5 MB). Peak memory consumption was 253.5 MB. Max. memory is 16.0 GB. [2021-03-11 20:19:46,294 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 20:19:46,294 INFO L168 Benchmark]: CACSL2BoogieTranslator took 396.57 ms. Allocated memory was 255.9 MB in the beginning and 385.9 MB in the end (delta: 130.0 MB). Free memory was 234.5 MB in the beginning and 345.0 MB in the end (delta: -110.5 MB). Peak memory consumption was 19.4 MB. Max. memory is 16.0 GB. [2021-03-11 20:19:46,294 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.13 ms. Allocated memory is still 385.9 MB. Free memory was 345.0 MB in the beginning and 342.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:19:46,294 INFO L168 Benchmark]: Boogie Preprocessor took 20.54 ms. Allocated memory is still 385.9 MB. Free memory was 342.9 MB in the beginning and 340.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:19:46,298 INFO L168 Benchmark]: RCFGBuilder took 1317.18 ms. Allocated memory is still 385.9 MB. Free memory was 340.8 MB in the beginning and 346.9 MB in the end (delta: -6.0 MB). Peak memory consumption was 67.5 MB. Max. memory is 16.0 GB. [2021-03-11 20:19:46,298 INFO L168 Benchmark]: TraceAbstraction took 6207.74 ms. Allocated memory was 385.9 MB in the beginning and 557.8 MB in the end (delta: 172.0 MB). Free memory was 346.9 MB in the beginning and 283.6 MB in the end (delta: 63.3 MB). Peak memory consumption was 235.2 MB. Max. memory is 16.0 GB. [2021-03-11 20:19:46,303 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.09 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 396.57 ms. Allocated memory was 255.9 MB in the beginning and 385.9 MB in the end (delta: 130.0 MB). Free memory was 234.5 MB in the beginning and 345.0 MB in the end (delta: -110.5 MB). Peak memory consumption was 19.4 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 49.13 ms. Allocated memory is still 385.9 MB. Free memory was 345.0 MB in the beginning and 342.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 20.54 ms. Allocated memory is still 385.9 MB. Free memory was 342.9 MB in the beginning and 340.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1317.18 ms. Allocated memory is still 385.9 MB. Free memory was 340.8 MB in the beginning and 346.9 MB in the end (delta: -6.0 MB). Peak memory consumption was 67.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 6207.74 ms. Allocated memory was 385.9 MB in the beginning and 557.8 MB in the end (delta: 172.0 MB). Free memory was 346.9 MB in the beginning and 283.6 MB in the end (delta: 63.3 MB). Peak memory consumption was 235.2 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4143.2ms, 102 PlacesBefore, 33 PlacesAfterwards, 94 TransitionsBefore, 24 TransitionsAfterwards, 1586 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 80 TotalNumberOfCompositions, 3828 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1587, positive: 1455, positive conditional: 0, positive unconditional: 1455, negative: 132, negative conditional: 0, negative unconditional: 132, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1014, positive: 978, positive conditional: 0, positive unconditional: 978, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1014, positive: 961, positive conditional: 0, positive unconditional: 961, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 53, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 445, positive: 43, positive conditional: 0, positive unconditional: 43, negative: 401, negative conditional: 0, negative unconditional: 401, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1587, positive: 477, positive conditional: 0, positive unconditional: 477, negative: 96, negative conditional: 0, negative unconditional: 96, unknown: 1014, unknown conditional: 0, unknown unconditional: 1014] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 69, Positive conditional cache size: 0, Positive unconditional cache size: 69, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L829] 0 pthread_t t1828; [L830] FCALL, FORK 0 pthread_create(&t1828, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L831] 0 pthread_t t1829; [L832] FCALL, FORK 0 pthread_create(&t1829, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 1 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L833] 0 pthread_t t1830; [L834] FCALL, FORK 0 pthread_create(&t1830, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L801] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EBX = x [L759] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L787] 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) [L787] 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) [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 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 [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L791] 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 [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L807] 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) [L807] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L807] 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) [L807] 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) [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] 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 [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L811] 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 [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L816] 3 return 0; [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L840] 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) [L840] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L840] 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) [L840] 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) [L841] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L842] 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 [L843] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L844] 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 [L847] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.2ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 6051.6ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 770.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 4195.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 75 SDtfs, 79 SDslu, 69 SDs, 0 SdLazy, 235 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 192.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 264.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=6, InterpolantAutomatonStates: 64, 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: 30.8ms SsaConstructionTime, 256.9ms SatisfiabilityAnalysisTime, 547.3ms InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 679 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...