/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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe001_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 02:30:08,213 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 02:30:08,215 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 02:30:08,236 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 02:30:08,237 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 02:30:08,238 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 02:30:08,239 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 02:30:08,248 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 02:30:08,250 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 02:30:08,254 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 02:30:08,255 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 02:30:08,255 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 02:30:08,256 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 02:30:08,257 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 02:30:08,259 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 02:30:08,259 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 02:30:08,260 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 02:30:08,261 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 02:30:08,264 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 02:30:08,270 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 02:30:08,271 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 02:30:08,272 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 02:30:08,272 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 02:30:08,274 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 02:30:08,291 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 02:30:08,291 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 02:30:08,291 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 02:30:08,292 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 02:30:08,293 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 02:30:08,293 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 02:30:08,293 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 02:30:08,294 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 02:30:08,295 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 02:30:08,296 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 02:30:08,296 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 02:30:08,297 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 02:30:08,297 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 02:30:08,297 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 02:30:08,297 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 02:30:08,298 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 02:30:08,298 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 02:30:08,301 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2021-03-11 02:30:08,334 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 02:30:08,335 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 02:30:08,337 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 02:30:08,338 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 02:30:08,338 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 02:30:08,338 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 02:30:08,338 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 02:30:08,338 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 02:30:08,338 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 02:30:08,338 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 02:30:08,339 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 02:30:08,339 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 02:30:08,339 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 02:30:08,339 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 02:30:08,339 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 02:30:08,340 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 02:30:08,340 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 02:30:08,340 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 02:30:08,340 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 02:30:08,340 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 02:30:08,340 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 02:30:08,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 02:30:08,341 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 02:30:08,341 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 02:30:08,341 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 02:30:08,341 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 02:30:08,341 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 02:30:08,341 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-03-11 02:30:08,341 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-11 02:30:08,341 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 02:30:08,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 02:30:08,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 02:30:08,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 02:30:08,623 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 02:30:08,624 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 02:30:08,625 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_power.opt.i [2021-03-11 02:30:08,667 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6476fbeaf/b4024a7d7b6d4d7d8c78a2abe775e4f0/FLAG92395f68e [2021-03-11 02:30:09,060 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 02:30:09,060 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_power.opt.i [2021-03-11 02:30:09,075 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6476fbeaf/b4024a7d7b6d4d7d8c78a2abe775e4f0/FLAG92395f68e [2021-03-11 02:30:09,088 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6476fbeaf/b4024a7d7b6d4d7d8c78a2abe775e4f0 [2021-03-11 02:30:09,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 02:30:09,093 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 02:30:09,093 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 02:30:09,093 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 02:30:09,097 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 02:30:09,097 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 02:30:09" (1/1) ... [2021-03-11 02:30:09,098 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b6ca871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:30:09, skipping insertion in model container [2021-03-11 02:30:09,098 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 02:30:09" (1/1) ... [2021-03-11 02:30:09,105 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 02:30:09,146 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 02:30:09,274 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/safe001_power.opt.i[951,964] [2021-03-11 02:30:09,469 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 02:30:09,474 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 02:30:09,481 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/safe001_power.opt.i[951,964] [2021-03-11 02:30:09,503 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 02:30:09,544 INFO L208 MainTranslator]: Completed translation [2021-03-11 02:30:09,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:30:09 WrapperNode [2021-03-11 02:30:09,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 02:30:09,547 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 02:30:09,547 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 02:30:09,547 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 02:30:09,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:30:09" (1/1) ... [2021-03-11 02:30:09,562 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:30:09" (1/1) ... [2021-03-11 02:30:09,582 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 02:30:09,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 02:30:09,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 02:30:09,582 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 02:30:09,590 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:30:09" (1/1) ... [2021-03-11 02:30:09,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:30:09" (1/1) ... [2021-03-11 02:30:09,593 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:30:09" (1/1) ... [2021-03-11 02:30:09,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:30:09" (1/1) ... [2021-03-11 02:30:09,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:30:09" (1/1) ... [2021-03-11 02:30:09,617 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:30:09" (1/1) ... [2021-03-11 02:30:09,620 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:30:09" (1/1) ... [2021-03-11 02:30:09,628 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 02:30:09,628 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 02:30:09,628 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 02:30:09,628 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 02:30:09,629 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:30:09" (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 02:30:09,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 02:30:09,670 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 02:30:09,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 02:30:09,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 02:30:09,670 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 02:30:09,670 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 02:30:09,670 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 02:30:09,670 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 02:30:09,670 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-11 02:30:09,670 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-11 02:30:09,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 02:30:09,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 02:30:09,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 02:30:09,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 02:30:09,672 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 02:30:10,810 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 02:30:10,811 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 02:30:10,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 02:30:10 BoogieIcfgContainer [2021-03-11 02:30:10,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 02:30:10,813 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 02:30:10,813 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 02:30:10,815 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 02:30:10,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 02:30:09" (1/3) ... [2021-03-11 02:30:10,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d2e9a9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 02:30:10, skipping insertion in model container [2021-03-11 02:30:10,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:30:09" (2/3) ... [2021-03-11 02:30:10,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d2e9a9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 02:30:10, skipping insertion in model container [2021-03-11 02:30:10,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 02:30:10" (3/3) ... [2021-03-11 02:30:10,817 INFO L111 eAbstractionObserver]: Analyzing ICFG safe001_power.opt.i [2021-03-11 02:30:10,821 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 02:30:10,824 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 02:30:10,825 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 02:30:10,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,846 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,846 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,846 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,846 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,848 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,848 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,848 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,848 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,848 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,848 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,848 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,848 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,849 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,849 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,849 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,849 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,849 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,850 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,850 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,850 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,853 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,853 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,853 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,853 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,856 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,856 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,856 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,860 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,860 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,862 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,862 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:30:10,863 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 02:30:10,875 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-11 02:30:10,887 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 02:30:10,888 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-11 02:30:10,888 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 02:30:10,888 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 02:30:10,888 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 02:30:10,888 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 02:30:10,888 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 02:30:10,888 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 02:30:10,895 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-03-11 02:30:10,917 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-11 02:30:10,917 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 02:30:10,919 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 71 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-11 02:30:10,919 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow [2021-03-11 02:30:10,922 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2021-03-11 02:30:10,929 INFO L129 PetriNetUnfolder]: 0/50 cut-off events. [2021-03-11 02:30:10,929 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 02:30:10,929 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:30:10,930 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:30:10,930 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:30:10,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:30:10,933 INFO L82 PathProgramCache]: Analyzing trace with hash 2048644392, now seen corresponding path program 1 times [2021-03-11 02:30:10,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:30:10,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980627019] [2021-03-11 02:30:10,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:30:11,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:30:11,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:11,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:30:11,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:11,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:30:11,086 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 02:30:11,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980627019] [2021-03-11 02:30:11,087 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:30:11,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 02:30:11,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999929012] [2021-03-11 02:30:11,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 02:30:11,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:30:11,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 02:30:11,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 02:30:11,102 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 97 [2021-03-11 02:30:11,105 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 94 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 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 02:30:11,105 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:30:11,105 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 97 [2021-03-11 02:30:11,106 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:30:11,189 INFO L129 PetriNetUnfolder]: 49/379 cut-off events. [2021-03-11 02:30:11,189 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 02:30:11,191 INFO L84 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 379 events. 49/379 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1972 event pairs, 27 based on Foata normal form. 18/374 useless extension candidates. Maximal degree in co-relation 430. Up to 65 conditions per place. [2021-03-11 02:30:11,192 INFO L132 encePairwiseOnDemand]: 92/97 looper letters, 9 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2021-03-11 02:30:11,193 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 94 transitions, 219 flow [2021-03-11 02:30:11,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 02:30:11,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 02:30:11,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 274 transitions. [2021-03-11 02:30:11,201 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9415807560137457 [2021-03-11 02:30:11,201 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 274 transitions. [2021-03-11 02:30:11,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 274 transitions. [2021-03-11 02:30:11,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:30:11,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 274 transitions. [2021-03-11 02:30:11,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 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 02:30:11,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 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 02:30:11,215 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 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 02:30:11,216 INFO L185 Difference]: Start difference. First operand has 102 places, 94 transitions, 197 flow. Second operand 3 states and 274 transitions. [2021-03-11 02:30:11,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 94 transitions, 219 flow [2021-03-11 02:30:11,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 94 transitions, 216 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-11 02:30:11,223 INFO L241 Difference]: Finished difference. Result has 99 places, 90 transitions, 190 flow [2021-03-11 02:30:11,225 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=99, PETRI_TRANSITIONS=90} [2021-03-11 02:30:11,225 INFO L335 CegarLoopForPetriNet]: 102 programPoint places, -3 predicate places. [2021-03-11 02:30:11,225 INFO L480 AbstractCegarLoop]: Abstraction has has 99 places, 90 transitions, 190 flow [2021-03-11 02:30:11,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 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 02:30:11,226 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:30:11,226 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:30:11,226 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 02:30:11,226 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:30:11,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:30:11,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1423014716, now seen corresponding path program 1 times [2021-03-11 02:30:11,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:30:11,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213344122] [2021-03-11 02:30:11,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:30:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:30:11,346 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:11,346 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:30:11,347 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:11,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:30:11,354 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 02:30:11,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 02:30:11,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:11,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:30:11,373 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:11,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:30:11,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:11,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:30:11,382 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 02:30:11,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213344122] [2021-03-11 02:30:11,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:30:11,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 02:30:11,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337011569] [2021-03-11 02:30:11,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 02:30:11,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:30:11,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 02:30:11,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-11 02:30:11,386 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 97 [2021-03-11 02:30:11,386 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 90 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 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 02:30:11,387 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:30:11,387 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 97 [2021-03-11 02:30:11,387 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:30:11,496 INFO L129 PetriNetUnfolder]: 4/127 cut-off events. [2021-03-11 02:30:11,497 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 02:30:11,497 INFO L84 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 127 events. 4/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 194 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 121. Up to 8 conditions per place. [2021-03-11 02:30:11,497 INFO L132 encePairwiseOnDemand]: 91/97 looper letters, 6 selfloop transitions, 2 changer transitions 23/102 dead transitions. [2021-03-11 02:30:11,498 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 102 transitions, 256 flow [2021-03-11 02:30:11,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 02:30:11,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-11 02:30:11,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 788 transitions. [2021-03-11 02:30:11,501 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9026345933562429 [2021-03-11 02:30:11,501 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 788 transitions. [2021-03-11 02:30:11,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 788 transitions. [2021-03-11 02:30:11,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:30:11,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 788 transitions. [2021-03-11 02:30:11,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 87.55555555555556) internal successors, (788), 9 states have internal predecessors, (788), 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 02:30:11,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 97.0) internal successors, (970), 10 states have internal predecessors, (970), 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 02:30:11,505 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 97.0) internal successors, (970), 10 states have internal predecessors, (970), 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 02:30:11,505 INFO L185 Difference]: Start difference. First operand has 99 places, 90 transitions, 190 flow. Second operand 9 states and 788 transitions. [2021-03-11 02:30:11,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 102 transitions, 256 flow [2021-03-11 02:30:11,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 102 transitions, 252 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 02:30:11,507 INFO L241 Difference]: Finished difference. Result has 112 places, 79 transitions, 184 flow [2021-03-11 02:30:11,508 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=184, PETRI_PLACES=112, PETRI_TRANSITIONS=79} [2021-03-11 02:30:11,508 INFO L335 CegarLoopForPetriNet]: 102 programPoint places, 10 predicate places. [2021-03-11 02:30:11,508 INFO L480 AbstractCegarLoop]: Abstraction has has 112 places, 79 transitions, 184 flow [2021-03-11 02:30:11,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 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 02:30:11,508 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:30:11,509 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:30:11,509 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 02:30:11,509 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:30:11,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:30:11,509 INFO L82 PathProgramCache]: Analyzing trace with hash -572951899, now seen corresponding path program 1 times [2021-03-11 02:30:11,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:30:11,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934256204] [2021-03-11 02:30:11,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:30:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:30:11,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:11,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:30:11,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:11,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:30:11,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:11,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:30:11,593 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 02:30:11,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 02:30:11,611 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:11,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:30:11,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:11,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:30:11,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:11,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:30:11,625 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 02:30:11,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934256204] [2021-03-11 02:30:11,626 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:30:11,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 02:30:11,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303262367] [2021-03-11 02:30:11,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 02:30:11,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:30:11,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 02:30:11,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-03-11 02:30:11,627 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 97 [2021-03-11 02:30:11,628 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 79 transitions, 184 flow. Second operand has 7 states, 7 states have (on average 82.28571428571429) internal successors, (576), 7 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:30:11,628 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:30:11,628 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 97 [2021-03-11 02:30:11,628 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:30:11,860 INFO L129 PetriNetUnfolder]: 77/262 cut-off events. [2021-03-11 02:30:11,861 INFO L130 PetriNetUnfolder]: For 59/91 co-relation queries the response was YES. [2021-03-11 02:30:11,863 INFO L84 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 262 events. 77/262 cut-off events. For 59/91 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 993 event pairs, 11 based on Foata normal form. 8/260 useless extension candidates. Maximal degree in co-relation 464. Up to 47 conditions per place. [2021-03-11 02:30:11,864 INFO L132 encePairwiseOnDemand]: 88/97 looper letters, 10 selfloop transitions, 4 changer transitions 30/111 dead transitions. [2021-03-11 02:30:11,864 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 111 transitions, 359 flow [2021-03-11 02:30:11,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-11 02:30:11,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-11 02:30:11,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 856 transitions. [2021-03-11 02:30:11,867 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8824742268041237 [2021-03-11 02:30:11,867 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 856 transitions. [2021-03-11 02:30:11,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 856 transitions. [2021-03-11 02:30:11,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:30:11,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 856 transitions. [2021-03-11 02:30:11,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 85.6) internal successors, (856), 10 states have internal predecessors, (856), 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 02:30:11,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 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 02:30:11,871 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 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 02:30:11,871 INFO L185 Difference]: Start difference. First operand has 112 places, 79 transitions, 184 flow. Second operand 10 states and 856 transitions. [2021-03-11 02:30:11,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 111 transitions, 359 flow [2021-03-11 02:30:11,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 111 transitions, 325 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-03-11 02:30:11,876 INFO L241 Difference]: Finished difference. Result has 104 places, 79 transitions, 206 flow [2021-03-11 02:30:11,876 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=206, PETRI_PLACES=104, PETRI_TRANSITIONS=79} [2021-03-11 02:30:11,876 INFO L335 CegarLoopForPetriNet]: 102 programPoint places, 2 predicate places. [2021-03-11 02:30:11,876 INFO L480 AbstractCegarLoop]: Abstraction has has 104 places, 79 transitions, 206 flow [2021-03-11 02:30:11,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 82.28571428571429) internal successors, (576), 7 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:30:11,877 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:30:11,877 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:30:11,877 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 02:30:11,878 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:30:11,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:30:11,879 INFO L82 PathProgramCache]: Analyzing trace with hash -299793231, now seen corresponding path program 1 times [2021-03-11 02:30:11,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:30:11,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207931771] [2021-03-11 02:30:11,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:30:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:30:12,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:12,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:30:12,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:12,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:30:12,021 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 02:30:12,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 02:30:12,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:12,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:30:12,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:12,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:30:12,047 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:12,047 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:30:12,047 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 02:30:12,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207931771] [2021-03-11 02:30:12,048 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:30:12,048 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 02:30:12,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373102263] [2021-03-11 02:30:12,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 02:30:12,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:30:12,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 02:30:12,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-11 02:30:12,049 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 97 [2021-03-11 02:30:12,050 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 79 transitions, 206 flow. Second operand has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 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 02:30:12,050 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:30:12,050 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 97 [2021-03-11 02:30:12,050 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:30:12,153 INFO L129 PetriNetUnfolder]: 15/141 cut-off events. [2021-03-11 02:30:12,154 INFO L130 PetriNetUnfolder]: For 123/127 co-relation queries the response was YES. [2021-03-11 02:30:12,154 INFO L84 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 141 events. 15/141 cut-off events. For 123/127 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 335 event pairs, 9 based on Foata normal form. 4/141 useless extension candidates. Maximal degree in co-relation 256. Up to 18 conditions per place. [2021-03-11 02:30:12,154 INFO L132 encePairwiseOnDemand]: 91/97 looper letters, 6 selfloop transitions, 2 changer transitions 10/89 dead transitions. [2021-03-11 02:30:12,154 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 89 transitions, 284 flow [2021-03-11 02:30:12,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 02:30:12,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-11 02:30:12,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 785 transitions. [2021-03-11 02:30:12,156 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8991981672394044 [2021-03-11 02:30:12,156 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 785 transitions. [2021-03-11 02:30:12,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 785 transitions. [2021-03-11 02:30:12,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:30:12,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 785 transitions. [2021-03-11 02:30:12,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 87.22222222222223) internal successors, (785), 9 states have internal predecessors, (785), 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 02:30:12,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 97.0) internal successors, (970), 10 states have internal predecessors, (970), 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 02:30:12,164 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 97.0) internal successors, (970), 10 states have internal predecessors, (970), 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 02:30:12,164 INFO L185 Difference]: Start difference. First operand has 104 places, 79 transitions, 206 flow. Second operand 9 states and 785 transitions. [2021-03-11 02:30:12,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 89 transitions, 284 flow [2021-03-11 02:30:12,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 89 transitions, 258 flow, removed 9 selfloop flow, removed 6 redundant places. [2021-03-11 02:30:12,186 INFO L241 Difference]: Finished difference. Result has 107 places, 79 transitions, 210 flow [2021-03-11 02:30:12,186 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=210, PETRI_PLACES=107, PETRI_TRANSITIONS=79} [2021-03-11 02:30:12,186 INFO L335 CegarLoopForPetriNet]: 102 programPoint places, 5 predicate places. [2021-03-11 02:30:12,186 INFO L480 AbstractCegarLoop]: Abstraction has has 107 places, 79 transitions, 210 flow [2021-03-11 02:30:12,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 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 02:30:12,186 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:30:12,187 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:30:12,187 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 02:30:12,187 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:30:12,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:30:12,187 INFO L82 PathProgramCache]: Analyzing trace with hash 6099314, now seen corresponding path program 1 times [2021-03-11 02:30:12,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:30:12,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714459931] [2021-03-11 02:30:12,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:30:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:30:12,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:12,272 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:30:12,273 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:12,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:30:12,276 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:12,276 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:30:12,280 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 02:30:12,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 02:30:12,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:12,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:30:12,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:12,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:30:12,307 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:12,308 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:30:12,308 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 02:30:12,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714459931] [2021-03-11 02:30:12,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:30:12,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 02:30:12,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62766029] [2021-03-11 02:30:12,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 02:30:12,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:30:12,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 02:30:12,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-03-11 02:30:12,311 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 97 [2021-03-11 02:30:12,311 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 79 transitions, 210 flow. Second operand has 7 states, 7 states have (on average 82.57142857142857) internal successors, (578), 7 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:30:12,311 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:30:12,311 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 97 [2021-03-11 02:30:12,311 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:30:12,538 INFO L129 PetriNetUnfolder]: 9/145 cut-off events. [2021-03-11 02:30:12,538 INFO L130 PetriNetUnfolder]: For 163/213 co-relation queries the response was YES. [2021-03-11 02:30:12,539 INFO L84 FinitePrefix]: Finished finitePrefix Result has 315 conditions, 145 events. 9/145 cut-off events. For 163/213 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 377 event pairs, 1 based on Foata normal form. 6/149 useless extension candidates. Maximal degree in co-relation 294. Up to 18 conditions per place. [2021-03-11 02:30:12,539 INFO L132 encePairwiseOnDemand]: 90/97 looper letters, 10 selfloop transitions, 2 changer transitions 24/103 dead transitions. [2021-03-11 02:30:12,540 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 103 transitions, 457 flow [2021-03-11 02:30:12,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-03-11 02:30:12,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-03-11 02:30:12,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1417 transitions. [2021-03-11 02:30:12,545 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8593086719223771 [2021-03-11 02:30:12,545 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1417 transitions. [2021-03-11 02:30:12,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1417 transitions. [2021-03-11 02:30:12,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:30:12,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1417 transitions. [2021-03-11 02:30:12,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 83.3529411764706) internal successors, (1417), 17 states have internal predecessors, (1417), 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 02:30:12,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 97.0) internal successors, (1746), 18 states have internal predecessors, (1746), 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 02:30:12,551 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 97.0) internal successors, (1746), 18 states have internal predecessors, (1746), 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 02:30:12,551 INFO L185 Difference]: Start difference. First operand has 107 places, 79 transitions, 210 flow. Second operand 17 states and 1417 transitions. [2021-03-11 02:30:12,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 103 transitions, 457 flow [2021-03-11 02:30:12,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 103 transitions, 391 flow, removed 30 selfloop flow, removed 8 redundant places. [2021-03-11 02:30:12,554 INFO L241 Difference]: Finished difference. Result has 124 places, 79 transitions, 230 flow [2021-03-11 02:30:12,554 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=230, PETRI_PLACES=124, PETRI_TRANSITIONS=79} [2021-03-11 02:30:12,554 INFO L335 CegarLoopForPetriNet]: 102 programPoint places, 22 predicate places. [2021-03-11 02:30:12,554 INFO L480 AbstractCegarLoop]: Abstraction has has 124 places, 79 transitions, 230 flow [2021-03-11 02:30:12,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 82.57142857142857) internal successors, (578), 7 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:30:12,554 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:30:12,554 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:30:12,555 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 02:30:12,555 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:30:12,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:30:12,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1776528949, now seen corresponding path program 1 times [2021-03-11 02:30:12,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:30:12,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945491746] [2021-03-11 02:30:12,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:30:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:30:12,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:12,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:30:12,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:12,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:30:12,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:12,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 02:30:12,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:12,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 02:30:12,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:12,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 02:30:12,647 INFO L142 QuantifierPusher]: treesize reduction 31, result has 75.2 percent of original size [2021-03-11 02:30:12,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 94 [2021-03-11 02:30:12,672 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 02:30:12,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 02:30:12,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:12,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:30:12,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:12,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:30:12,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:12,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:30:12,700 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 02:30:12,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945491746] [2021-03-11 02:30:12,700 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:30:12,700 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-11 02:30:12,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432983209] [2021-03-11 02:30:12,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-11 02:30:12,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:30:12,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-11 02:30:12,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-03-11 02:30:12,702 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 97 [2021-03-11 02:30:12,703 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 79 transitions, 230 flow. Second operand has 10 states, 10 states have (on average 76.3) internal successors, (763), 10 states have internal predecessors, (763), 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 02:30:12,703 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:30:12,703 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 97 [2021-03-11 02:30:12,703 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:30:12,943 INFO L129 PetriNetUnfolder]: 202/541 cut-off events. [2021-03-11 02:30:12,943 INFO L130 PetriNetUnfolder]: For 1084/1103 co-relation queries the response was YES. [2021-03-11 02:30:12,945 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1335 conditions, 541 events. 202/541 cut-off events. For 1084/1103 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2610 event pairs, 80 based on Foata normal form. 12/532 useless extension candidates. Maximal degree in co-relation 1265. Up to 220 conditions per place. [2021-03-11 02:30:12,947 INFO L132 encePairwiseOnDemand]: 85/97 looper letters, 15 selfloop transitions, 9 changer transitions 28/114 dead transitions. [2021-03-11 02:30:12,947 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 114 transitions, 456 flow [2021-03-11 02:30:12,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-11 02:30:12,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-03-11 02:30:12,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1029 transitions. [2021-03-11 02:30:12,951 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8160190325138779 [2021-03-11 02:30:12,951 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1029 transitions. [2021-03-11 02:30:12,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1029 transitions. [2021-03-11 02:30:12,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:30:12,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1029 transitions. [2021-03-11 02:30:12,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 79.15384615384616) internal successors, (1029), 13 states have internal predecessors, (1029), 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 02:30:12,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 97.0) internal successors, (1358), 14 states have internal predecessors, (1358), 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 02:30:12,957 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 97.0) internal successors, (1358), 14 states have internal predecessors, (1358), 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 02:30:12,957 INFO L185 Difference]: Start difference. First operand has 124 places, 79 transitions, 230 flow. Second operand 13 states and 1029 transitions. [2021-03-11 02:30:12,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 114 transitions, 456 flow [2021-03-11 02:30:12,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 114 transitions, 368 flow, removed 42 selfloop flow, removed 19 redundant places. [2021-03-11 02:30:12,965 INFO L241 Difference]: Finished difference. Result has 111 places, 84 transitions, 255 flow [2021-03-11 02:30:12,965 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=255, PETRI_PLACES=111, PETRI_TRANSITIONS=84} [2021-03-11 02:30:12,965 INFO L335 CegarLoopForPetriNet]: 102 programPoint places, 9 predicate places. [2021-03-11 02:30:12,965 INFO L480 AbstractCegarLoop]: Abstraction has has 111 places, 84 transitions, 255 flow [2021-03-11 02:30:12,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 76.3) internal successors, (763), 10 states have internal predecessors, (763), 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 02:30:12,965 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:30:12,966 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:30:12,966 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 02:30:12,966 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:30:12,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:30:12,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1150634965, now seen corresponding path program 1 times [2021-03-11 02:30:12,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:30:12,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107837983] [2021-03-11 02:30:12,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:30:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:30:13,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:13,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:30:13,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:13,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:30:13,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:13,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:30:13,079 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 02:30:13,082 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 02:30:13,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:13,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:30:13,100 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:13,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:30:13,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:13,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:30:13,107 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 02:30:13,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107837983] [2021-03-11 02:30:13,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:30:13,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 02:30:13,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903538528] [2021-03-11 02:30:13,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 02:30:13,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:30:13,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 02:30:13,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-03-11 02:30:13,110 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 97 [2021-03-11 02:30:13,111 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 84 transitions, 255 flow. Second operand has 7 states, 7 states have (on average 82.71428571428571) internal successors, (579), 7 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:30:13,111 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:30:13,111 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 97 [2021-03-11 02:30:13,111 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:30:13,194 INFO L129 PetriNetUnfolder]: 51/271 cut-off events. [2021-03-11 02:30:13,195 INFO L130 PetriNetUnfolder]: For 536/583 co-relation queries the response was YES. [2021-03-11 02:30:13,196 INFO L84 FinitePrefix]: Finished finitePrefix Result has 767 conditions, 271 events. 51/271 cut-off events. For 536/583 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1204 event pairs, 37 based on Foata normal form. 11/276 useless extension candidates. Maximal degree in co-relation 705. Up to 75 conditions per place. [2021-03-11 02:30:13,196 INFO L132 encePairwiseOnDemand]: 89/97 looper letters, 8 selfloop transitions, 4 changer transitions 7/89 dead transitions. [2021-03-11 02:30:13,197 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 89 transitions, 320 flow [2021-03-11 02:30:13,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 02:30:13,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 02:30:13,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 585 transitions. [2021-03-11 02:30:13,198 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8615611192930781 [2021-03-11 02:30:13,198 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 585 transitions. [2021-03-11 02:30:13,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 585 transitions. [2021-03-11 02:30:13,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:30:13,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 585 transitions. [2021-03-11 02:30:13,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 83.57142857142857) internal successors, (585), 7 states have internal predecessors, (585), 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 02:30:13,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 97.0) internal successors, (776), 8 states have internal predecessors, (776), 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 02:30:13,201 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 97.0) internal successors, (776), 8 states have internal predecessors, (776), 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 02:30:13,201 INFO L185 Difference]: Start difference. First operand has 111 places, 84 transitions, 255 flow. Second operand 7 states and 585 transitions. [2021-03-11 02:30:13,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 89 transitions, 320 flow [2021-03-11 02:30:13,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 89 transitions, 298 flow, removed 7 selfloop flow, removed 7 redundant places. [2021-03-11 02:30:13,204 INFO L241 Difference]: Finished difference. Result has 108 places, 82 transitions, 250 flow [2021-03-11 02:30:13,204 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=250, PETRI_PLACES=108, PETRI_TRANSITIONS=82} [2021-03-11 02:30:13,204 INFO L335 CegarLoopForPetriNet]: 102 programPoint places, 6 predicate places. [2021-03-11 02:30:13,204 INFO L480 AbstractCegarLoop]: Abstraction has has 108 places, 82 transitions, 250 flow [2021-03-11 02:30:13,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 82.71428571428571) internal successors, (579), 7 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:30:13,205 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:30:13,205 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:30:13,205 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 02:30:13,205 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:30:13,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:30:13,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1610772663, now seen corresponding path program 2 times [2021-03-11 02:30:13,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:30:13,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198295564] [2021-03-11 02:30:13,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:30:13,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:30:13,286 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:13,287 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:30:13,287 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:13,287 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:30:13,289 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:13,290 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 02:30:13,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:13,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 02:30:13,300 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.8 percent of original size [2021-03-11 02:30:13,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-03-11 02:30:13,315 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.6 percent of original size [2021-03-11 02:30:13,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2021-03-11 02:30:13,335 INFO L142 QuantifierPusher]: treesize reduction 21, result has 75.3 percent of original size [2021-03-11 02:30:13,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 64 [2021-03-11 02:30:13,367 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 02:30:13,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 02:30:13,380 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:13,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:30:13,387 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:13,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:30:13,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:13,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:30:13,397 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 02:30:13,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198295564] [2021-03-11 02:30:13,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:30:13,398 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-11 02:30:13,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061244642] [2021-03-11 02:30:13,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-11 02:30:13,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:30:13,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-11 02:30:13,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-03-11 02:30:13,399 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 97 [2021-03-11 02:30:13,400 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 82 transitions, 250 flow. Second operand has 11 states, 11 states have (on average 75.36363636363636) internal successors, (829), 11 states have internal predecessors, (829), 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 02:30:13,400 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:30:13,400 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 97 [2021-03-11 02:30:13,400 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:30:13,736 INFO L129 PetriNetUnfolder]: 190/486 cut-off events. [2021-03-11 02:30:13,737 INFO L130 PetriNetUnfolder]: For 1118/1139 co-relation queries the response was YES. [2021-03-11 02:30:13,738 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1551 conditions, 486 events. 190/486 cut-off events. For 1118/1139 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2224 event pairs, 32 based on Foata normal form. 11/493 useless extension candidates. Maximal degree in co-relation 1484. Up to 185 conditions per place. [2021-03-11 02:30:13,741 INFO L132 encePairwiseOnDemand]: 85/97 looper letters, 21 selfloop transitions, 9 changer transitions 25/116 dead transitions. [2021-03-11 02:30:13,741 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 116 transitions, 578 flow [2021-03-11 02:30:13,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-11 02:30:13,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-03-11 02:30:13,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1016 transitions. [2021-03-11 02:30:13,743 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8057097541633624 [2021-03-11 02:30:13,743 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1016 transitions. [2021-03-11 02:30:13,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1016 transitions. [2021-03-11 02:30:13,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:30:13,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1016 transitions. [2021-03-11 02:30:13,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 78.15384615384616) internal successors, (1016), 13 states have internal predecessors, (1016), 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 02:30:13,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 97.0) internal successors, (1358), 14 states have internal predecessors, (1358), 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 02:30:13,747 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 97.0) internal successors, (1358), 14 states have internal predecessors, (1358), 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 02:30:13,747 INFO L185 Difference]: Start difference. First operand has 108 places, 82 transitions, 250 flow. Second operand 13 states and 1016 transitions. [2021-03-11 02:30:13,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 116 transitions, 578 flow [2021-03-11 02:30:13,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 116 transitions, 532 flow, removed 16 selfloop flow, removed 9 redundant places. [2021-03-11 02:30:13,752 INFO L241 Difference]: Finished difference. Result has 115 places, 85 transitions, 307 flow [2021-03-11 02:30:13,752 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=307, PETRI_PLACES=115, PETRI_TRANSITIONS=85} [2021-03-11 02:30:13,752 INFO L335 CegarLoopForPetriNet]: 102 programPoint places, 13 predicate places. [2021-03-11 02:30:13,752 INFO L480 AbstractCegarLoop]: Abstraction has has 115 places, 85 transitions, 307 flow [2021-03-11 02:30:13,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 75.36363636363636) internal successors, (829), 11 states have internal predecessors, (829), 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 02:30:13,753 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:30:13,753 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:30:13,753 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 02:30:13,754 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:30:13,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:30:13,754 INFO L82 PathProgramCache]: Analyzing trace with hash -7376904, now seen corresponding path program 1 times [2021-03-11 02:30:13,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:30:13,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53348064] [2021-03-11 02:30:13,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:30:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:30:13,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:13,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:30:13,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:13,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:30:13,814 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-03-11 02:30:13,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-11 02:30:13,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:13,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 02:30:13,830 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 02:30:13,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:30:13,836 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:13,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:30:13,839 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 02:30:13,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53348064] [2021-03-11 02:30:13,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:30:13,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 02:30:13,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546564229] [2021-03-11 02:30:13,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 02:30:13,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:30:13,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 02:30:13,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-11 02:30:13,841 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 97 [2021-03-11 02:30:13,842 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 85 transitions, 307 flow. Second operand has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 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 02:30:13,842 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:30:13,842 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 97 [2021-03-11 02:30:13,842 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:30:14,011 INFO L129 PetriNetUnfolder]: 263/823 cut-off events. [2021-03-11 02:30:14,012 INFO L130 PetriNetUnfolder]: For 1653/1695 co-relation queries the response was YES. [2021-03-11 02:30:14,015 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2102 conditions, 823 events. 263/823 cut-off events. For 1653/1695 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5667 event pairs, 70 based on Foata normal form. 33/808 useless extension candidates. Maximal degree in co-relation 2039. Up to 172 conditions per place. [2021-03-11 02:30:14,018 INFO L132 encePairwiseOnDemand]: 88/97 looper letters, 19 selfloop transitions, 16 changer transitions 0/110 dead transitions. [2021-03-11 02:30:14,019 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 110 transitions, 427 flow [2021-03-11 02:30:14,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 02:30:14,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-11 02:30:14,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 784 transitions. [2021-03-11 02:30:14,020 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8980526918671249 [2021-03-11 02:30:14,021 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 784 transitions. [2021-03-11 02:30:14,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 784 transitions. [2021-03-11 02:30:14,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:30:14,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 784 transitions. [2021-03-11 02:30:14,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 87.11111111111111) internal successors, (784), 9 states have internal predecessors, (784), 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 02:30:14,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 97.0) internal successors, (970), 10 states have internal predecessors, (970), 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 02:30:14,024 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 97.0) internal successors, (970), 10 states have internal predecessors, (970), 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 02:30:14,024 INFO L185 Difference]: Start difference. First operand has 115 places, 85 transitions, 307 flow. Second operand 9 states and 784 transitions. [2021-03-11 02:30:14,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 110 transitions, 427 flow [2021-03-11 02:30:14,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 110 transitions, 404 flow, removed 5 selfloop flow, removed 8 redundant places. [2021-03-11 02:30:14,027 INFO L241 Difference]: Finished difference. Result has 114 places, 99 transitions, 395 flow [2021-03-11 02:30:14,027 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=395, PETRI_PLACES=114, PETRI_TRANSITIONS=99} [2021-03-11 02:30:14,027 INFO L335 CegarLoopForPetriNet]: 102 programPoint places, 12 predicate places. [2021-03-11 02:30:14,028 INFO L480 AbstractCegarLoop]: Abstraction has has 114 places, 99 transitions, 395 flow [2021-03-11 02:30:14,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 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 02:30:14,028 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:30:14,028 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:30:14,028 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 02:30:14,028 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:30:14,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:30:14,028 INFO L82 PathProgramCache]: Analyzing trace with hash 2095935208, now seen corresponding path program 1 times [2021-03-11 02:30:14,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:30:14,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745442288] [2021-03-11 02:30:14,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:30:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:30:14,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:14,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:30:14,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:14,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:30:14,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:14,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:30:14,092 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-03-11 02:30:14,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-11 02:30:14,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:14,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 02:30:14,108 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 02:30:14,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:30:14,115 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:14,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:30:14,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 02:30:14,119 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745442288] [2021-03-11 02:30:14,119 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:30:14,119 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 02:30:14,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164891700] [2021-03-11 02:30:14,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 02:30:14,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:30:14,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 02:30:14,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-11 02:30:14,120 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 97 [2021-03-11 02:30:14,121 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 99 transitions, 395 flow. Second operand has 7 states, 7 states have (on average 84.14285714285714) internal successors, (589), 7 states have internal predecessors, (589), 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 02:30:14,121 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:30:14,121 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 97 [2021-03-11 02:30:14,121 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:30:14,291 INFO L129 PetriNetUnfolder]: 184/698 cut-off events. [2021-03-11 02:30:14,291 INFO L130 PetriNetUnfolder]: For 1346/1750 co-relation queries the response was YES. [2021-03-11 02:30:14,294 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2056 conditions, 698 events. 184/698 cut-off events. For 1346/1750 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4946 event pairs, 6 based on Foata normal form. 131/789 useless extension candidates. Maximal degree in co-relation 1992. Up to 173 conditions per place. [2021-03-11 02:30:14,296 INFO L132 encePairwiseOnDemand]: 88/97 looper letters, 15 selfloop transitions, 31 changer transitions 6/127 dead transitions. [2021-03-11 02:30:14,296 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 127 transitions, 680 flow [2021-03-11 02:30:14,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-11 02:30:14,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-03-11 02:30:14,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1046 transitions. [2021-03-11 02:30:14,298 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8986254295532646 [2021-03-11 02:30:14,298 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1046 transitions. [2021-03-11 02:30:14,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1046 transitions. [2021-03-11 02:30:14,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:30:14,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1046 transitions. [2021-03-11 02:30:14,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 87.16666666666667) internal successors, (1046), 12 states have internal predecessors, (1046), 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 02:30:14,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 97.0) internal successors, (1261), 13 states have internal predecessors, (1261), 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 02:30:14,303 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 97.0) internal successors, (1261), 13 states have internal predecessors, (1261), 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 02:30:14,303 INFO L185 Difference]: Start difference. First operand has 114 places, 99 transitions, 395 flow. Second operand 12 states and 1046 transitions. [2021-03-11 02:30:14,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 127 transitions, 680 flow [2021-03-11 02:30:14,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 127 transitions, 678 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-11 02:30:14,307 INFO L241 Difference]: Finished difference. Result has 127 places, 118 transitions, 623 flow [2021-03-11 02:30:14,308 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=623, PETRI_PLACES=127, PETRI_TRANSITIONS=118} [2021-03-11 02:30:14,308 INFO L335 CegarLoopForPetriNet]: 102 programPoint places, 25 predicate places. [2021-03-11 02:30:14,308 INFO L480 AbstractCegarLoop]: Abstraction has has 127 places, 118 transitions, 623 flow [2021-03-11 02:30:14,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 84.14285714285714) internal successors, (589), 7 states have internal predecessors, (589), 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 02:30:14,308 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:30:14,308 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:30:14,308 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 02:30:14,308 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:30:14,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:30:14,309 INFO L82 PathProgramCache]: Analyzing trace with hash -933011017, now seen corresponding path program 1 times [2021-03-11 02:30:14,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:30:14,309 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996798229] [2021-03-11 02:30:14,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:30:14,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:30:14,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:14,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:30:14,379 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:14,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:30:14,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:14,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:30:14,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:14,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:30:14,393 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-03-11 02:30:14,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-11 02:30:14,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:14,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 02:30:14,411 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 02:30:14,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:30:14,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:14,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:30:14,418 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 02:30:14,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996798229] [2021-03-11 02:30:14,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:30:14,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-11 02:30:14,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702608502] [2021-03-11 02:30:14,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-11 02:30:14,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:30:14,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-11 02:30:14,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-11 02:30:14,420 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 97 [2021-03-11 02:30:14,420 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 118 transitions, 623 flow. Second operand has 8 states, 8 states have (on average 84.125) internal successors, (673), 8 states have internal predecessors, (673), 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 02:30:14,420 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:30:14,420 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 97 [2021-03-11 02:30:14,420 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:30:14,626 INFO L129 PetriNetUnfolder]: 148/611 cut-off events. [2021-03-11 02:30:14,626 INFO L130 PetriNetUnfolder]: For 2060/2713 co-relation queries the response was YES. [2021-03-11 02:30:14,629 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2056 conditions, 611 events. 148/611 cut-off events. For 2060/2713 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4540 event pairs, 1 based on Foata normal form. 139/711 useless extension candidates. Maximal degree in co-relation 1987. Up to 151 conditions per place. [2021-03-11 02:30:14,631 INFO L132 encePairwiseOnDemand]: 88/97 looper letters, 10 selfloop transitions, 36 changer transitions 16/137 dead transitions. [2021-03-11 02:30:14,631 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 137 transitions, 877 flow [2021-03-11 02:30:14,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-11 02:30:14,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-03-11 02:30:14,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1296 transitions. [2021-03-11 02:30:14,634 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8907216494845361 [2021-03-11 02:30:14,634 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1296 transitions. [2021-03-11 02:30:14,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1296 transitions. [2021-03-11 02:30:14,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:30:14,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1296 transitions. [2021-03-11 02:30:14,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 86.4) internal successors, (1296), 15 states have internal predecessors, (1296), 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 02:30:14,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 97.0) internal successors, (1552), 16 states have internal predecessors, (1552), 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 02:30:14,641 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 97.0) internal successors, (1552), 16 states have internal predecessors, (1552), 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 02:30:14,641 INFO L185 Difference]: Start difference. First operand has 127 places, 118 transitions, 623 flow. Second operand 15 states and 1296 transitions. [2021-03-11 02:30:14,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 137 transitions, 877 flow [2021-03-11 02:30:14,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 137 transitions, 699 flow, removed 75 selfloop flow, removed 7 redundant places. [2021-03-11 02:30:14,648 INFO L241 Difference]: Finished difference. Result has 140 places, 118 transitions, 589 flow [2021-03-11 02:30:14,648 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=589, PETRI_PLACES=140, PETRI_TRANSITIONS=118} [2021-03-11 02:30:14,648 INFO L335 CegarLoopForPetriNet]: 102 programPoint places, 38 predicate places. [2021-03-11 02:30:14,648 INFO L480 AbstractCegarLoop]: Abstraction has has 140 places, 118 transitions, 589 flow [2021-03-11 02:30:14,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 84.125) internal successors, (673), 8 states have internal predecessors, (673), 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 02:30:14,648 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:30:14,648 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:30:14,649 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-11 02:30:14,649 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:30:14,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:30:14,649 INFO L82 PathProgramCache]: Analyzing trace with hash -737820586, now seen corresponding path program 1 times [2021-03-11 02:30:14,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:30:14,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256747057] [2021-03-11 02:30:14,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:30:14,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:30:14,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:14,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:30:14,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:14,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:30:14,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:14,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 02:30:14,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:14,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 02:30:14,761 INFO L142 QuantifierPusher]: treesize reduction 10, result has 76.7 percent of original size [2021-03-11 02:30:14,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-11 02:30:14,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:14,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-11 02:30:14,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:14,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-11 02:30:14,827 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:14,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-11 02:30:14,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:14,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 02:30:14,854 INFO L142 QuantifierPusher]: treesize reduction 17, result has 70.7 percent of original size [2021-03-11 02:30:14,856 INFO L147 QuantifierPusher]: treesize reduction 9, result has 78.0 percent of original size 32 [2021-03-11 02:30:14,874 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 02:30:14,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 02:30:14,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:14,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:30:14,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:14,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:30:14,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:30:14,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:30:14,907 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 02:30:14,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256747057] [2021-03-11 02:30:14,907 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:30:14,907 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-03-11 02:30:14,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891969621] [2021-03-11 02:30:14,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-03-11 02:30:14,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:30:14,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-03-11 02:30:14,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-03-11 02:30:14,909 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 97 [2021-03-11 02:30:14,912 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 118 transitions, 589 flow. Second operand has 14 states, 14 states have (on average 71.57142857142857) internal successors, (1002), 14 states have internal predecessors, (1002), 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 02:30:14,912 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:30:14,912 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 97 [2021-03-11 02:30:14,912 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:30:15,128 INFO L129 PetriNetUnfolder]: 158/706 cut-off events. [2021-03-11 02:30:15,128 INFO L130 PetriNetUnfolder]: For 1457/1528 co-relation queries the response was YES. [2021-03-11 02:30:15,131 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2000 conditions, 706 events. 158/706 cut-off events. For 1457/1528 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 5674 event pairs, 0 based on Foata normal form. 4/678 useless extension candidates. Maximal degree in co-relation 1936. Up to 79 conditions per place. [2021-03-11 02:30:15,133 INFO L132 encePairwiseOnDemand]: 87/97 looper letters, 23 selfloop transitions, 6 changer transitions 11/130 dead transitions. [2021-03-11 02:30:15,133 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 130 transitions, 749 flow [2021-03-11 02:30:15,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-11 02:30:15,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-11 02:30:15,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 803 transitions. [2021-03-11 02:30:15,135 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7525773195876289 [2021-03-11 02:30:15,135 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 803 transitions. [2021-03-11 02:30:15,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 803 transitions. [2021-03-11 02:30:15,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:30:15,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 803 transitions. [2021-03-11 02:30:15,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 73.0) internal successors, (803), 11 states have internal predecessors, (803), 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 02:30:15,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 97.0) internal successors, (1164), 12 states have internal predecessors, (1164), 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 02:30:15,138 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 97.0) internal successors, (1164), 12 states have internal predecessors, (1164), 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 02:30:15,139 INFO L185 Difference]: Start difference. First operand has 140 places, 118 transitions, 589 flow. Second operand 11 states and 803 transitions. [2021-03-11 02:30:15,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 130 transitions, 749 flow [2021-03-11 02:30:15,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 130 transitions, 626 flow, removed 37 selfloop flow, removed 17 redundant places. [2021-03-11 02:30:15,146 INFO L241 Difference]: Finished difference. Result has 136 places, 117 transitions, 521 flow [2021-03-11 02:30:15,146 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=521, PETRI_PLACES=136, PETRI_TRANSITIONS=117} [2021-03-11 02:30:15,146 INFO L335 CegarLoopForPetriNet]: 102 programPoint places, 34 predicate places. [2021-03-11 02:30:15,146 INFO L480 AbstractCegarLoop]: Abstraction has has 136 places, 117 transitions, 521 flow [2021-03-11 02:30:15,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 71.57142857142857) internal successors, (1002), 14 states have internal predecessors, (1002), 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 02:30:15,146 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:30:15,147 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:30:15,147 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-11 02:30:15,147 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:30:15,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:30:15,147 INFO L82 PathProgramCache]: Analyzing trace with hash -255152524, now seen corresponding path program 2 times [2021-03-11 02:30:15,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:30:15,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55888688] [2021-03-11 02:30:15,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:30:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 02:30:15,178 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 02:30:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 02:30:15,214 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 02:30:15,252 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 02:30:15,252 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 02:30:15,252 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-11 02:30:15,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 02:30:15 BasicIcfg [2021-03-11 02:30:15,378 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 02:30:15,379 INFO L168 Benchmark]: Toolchain (without parser) took 6288.34 ms. Allocated memory was 255.9 MB in the beginning and 532.7 MB in the end (delta: 276.8 MB). Free memory was 235.8 MB in the beginning and 351.6 MB in the end (delta: -115.8 MB). Peak memory consumption was 160.4 MB. Max. memory is 16.0 GB. [2021-03-11 02:30:15,380 INFO L168 Benchmark]: CDTParser took 0.08 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 02:30:15,381 INFO L168 Benchmark]: CACSL2BoogieTranslator took 452.68 ms. Allocated memory was 255.9 MB in the beginning and 339.7 MB in the end (delta: 83.9 MB). Free memory was 234.9 MB in the beginning and 300.7 MB in the end (delta: -65.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-11 02:30:15,383 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.24 ms. Allocated memory is still 339.7 MB. Free memory was 300.7 MB in the beginning and 297.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 02:30:15,383 INFO L168 Benchmark]: Boogie Preprocessor took 45.52 ms. Allocated memory is still 339.7 MB. Free memory was 297.9 MB in the beginning and 295.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-11 02:30:15,383 INFO L168 Benchmark]: RCFGBuilder took 1183.70 ms. Allocated memory was 339.7 MB in the beginning and 408.9 MB in the end (delta: 69.2 MB). Free memory was 295.5 MB in the beginning and 377.0 MB in the end (delta: -81.5 MB). Peak memory consumption was 64.5 MB. Max. memory is 16.0 GB. [2021-03-11 02:30:15,383 INFO L168 Benchmark]: TraceAbstraction took 4565.12 ms. Allocated memory was 408.9 MB in the beginning and 532.7 MB in the end (delta: 123.7 MB). Free memory was 375.9 MB in the beginning and 351.6 MB in the end (delta: 24.3 MB). Peak memory consumption was 149.1 MB. Max. memory is 16.0 GB. [2021-03-11 02:30:15,386 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.08 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 452.68 ms. Allocated memory was 255.9 MB in the beginning and 339.7 MB in the end (delta: 83.9 MB). Free memory was 234.9 MB in the beginning and 300.7 MB in the end (delta: -65.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 35.24 ms. Allocated memory is still 339.7 MB. Free memory was 300.7 MB in the beginning and 297.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 45.52 ms. Allocated memory is still 339.7 MB. Free memory was 297.9 MB in the beginning and 295.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1183.70 ms. Allocated memory was 339.7 MB in the beginning and 408.9 MB in the end (delta: 69.2 MB). Free memory was 295.5 MB in the beginning and 377.0 MB in the end (delta: -81.5 MB). Peak memory consumption was 64.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 4565.12 ms. Allocated memory was 408.9 MB in the beginning and 532.7 MB in the end (delta: 123.7 MB). Free memory was 375.9 MB in the beginning and 351.6 MB in the end (delta: 24.3 MB). Peak memory consumption was 149.1 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L718] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L719] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L720] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L721] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L722] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L723] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L724] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L725] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L726] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L727] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L728] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L729] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_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}] [L730] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_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] [L731] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_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] [L732] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_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] [L733] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_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] [L735] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_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] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_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] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L818] 0 pthread_t t1804; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L819] FCALL, FORK 0 pthread_create(&t1804, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L820] 0 pthread_t t1805; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L821] FCALL, FORK 0 pthread_create(&t1805, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L822] 0 pthread_t t1806; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L823] FCALL, FORK 0 pthread_create(&t1806, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __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=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L776] 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) [L776] 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) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 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 [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L780] 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 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] 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) [L796] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L796] 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) [L796] 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) [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 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 [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L800] 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 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=2, __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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] 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) [L829] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L829] 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) [L829] 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) [L830] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 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 [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L833] 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 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __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=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __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=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __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=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, 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: 6.5ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 4368.0ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2437.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 34.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 117 SDtfs, 327 SDslu, 378 SDs, 0 SdLazy, 642 SolverSat, 199 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 570.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1283.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=623occurred in iteration=10, InterpolantAutomatonStates: 128, 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: 42.5ms SsaConstructionTime, 437.3ms SatisfiabilityAnalysisTime, 1168.6ms InterpolantComputationTime, 840 NumberOfCodeBlocks, 840 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 755 ConstructedInterpolants, 0 QuantifiedInterpolants, 3396 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...