/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix007_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 19:59:41,412 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 19:59:41,414 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 19:59:41,451 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 19:59:41,452 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 19:59:41,455 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 19:59:41,457 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 19:59:41,463 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 19:59:41,465 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 19:59:41,469 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 19:59:41,470 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 19:59:41,471 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 19:59:41,472 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 19:59:41,473 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 19:59:41,475 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 19:59:41,476 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 19:59:41,478 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 19:59:41,479 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 19:59:41,481 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 19:59:41,489 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 19:59:41,490 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 19:59:41,491 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 19:59:41,492 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 19:59:41,494 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 19:59:41,499 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 19:59:41,500 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 19:59:41,500 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 19:59:41,501 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 19:59:41,502 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 19:59:41,502 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 19:59:41,503 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 19:59:41,503 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 19:59:41,505 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 19:59:41,505 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 19:59:41,506 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 19:59:41,506 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 19:59:41,507 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 19:59:41,507 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 19:59:41,507 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 19:59:41,508 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 19:59:41,508 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 19:59:41,509 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2021-03-11 19:59:41,543 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 19:59:41,544 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 19:59:41,547 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 19:59:41,547 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 19:59:41,547 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 19:59:41,547 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 19:59:41,547 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 19:59:41,548 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 19:59:41,548 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 19:59:41,548 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 19:59:41,549 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 19:59:41,549 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 19:59:41,549 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 19:59:41,549 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 19:59:41,549 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 19:59:41,549 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 19:59:41,550 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 19:59:41,550 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 19:59:41,550 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 19:59:41,550 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 19:59:41,550 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 19:59:41,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 19:59:41,551 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 19:59:41,551 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 19:59:41,551 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 19:59:41,551 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 19:59:41,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 19:59:41,551 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-11 19:59:41,551 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 19:59:41,849 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 19:59:41,879 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 19:59:41,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 19:59:41,883 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 19:59:41,883 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 19:59:41,884 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix007_pso.oepc.i [2021-03-11 19:59:41,941 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ea0287f8/ad42ef6f40e44dea9e0a666b4a32322e/FLAG7f3b4e903 [2021-03-11 19:59:42,524 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 19:59:42,524 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix007_pso.oepc.i [2021-03-11 19:59:42,541 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ea0287f8/ad42ef6f40e44dea9e0a666b4a32322e/FLAG7f3b4e903 [2021-03-11 19:59:42,926 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ea0287f8/ad42ef6f40e44dea9e0a666b4a32322e [2021-03-11 19:59:42,928 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 19:59:42,932 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 19:59:42,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 19:59:42,933 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 19:59:42,939 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 19:59:42,940 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 07:59:42" (1/1) ... [2021-03-11 19:59:42,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e0c996c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:59:42, skipping insertion in model container [2021-03-11 19:59:42,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 07:59:42" (1/1) ... [2021-03-11 19:59:42,946 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 19:59:42,993 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 19:59:43,141 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/mix007_pso.oepc.i[949,962] [2021-03-11 19:59:43,337 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 19:59:43,344 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 19:59:43,356 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/mix007_pso.oepc.i[949,962] [2021-03-11 19:59:43,418 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 19:59:43,488 INFO L208 MainTranslator]: Completed translation [2021-03-11 19:59:43,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:59:43 WrapperNode [2021-03-11 19:59:43,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 19:59:43,491 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 19:59:43,491 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 19:59:43,492 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 19:59:43,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:59:43" (1/1) ... [2021-03-11 19:59:43,531 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:59:43" (1/1) ... [2021-03-11 19:59:43,564 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 19:59:43,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 19:59:43,565 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 19:59:43,565 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 19:59:43,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:59:43" (1/1) ... [2021-03-11 19:59:43,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:59:43" (1/1) ... [2021-03-11 19:59:43,580 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:59:43" (1/1) ... [2021-03-11 19:59:43,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:59:43" (1/1) ... [2021-03-11 19:59:43,599 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:59:43" (1/1) ... [2021-03-11 19:59:43,603 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:59:43" (1/1) ... [2021-03-11 19:59:43,606 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:59:43" (1/1) ... [2021-03-11 19:59:43,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 19:59:43,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 19:59:43,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 19:59:43,610 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 19:59:43,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:59:43" (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 19:59:43,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 19:59:43,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 19:59:43,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 19:59:43,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 19:59:43,685 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 19:59:43,685 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 19:59:43,685 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 19:59:43,685 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 19:59:43,685 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-11 19:59:43,685 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-11 19:59:43,685 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-11 19:59:43,685 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-11 19:59:43,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 19:59:43,686 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 19:59:43,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 19:59:43,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 19:59:43,687 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 19:59:45,535 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 19:59:45,535 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 19:59:45,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 07:59:45 BoogieIcfgContainer [2021-03-11 19:59:45,537 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 19:59:45,538 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 19:59:45,538 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 19:59:45,541 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 19:59:45,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 07:59:42" (1/3) ... [2021-03-11 19:59:45,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d8a94f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 07:59:45, skipping insertion in model container [2021-03-11 19:59:45,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:59:43" (2/3) ... [2021-03-11 19:59:45,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d8a94f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 07:59:45, skipping insertion in model container [2021-03-11 19:59:45,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 07:59:45" (3/3) ... [2021-03-11 19:59:45,543 INFO L111 eAbstractionObserver]: Analyzing ICFG mix007_pso.oepc.i [2021-03-11 19:59:45,548 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 19:59:45,552 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 19:59:45,553 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 19:59:45,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,590 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,590 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,590 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,591 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,591 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,591 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,591 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,592 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,596 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,596 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,596 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,596 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,600 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,600 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,600 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,600 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,604 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,604 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,604 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,604 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,604 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,604 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,604 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,604 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,605 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,605 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,605 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,605 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,605 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,605 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,605 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,606 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,606 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,606 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,606 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,606 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,606 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,606 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,606 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,607 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,607 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,607 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,607 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,607 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,607 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,607 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,607 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,607 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,608 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,608 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,608 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,608 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,608 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,608 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,608 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,608 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,608 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,609 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,609 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,609 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,609 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,609 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,611 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,611 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,611 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,611 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,611 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,611 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,612 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,612 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,612 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,612 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,612 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,612 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,612 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,612 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,612 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,613 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,613 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,613 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,613 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,613 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,613 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,613 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,613 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,613 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,613 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,614 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,614 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,614 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,614 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,614 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,614 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,614 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,614 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,615 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,615 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,615 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,615 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,615 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,617 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,617 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,617 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,617 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,617 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,617 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,618 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,618 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,618 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,618 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,618 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,618 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,619 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,619 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,619 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,619 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,619 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,619 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,621 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,621 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,622 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,622 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,622 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,622 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,622 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,622 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,622 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,623 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,623 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,623 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,623 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,623 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,623 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,623 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,623 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,624 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,624 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,624 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,624 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,624 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,624 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,624 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,624 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,625 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,625 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,625 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,625 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,625 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,625 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,625 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,626 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,629 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,629 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,629 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,630 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,630 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,630 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,631 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,631 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,631 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,631 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,631 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,631 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,631 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,633 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,633 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:45,635 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 19:59:45,651 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-11 19:59:45,668 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 19:59:45,669 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-11 19:59:45,669 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 19:59:45,669 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 19:59:45,669 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 19:59:45,669 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 19:59:45,669 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 19:59:45,669 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 19:59:45,679 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 131 places, 120 transitions, 260 flow [2021-03-11 19:59:45,717 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2021-03-11 19:59:45,718 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 19:59:45,722 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 93 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-11 19:59:45,722 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 120 transitions, 260 flow [2021-03-11 19:59:45,726 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 116 transitions, 244 flow [2021-03-11 19:59:45,729 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 19:59:45,740 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 116 transitions, 244 flow [2021-03-11 19:59:45,742 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 116 transitions, 244 flow [2021-03-11 19:59:45,743 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 116 transitions, 244 flow [2021-03-11 19:59:45,762 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2021-03-11 19:59:45,762 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 19:59:45,763 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 96 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-11 19:59:45,765 INFO L116 LiptonReduction]: Number of co-enabled transitions 2886 [2021-03-11 19:59:46,094 WARN L205 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-11 19:59:46,546 WARN L205 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-11 19:59:46,671 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-11 19:59:50,746 WARN L205 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-11 19:59:50,919 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-11 19:59:51,331 WARN L205 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-11 19:59:51,489 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-11 19:59:51,518 INFO L131 LiptonReduction]: Checked pairs total: 8480 [2021-03-11 19:59:51,518 INFO L133 LiptonReduction]: Total number of compositions: 97 [2021-03-11 19:59:51,520 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5793 [2021-03-11 19:59:51,526 INFO L129 PetriNetUnfolder]: 0/4 cut-off events. [2021-03-11 19:59:51,526 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 19:59:51,526 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:59:51,527 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2021-03-11 19:59:51,527 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:59:51,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:59:51,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1219255, now seen corresponding path program 1 times [2021-03-11 19:59:51,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:59:51,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710024265] [2021-03-11 19:59:51,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:59:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:59:51,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:51,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:51,769 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 19:59:51,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710024265] [2021-03-11 19:59:51,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:59:51,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 19:59:51,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468858957] [2021-03-11 19:59:51,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 19:59:51,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:59:51,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 19:59:51,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 19:59:51,791 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 217 [2021-03-11 19:59:51,796 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 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 19:59:51,796 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:59:51,796 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 217 [2021-03-11 19:59:51,797 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:59:51,893 INFO L129 PetriNetUnfolder]: 133/305 cut-off events. [2021-03-11 19:59:51,893 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 19:59:51,895 INFO L84 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 305 events. 133/305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1590 event pairs, 110 based on Foata normal form. 33/319 useless extension candidates. Maximal degree in co-relation 513. Up to 153 conditions per place. [2021-03-11 19:59:51,897 INFO L132 encePairwiseOnDemand]: 213/217 looper letters, 11 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2021-03-11 19:59:51,898 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 36 transitions, 110 flow [2021-03-11 19:59:51,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 19:59:51,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 19:59:51,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 577 transitions. [2021-03-11 19:59:51,910 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8863287250384024 [2021-03-11 19:59:51,911 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 577 transitions. [2021-03-11 19:59:51,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 577 transitions. [2021-03-11 19:59:51,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:59:51,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 577 transitions. [2021-03-11 19:59:51,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 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 19:59:51,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 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 19:59:51,925 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 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 19:59:51,927 INFO L185 Difference]: Start difference. First operand has 45 places, 33 transitions, 78 flow. Second operand 3 states and 577 transitions. [2021-03-11 19:59:51,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 36 transitions, 110 flow [2021-03-11 19:59:51,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 36 transitions, 106 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-11 19:59:51,930 INFO L241 Difference]: Finished difference. Result has 42 places, 31 transitions, 74 flow [2021-03-11 19:59:51,932 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2021-03-11 19:59:51,932 INFO L335 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2021-03-11 19:59:51,932 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 74 flow [2021-03-11 19:59:51,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 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 19:59:51,933 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:59:51,933 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:59:51,933 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 19:59:51,934 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:59:51,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:59:51,934 INFO L82 PathProgramCache]: Analyzing trace with hash -937574813, now seen corresponding path program 1 times [2021-03-11 19:59:51,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:59:51,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087005995] [2021-03-11 19:59:51,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:59:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:59:52,065 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-11 19:59:52,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-11 19:59:52,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:52,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:52,079 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 19:59:52,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087005995] [2021-03-11 19:59:52,080 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:59:52,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 19:59:52,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23850593] [2021-03-11 19:59:52,081 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 19:59:52,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:59:52,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 19:59:52,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 19:59:52,083 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 217 [2021-03-11 19:59:52,084 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 167.75) internal successors, (671), 4 states have internal predecessors, (671), 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 19:59:52,084 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:59:52,084 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 217 [2021-03-11 19:59:52,084 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:59:52,361 INFO L129 PetriNetUnfolder]: 794/1590 cut-off events. [2021-03-11 19:59:52,361 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 19:59:52,367 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2817 conditions, 1590 events. 794/1590 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 10921 event pairs, 248 based on Foata normal form. 0/1500 useless extension candidates. Maximal degree in co-relation 2808. Up to 661 conditions per place. [2021-03-11 19:59:52,374 INFO L132 encePairwiseOnDemand]: 207/217 looper letters, 10 selfloop transitions, 8 changer transitions 19/57 dead transitions. [2021-03-11 19:59:52,374 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 200 flow [2021-03-11 19:59:52,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 19:59:52,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 19:59:52,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 874 transitions. [2021-03-11 19:59:52,379 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8055299539170507 [2021-03-11 19:59:52,379 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 874 transitions. [2021-03-11 19:59:52,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 874 transitions. [2021-03-11 19:59:52,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:59:52,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 874 transitions. [2021-03-11 19:59:52,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 174.8) internal successors, (874), 5 states have internal predecessors, (874), 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 19:59:52,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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 19:59:52,411 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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 19:59:52,411 INFO L185 Difference]: Start difference. First operand has 42 places, 31 transitions, 74 flow. Second operand 5 states and 874 transitions. [2021-03-11 19:59:52,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 200 flow [2021-03-11 19:59:52,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 57 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 19:59:52,413 INFO L241 Difference]: Finished difference. Result has 48 places, 37 transitions, 148 flow [2021-03-11 19:59:52,413 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=148, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2021-03-11 19:59:52,414 INFO L335 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2021-03-11 19:59:52,414 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 148 flow [2021-03-11 19:59:52,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 167.75) internal successors, (671), 4 states have internal predecessors, (671), 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 19:59:52,414 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:59:52,414 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:59:52,414 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 19:59:52,414 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:59:52,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:59:52,415 INFO L82 PathProgramCache]: Analyzing trace with hash 999960127, now seen corresponding path program 1 times [2021-03-11 19:59:52,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:59:52,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334728898] [2021-03-11 19:59:52,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:59:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:59:52,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:52,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:52,495 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-11 19:59:52,496 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-11 19:59:52,506 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:52,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:52,510 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 19:59:52,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334728898] [2021-03-11 19:59:52,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:59:52,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 19:59:52,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555576649] [2021-03-11 19:59:52,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 19:59:52,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:59:52,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 19:59:52,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 19:59:52,515 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 217 [2021-03-11 19:59:52,517 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 167.8) internal successors, (839), 5 states have internal predecessors, (839), 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 19:59:52,517 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:59:52,517 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 217 [2021-03-11 19:59:52,517 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:59:52,679 INFO L129 PetriNetUnfolder]: 326/788 cut-off events. [2021-03-11 19:59:52,680 INFO L130 PetriNetUnfolder]: For 454/702 co-relation queries the response was YES. [2021-03-11 19:59:52,682 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2370 conditions, 788 events. 326/788 cut-off events. For 454/702 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5231 event pairs, 63 based on Foata normal form. 71/844 useless extension candidates. Maximal degree in co-relation 2357. Up to 431 conditions per place. [2021-03-11 19:59:52,685 INFO L132 encePairwiseOnDemand]: 208/217 looper letters, 17 selfloop transitions, 8 changer transitions 21/66 dead transitions. [2021-03-11 19:59:52,685 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 66 transitions, 412 flow [2021-03-11 19:59:52,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 19:59:52,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 19:59:52,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1207 transitions. [2021-03-11 19:59:52,689 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7946017116524029 [2021-03-11 19:59:52,689 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1207 transitions. [2021-03-11 19:59:52,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1207 transitions. [2021-03-11 19:59:52,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:59:52,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1207 transitions. [2021-03-11 19:59:52,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 172.42857142857142) internal successors, (1207), 7 states have internal predecessors, (1207), 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 19:59:52,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 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 19:59:52,696 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 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 19:59:52,696 INFO L185 Difference]: Start difference. First operand has 48 places, 37 transitions, 148 flow. Second operand 7 states and 1207 transitions. [2021-03-11 19:59:52,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 66 transitions, 412 flow [2021-03-11 19:59:52,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 66 transitions, 362 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-11 19:59:52,704 INFO L241 Difference]: Finished difference. Result has 55 places, 41 transitions, 202 flow [2021-03-11 19:59:52,704 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=202, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2021-03-11 19:59:52,704 INFO L335 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2021-03-11 19:59:52,704 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 202 flow [2021-03-11 19:59:52,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 167.8) internal successors, (839), 5 states have internal predecessors, (839), 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 19:59:52,705 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:59:52,705 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:59:52,705 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 19:59:52,705 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:59:52,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:59:52,706 INFO L82 PathProgramCache]: Analyzing trace with hash -241774812, now seen corresponding path program 1 times [2021-03-11 19:59:52,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:59:52,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291083279] [2021-03-11 19:59:52,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:59:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:59:52,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:52,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:52,807 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-11 19:59:52,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-11 19:59:52,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:52,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:52,824 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 19:59:52,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291083279] [2021-03-11 19:59:52,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:59:52,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 19:59:52,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138458251] [2021-03-11 19:59:52,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 19:59:52,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:59:52,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 19:59:52,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 19:59:52,827 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 217 [2021-03-11 19:59:52,829 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 202 flow. Second operand has 5 states, 5 states have (on average 168.0) internal successors, (840), 5 states have internal predecessors, (840), 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 19:59:52,829 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:59:52,829 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 217 [2021-03-11 19:59:52,829 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:59:52,968 INFO L129 PetriNetUnfolder]: 213/546 cut-off events. [2021-03-11 19:59:52,968 INFO L130 PetriNetUnfolder]: For 870/1170 co-relation queries the response was YES. [2021-03-11 19:59:52,970 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1872 conditions, 546 events. 213/546 cut-off events. For 870/1170 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3251 event pairs, 17 based on Foata normal form. 37/572 useless extension candidates. Maximal degree in co-relation 1853. Up to 292 conditions per place. [2021-03-11 19:59:52,973 INFO L132 encePairwiseOnDemand]: 207/217 looper letters, 20 selfloop transitions, 13 changer transitions 15/68 dead transitions. [2021-03-11 19:59:52,974 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 68 transitions, 494 flow [2021-03-11 19:59:52,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 19:59:52,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 19:59:52,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1205 transitions. [2021-03-11 19:59:52,977 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.793285055957867 [2021-03-11 19:59:52,977 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1205 transitions. [2021-03-11 19:59:52,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1205 transitions. [2021-03-11 19:59:52,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:59:52,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1205 transitions. [2021-03-11 19:59:52,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 172.14285714285714) internal successors, (1205), 7 states have internal predecessors, (1205), 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 19:59:52,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 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 19:59:52,987 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 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 19:59:52,987 INFO L185 Difference]: Start difference. First operand has 55 places, 41 transitions, 202 flow. Second operand 7 states and 1205 transitions. [2021-03-11 19:59:52,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 68 transitions, 494 flow [2021-03-11 19:59:52,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 68 transitions, 475 flow, removed 7 selfloop flow, removed 3 redundant places. [2021-03-11 19:59:52,993 INFO L241 Difference]: Finished difference. Result has 61 places, 48 transitions, 322 flow [2021-03-11 19:59:52,994 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=322, PETRI_PLACES=61, PETRI_TRANSITIONS=48} [2021-03-11 19:59:52,994 INFO L335 CegarLoopForPetriNet]: 45 programPoint places, 16 predicate places. [2021-03-11 19:59:52,994 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 48 transitions, 322 flow [2021-03-11 19:59:52,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 168.0) internal successors, (840), 5 states have internal predecessors, (840), 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 19:59:52,994 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:59:52,995 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:59:52,995 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 19:59:52,995 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:59:52,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:59:52,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1854345398, now seen corresponding path program 1 times [2021-03-11 19:59:52,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:59:52,995 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560161684] [2021-03-11 19:59:52,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:59:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:59:53,069 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:53,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:53,075 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 19:59:53,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 19:59:53,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:53,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:59:53,083 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 19:59:53,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560161684] [2021-03-11 19:59:53,084 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:59:53,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 19:59:53,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324153125] [2021-03-11 19:59:53,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 19:59:53,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:59:53,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 19:59:53,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 19:59:53,086 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 217 [2021-03-11 19:59:53,087 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 48 transitions, 322 flow. Second operand has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 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 19:59:53,087 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:59:53,087 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 217 [2021-03-11 19:59:53,087 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:59:53,277 INFO L129 PetriNetUnfolder]: 785/1602 cut-off events. [2021-03-11 19:59:53,277 INFO L130 PetriNetUnfolder]: For 1219/1347 co-relation queries the response was YES. [2021-03-11 19:59:53,287 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4065 conditions, 1602 events. 785/1602 cut-off events. For 1219/1347 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 12196 event pairs, 354 based on Foata normal form. 129/1588 useless extension candidates. Maximal degree in co-relation 4041. Up to 877 conditions per place. [2021-03-11 19:59:53,296 INFO L132 encePairwiseOnDemand]: 210/217 looper letters, 10 selfloop transitions, 10 changer transitions 0/61 dead transitions. [2021-03-11 19:59:53,296 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 61 transitions, 388 flow [2021-03-11 19:59:53,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 19:59:53,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 19:59:53,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 897 transitions. [2021-03-11 19:59:53,299 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8267281105990784 [2021-03-11 19:59:53,299 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 897 transitions. [2021-03-11 19:59:53,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 897 transitions. [2021-03-11 19:59:53,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:59:53,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 897 transitions. [2021-03-11 19:59:53,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 179.4) internal successors, (897), 5 states have internal predecessors, (897), 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 19:59:53,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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 19:59:53,303 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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 19:59:53,304 INFO L185 Difference]: Start difference. First operand has 61 places, 48 transitions, 322 flow. Second operand 5 states and 897 transitions. [2021-03-11 19:59:53,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 61 transitions, 388 flow [2021-03-11 19:59:53,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 61 transitions, 366 flow, removed 9 selfloop flow, removed 4 redundant places. [2021-03-11 19:59:53,313 INFO L241 Difference]: Finished difference. Result has 61 places, 57 transitions, 375 flow [2021-03-11 19:59:53,313 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=375, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2021-03-11 19:59:53,313 INFO L335 CegarLoopForPetriNet]: 45 programPoint places, 16 predicate places. [2021-03-11 19:59:53,313 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 375 flow [2021-03-11 19:59:53,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 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 19:59:53,314 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:59:53,314 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:59:53,314 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 19:59:53,314 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:59:53,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:59:53,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1090293895, now seen corresponding path program 1 times [2021-03-11 19:59:53,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:59:53,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263979575] [2021-03-11 19:59:53,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:59:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:59:53,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:53,389 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:59:53,389 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:53,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:53,393 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-11 19:59:53,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-11 19:59:53,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:53,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:53,412 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 19:59:53,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263979575] [2021-03-11 19:59:53,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:59:53,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 19:59:53,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409365116] [2021-03-11 19:59:53,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 19:59:53,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:59:53,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 19:59:53,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-11 19:59:53,415 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 217 [2021-03-11 19:59:53,416 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 375 flow. Second operand has 5 states, 5 states have (on average 164.6) internal successors, (823), 5 states have internal predecessors, (823), 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 19:59:53,416 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:59:53,416 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 217 [2021-03-11 19:59:53,416 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:59:53,803 INFO L129 PetriNetUnfolder]: 1157/2470 cut-off events. [2021-03-11 19:59:53,803 INFO L130 PetriNetUnfolder]: For 3064/4921 co-relation queries the response was YES. [2021-03-11 19:59:53,819 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8132 conditions, 2470 events. 1157/2470 cut-off events. For 3064/4921 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 20982 event pairs, 423 based on Foata normal form. 116/2335 useless extension candidates. Maximal degree in co-relation 8107. Up to 1366 conditions per place. [2021-03-11 19:59:53,837 INFO L132 encePairwiseOnDemand]: 206/217 looper letters, 21 selfloop transitions, 36 changer transitions 0/85 dead transitions. [2021-03-11 19:59:53,837 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 85 transitions, 718 flow [2021-03-11 19:59:53,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 19:59:53,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 19:59:53,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1180 transitions. [2021-03-11 19:59:53,841 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7768268597761685 [2021-03-11 19:59:53,841 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1180 transitions. [2021-03-11 19:59:53,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1180 transitions. [2021-03-11 19:59:53,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:59:53,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1180 transitions. [2021-03-11 19:59:53,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 168.57142857142858) internal successors, (1180), 7 states have internal predecessors, (1180), 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 19:59:53,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 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 19:59:53,847 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 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 19:59:53,847 INFO L185 Difference]: Start difference. First operand has 61 places, 57 transitions, 375 flow. Second operand 7 states and 1180 transitions. [2021-03-11 19:59:53,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 85 transitions, 718 flow [2021-03-11 19:59:53,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 85 transitions, 699 flow, removed 7 selfloop flow, removed 3 redundant places. [2021-03-11 19:59:53,863 INFO L241 Difference]: Finished difference. Result has 69 places, 77 transitions, 693 flow [2021-03-11 19:59:53,864 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=693, PETRI_PLACES=69, PETRI_TRANSITIONS=77} [2021-03-11 19:59:53,864 INFO L335 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2021-03-11 19:59:53,864 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 77 transitions, 693 flow [2021-03-11 19:59:53,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 164.6) internal successors, (823), 5 states have internal predecessors, (823), 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 19:59:53,864 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:59:53,865 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:59:53,865 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 19:59:53,865 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:59:53,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:59:53,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1575255353, now seen corresponding path program 2 times [2021-03-11 19:59:53,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:59:53,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302573890] [2021-03-11 19:59:53,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:59:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:59:53,942 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:53,942 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:53,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:53,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:53,950 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 19:59:53,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 19:59:53,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:53,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:59:53,957 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 19:59:53,957 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302573890] [2021-03-11 19:59:53,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:59:53,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 19:59:53,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186397486] [2021-03-11 19:59:53,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 19:59:53,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:59:53,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 19:59:53,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 19:59:53,960 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 217 [2021-03-11 19:59:53,962 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 77 transitions, 693 flow. Second operand has 5 states, 5 states have (on average 175.8) internal successors, (879), 5 states have internal predecessors, (879), 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 19:59:53,962 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:59:53,962 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 217 [2021-03-11 19:59:53,962 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:59:54,238 INFO L129 PetriNetUnfolder]: 770/1832 cut-off events. [2021-03-11 19:59:54,239 INFO L130 PetriNetUnfolder]: For 3845/6481 co-relation queries the response was YES. [2021-03-11 19:59:54,251 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7390 conditions, 1832 events. 770/1832 cut-off events. For 3845/6481 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 15426 event pairs, 106 based on Foata normal form. 608/2315 useless extension candidates. Maximal degree in co-relation 7361. Up to 1160 conditions per place. [2021-03-11 19:59:54,263 INFO L132 encePairwiseOnDemand]: 210/217 looper letters, 10 selfloop transitions, 19 changer transitions 0/90 dead transitions. [2021-03-11 19:59:54,263 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 90 transitions, 827 flow [2021-03-11 19:59:54,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 19:59:54,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 19:59:54,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1256 transitions. [2021-03-11 19:59:54,267 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8268597761685319 [2021-03-11 19:59:54,267 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1256 transitions. [2021-03-11 19:59:54,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1256 transitions. [2021-03-11 19:59:54,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:59:54,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1256 transitions. [2021-03-11 19:59:54,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 179.42857142857142) internal successors, (1256), 7 states have internal predecessors, (1256), 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 19:59:54,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 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 19:59:54,274 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 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 19:59:54,274 INFO L185 Difference]: Start difference. First operand has 69 places, 77 transitions, 693 flow. Second operand 7 states and 1256 transitions. [2021-03-11 19:59:54,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 90 transitions, 827 flow [2021-03-11 19:59:54,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 90 transitions, 813 flow, removed 7 selfloop flow, removed 0 redundant places. [2021-03-11 19:59:54,290 INFO L241 Difference]: Finished difference. Result has 78 places, 86 transitions, 813 flow [2021-03-11 19:59:54,290 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=813, PETRI_PLACES=78, PETRI_TRANSITIONS=86} [2021-03-11 19:59:54,290 INFO L335 CegarLoopForPetriNet]: 45 programPoint places, 33 predicate places. [2021-03-11 19:59:54,290 INFO L480 AbstractCegarLoop]: Abstraction has has 78 places, 86 transitions, 813 flow [2021-03-11 19:59:54,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 175.8) internal successors, (879), 5 states have internal predecessors, (879), 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 19:59:54,291 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:59:54,291 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] [2021-03-11 19:59:54,291 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 19:59:54,291 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:59:54,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:59:54,293 INFO L82 PathProgramCache]: Analyzing trace with hash 980980431, now seen corresponding path program 1 times [2021-03-11 19:59:54,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:59:54,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963554437] [2021-03-11 19:59:54,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:59:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:59:54,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:54,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:59:54,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:54,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:54,420 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:54,420 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:54,423 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:54,423 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:54,427 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 19:59:54,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963554437] [2021-03-11 19:59:54,427 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:59:54,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 19:59:54,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257737663] [2021-03-11 19:59:54,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 19:59:54,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:59:54,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 19:59:54,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-11 19:59:54,430 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 217 [2021-03-11 19:59:54,431 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 86 transitions, 813 flow. Second operand has 5 states, 5 states have (on average 178.2) internal successors, (891), 5 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:59:54,431 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:59:54,431 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 217 [2021-03-11 19:59:54,431 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:59:54,723 INFO L129 PetriNetUnfolder]: 1050/2434 cut-off events. [2021-03-11 19:59:54,723 INFO L130 PetriNetUnfolder]: For 9327/13539 co-relation queries the response was YES. [2021-03-11 19:59:54,742 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11501 conditions, 2434 events. 1050/2434 cut-off events. For 9327/13539 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 21448 event pairs, 152 based on Foata normal form. 115/2367 useless extension candidates. Maximal degree in co-relation 11467. Up to 1607 conditions per place. [2021-03-11 19:59:54,760 INFO L132 encePairwiseOnDemand]: 213/217 looper letters, 12 selfloop transitions, 7 changer transitions 3/90 dead transitions. [2021-03-11 19:59:54,760 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 90 transitions, 895 flow [2021-03-11 19:59:54,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 19:59:54,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 19:59:54,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 896 transitions. [2021-03-11 19:59:54,763 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8258064516129032 [2021-03-11 19:59:54,763 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 896 transitions. [2021-03-11 19:59:54,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 896 transitions. [2021-03-11 19:59:54,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:59:54,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 896 transitions. [2021-03-11 19:59:54,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 179.2) internal successors, (896), 5 states have internal predecessors, (896), 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 19:59:54,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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 19:59:54,767 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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 19:59:54,767 INFO L185 Difference]: Start difference. First operand has 78 places, 86 transitions, 813 flow. Second operand 5 states and 896 transitions. [2021-03-11 19:59:54,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 90 transitions, 895 flow [2021-03-11 19:59:54,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 90 transitions, 845 flow, removed 17 selfloop flow, removed 3 redundant places. [2021-03-11 19:59:54,842 INFO L241 Difference]: Finished difference. Result has 81 places, 84 transitions, 758 flow [2021-03-11 19:59:54,843 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=763, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=758, PETRI_PLACES=81, PETRI_TRANSITIONS=84} [2021-03-11 19:59:54,843 INFO L335 CegarLoopForPetriNet]: 45 programPoint places, 36 predicate places. [2021-03-11 19:59:54,843 INFO L480 AbstractCegarLoop]: Abstraction has has 81 places, 84 transitions, 758 flow [2021-03-11 19:59:54,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 178.2) internal successors, (891), 5 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:59:54,843 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:59:54,844 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] [2021-03-11 19:59:54,844 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 19:59:54,844 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:59:54,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:59:54,844 INFO L82 PathProgramCache]: Analyzing trace with hash -109469923, now seen corresponding path program 2 times [2021-03-11 19:59:54,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:59:54,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381772956] [2021-03-11 19:59:54,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:59:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:59:54,949 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:54,950 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:54,952 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:54,952 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:54,955 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:54,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:54,960 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 19:59:54,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 19:59:54,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:54,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:59:54,973 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 19:59:54,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381772956] [2021-03-11 19:59:54,975 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:59:54,975 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 19:59:54,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822204533] [2021-03-11 19:59:54,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 19:59:54,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:59:54,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 19:59:54,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 19:59:54,977 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 217 [2021-03-11 19:59:54,979 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 84 transitions, 758 flow. Second operand has 6 states, 6 states have (on average 175.83333333333334) internal successors, (1055), 6 states have internal predecessors, (1055), 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 19:59:54,979 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:59:54,979 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 217 [2021-03-11 19:59:54,979 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:59:55,319 INFO L129 PetriNetUnfolder]: 821/1934 cut-off events. [2021-03-11 19:59:55,320 INFO L130 PetriNetUnfolder]: For 8665/13475 co-relation queries the response was YES. [2021-03-11 19:59:55,337 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9179 conditions, 1934 events. 821/1934 cut-off events. For 8665/13475 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 16551 event pairs, 24 based on Foata normal form. 1128/2914 useless extension candidates. Maximal degree in co-relation 9144. Up to 1002 conditions per place. [2021-03-11 19:59:55,348 INFO L132 encePairwiseOnDemand]: 210/217 looper letters, 6 selfloop transitions, 28 changer transitions 7/96 dead transitions. [2021-03-11 19:59:55,348 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 96 transitions, 944 flow [2021-03-11 19:59:55,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 19:59:55,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-11 19:59:55,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1615 transitions. [2021-03-11 19:59:55,362 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8269329237071172 [2021-03-11 19:59:55,362 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1615 transitions. [2021-03-11 19:59:55,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1615 transitions. [2021-03-11 19:59:55,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:59:55,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1615 transitions. [2021-03-11 19:59:55,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 179.44444444444446) internal successors, (1615), 9 states have internal predecessors, (1615), 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 19:59:55,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 217.0) internal successors, (2170), 10 states have internal predecessors, (2170), 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 19:59:55,370 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 217.0) internal successors, (2170), 10 states have internal predecessors, (2170), 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 19:59:55,370 INFO L185 Difference]: Start difference. First operand has 81 places, 84 transitions, 758 flow. Second operand 9 states and 1615 transitions. [2021-03-11 19:59:55,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 96 transitions, 944 flow [2021-03-11 19:59:55,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 96 transitions, 927 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-03-11 19:59:55,405 INFO L241 Difference]: Finished difference. Result has 90 places, 89 transitions, 869 flow [2021-03-11 19:59:55,405 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=725, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=869, PETRI_PLACES=90, PETRI_TRANSITIONS=89} [2021-03-11 19:59:55,405 INFO L335 CegarLoopForPetriNet]: 45 programPoint places, 45 predicate places. [2021-03-11 19:59:55,406 INFO L480 AbstractCegarLoop]: Abstraction has has 90 places, 89 transitions, 869 flow [2021-03-11 19:59:55,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 175.83333333333334) internal successors, (1055), 6 states have internal predecessors, (1055), 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 19:59:55,406 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:59:55,406 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] [2021-03-11 19:59:55,406 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 19:59:55,407 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:59:55,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:59:55,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1526303882, now seen corresponding path program 1 times [2021-03-11 19:59:55,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:59:55,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803088680] [2021-03-11 19:59:55,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:59:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:59:55,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:55,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:55,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:55,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:55,516 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:55,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:55,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:55,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:55,526 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 19:59:55,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 19:59:55,533 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:55,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:59:55,534 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 19:59:55,534 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803088680] [2021-03-11 19:59:55,534 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:59:55,535 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 19:59:55,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075861452] [2021-03-11 19:59:55,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 19:59:55,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:59:55,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 19:59:55,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-11 19:59:55,538 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 217 [2021-03-11 19:59:55,539 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 89 transitions, 869 flow. Second operand has 7 states, 7 states have (on average 175.85714285714286) internal successors, (1231), 7 states have internal predecessors, (1231), 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 19:59:55,539 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:59:55,539 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 217 [2021-03-11 19:59:55,539 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:59:55,847 INFO L129 PetriNetUnfolder]: 743/1751 cut-off events. [2021-03-11 19:59:55,848 INFO L130 PetriNetUnfolder]: For 11445/16345 co-relation queries the response was YES. [2021-03-11 19:59:55,862 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10081 conditions, 1751 events. 743/1751 cut-off events. For 11445/16345 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 15155 event pairs, 12 based on Foata normal form. 917/2519 useless extension candidates. Maximal degree in co-relation 10049. Up to 893 conditions per place. [2021-03-11 19:59:55,879 INFO L132 encePairwiseOnDemand]: 210/217 looper letters, 2 selfloop transitions, 33 changer transitions 4/94 dead transitions. [2021-03-11 19:59:55,880 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 94 transitions, 1003 flow [2021-03-11 19:59:55,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-11 19:59:55,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-11 19:59:55,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1966 transitions. [2021-03-11 19:59:55,884 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8236279849183075 [2021-03-11 19:59:55,884 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1966 transitions. [2021-03-11 19:59:55,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1966 transitions. [2021-03-11 19:59:55,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:59:55,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1966 transitions. [2021-03-11 19:59:55,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 178.72727272727272) internal successors, (1966), 11 states have internal predecessors, (1966), 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 19:59:55,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 217.0) internal successors, (2604), 12 states have internal predecessors, (2604), 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 19:59:55,892 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 217.0) internal successors, (2604), 12 states have internal predecessors, (2604), 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 19:59:55,893 INFO L185 Difference]: Start difference. First operand has 90 places, 89 transitions, 869 flow. Second operand 11 states and 1966 transitions. [2021-03-11 19:59:55,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 94 transitions, 1003 flow [2021-03-11 19:59:56,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 94 transitions, 872 flow, removed 46 selfloop flow, removed 9 redundant places. [2021-03-11 19:59:56,017 INFO L241 Difference]: Finished difference. Result has 91 places, 90 transitions, 832 flow [2021-03-11 19:59:56,017 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=832, PETRI_PLACES=91, PETRI_TRANSITIONS=90} [2021-03-11 19:59:56,017 INFO L335 CegarLoopForPetriNet]: 45 programPoint places, 46 predicate places. [2021-03-11 19:59:56,017 INFO L480 AbstractCegarLoop]: Abstraction has has 91 places, 90 transitions, 832 flow [2021-03-11 19:59:56,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 175.85714285714286) internal successors, (1231), 7 states have internal predecessors, (1231), 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 19:59:56,018 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:59:56,018 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] [2021-03-11 19:59:56,018 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 19:59:56,018 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:59:56,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:59:56,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1961795172, now seen corresponding path program 1 times [2021-03-11 19:59:56,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:59:56,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113673275] [2021-03-11 19:59:56,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:59:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:59:56,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:56,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:59:56,111 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:56,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:56,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:56,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:56,117 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-11 19:59:56,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-11 19:59:56,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:56,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:56,132 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 19:59:56,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113673275] [2021-03-11 19:59:56,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:59:56,133 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 19:59:56,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227237137] [2021-03-11 19:59:56,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 19:59:56,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:59:56,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 19:59:56,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-11 19:59:56,136 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 217 [2021-03-11 19:59:56,137 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 90 transitions, 832 flow. Second operand has 6 states, 6 states have (on average 165.83333333333334) internal successors, (995), 6 states have internal predecessors, (995), 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 19:59:56,137 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:59:56,137 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 217 [2021-03-11 19:59:56,137 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:59:56,520 INFO L129 PetriNetUnfolder]: 1295/3016 cut-off events. [2021-03-11 19:59:56,520 INFO L130 PetriNetUnfolder]: For 10417/11448 co-relation queries the response was YES. [2021-03-11 19:59:56,542 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13586 conditions, 3016 events. 1295/3016 cut-off events. For 10417/11448 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 28614 event pairs, 19 based on Foata normal form. 8/2756 useless extension candidates. Maximal degree in co-relation 13549. Up to 795 conditions per place. [2021-03-11 19:59:56,549 INFO L132 encePairwiseOnDemand]: 206/217 looper letters, 20 selfloop transitions, 28 changer transitions 40/136 dead transitions. [2021-03-11 19:59:56,549 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 136 transitions, 1484 flow [2021-03-11 19:59:56,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 19:59:56,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 19:59:56,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1184 transitions. [2021-03-11 19:59:56,552 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7794601711652402 [2021-03-11 19:59:56,552 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1184 transitions. [2021-03-11 19:59:56,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1184 transitions. [2021-03-11 19:59:56,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:59:56,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1184 transitions. [2021-03-11 19:59:56,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 169.14285714285714) internal successors, (1184), 7 states have internal predecessors, (1184), 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 19:59:56,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 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 19:59:56,562 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 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 19:59:56,564 INFO L185 Difference]: Start difference. First operand has 91 places, 90 transitions, 832 flow. Second operand 7 states and 1184 transitions. [2021-03-11 19:59:56,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 136 transitions, 1484 flow [2021-03-11 19:59:56,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 136 transitions, 1333 flow, removed 45 selfloop flow, removed 11 redundant places. [2021-03-11 19:59:56,878 INFO L241 Difference]: Finished difference. Result has 88 places, 88 transitions, 763 flow [2021-03-11 19:59:56,879 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=763, PETRI_PLACES=88, PETRI_TRANSITIONS=88} [2021-03-11 19:59:56,879 INFO L335 CegarLoopForPetriNet]: 45 programPoint places, 43 predicate places. [2021-03-11 19:59:56,879 INFO L480 AbstractCegarLoop]: Abstraction has has 88 places, 88 transitions, 763 flow [2021-03-11 19:59:56,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 165.83333333333334) internal successors, (995), 6 states have internal predecessors, (995), 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 19:59:56,885 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:59:56,885 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] [2021-03-11 19:59:56,886 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-11 19:59:56,886 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:59:56,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:59:56,886 INFO L82 PathProgramCache]: Analyzing trace with hash -2075770388, now seen corresponding path program 2 times [2021-03-11 19:59:56,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:59:56,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566858574] [2021-03-11 19:59:56,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:59:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:59:57,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:57,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:59:57,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:57,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:57,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:57,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:57,011 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-11 19:59:57,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-11 19:59:57,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:57,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:57,030 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 19:59:57,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566858574] [2021-03-11 19:59:57,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:59:57,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 19:59:57,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897628999] [2021-03-11 19:59:57,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 19:59:57,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:59:57,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 19:59:57,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-11 19:59:57,033 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 217 [2021-03-11 19:59:57,034 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 88 transitions, 763 flow. Second operand has 6 states, 6 states have (on average 168.66666666666666) internal successors, (1012), 6 states have internal predecessors, (1012), 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 19:59:57,034 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:59:57,034 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 217 [2021-03-11 19:59:57,034 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:59:57,301 INFO L129 PetriNetUnfolder]: 1093/2598 cut-off events. [2021-03-11 19:59:57,301 INFO L130 PetriNetUnfolder]: For 5088/5318 co-relation queries the response was YES. [2021-03-11 19:59:57,318 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9683 conditions, 2598 events. 1093/2598 cut-off events. For 5088/5318 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 24288 event pairs, 10 based on Foata normal form. 5/2372 useless extension candidates. Maximal degree in co-relation 9655. Up to 710 conditions per place. [2021-03-11 19:59:57,322 INFO L132 encePairwiseOnDemand]: 209/217 looper letters, 14 selfloop transitions, 11 changer transitions 29/103 dead transitions. [2021-03-11 19:59:57,322 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 103 transitions, 993 flow [2021-03-11 19:59:57,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 19:59:57,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 19:59:57,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1194 transitions. [2021-03-11 19:59:57,325 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7860434496379197 [2021-03-11 19:59:57,325 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1194 transitions. [2021-03-11 19:59:57,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1194 transitions. [2021-03-11 19:59:57,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:59:57,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1194 transitions. [2021-03-11 19:59:57,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 170.57142857142858) internal successors, (1194), 7 states have internal predecessors, (1194), 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 19:59:57,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 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 19:59:57,330 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 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 19:59:57,330 INFO L185 Difference]: Start difference. First operand has 88 places, 88 transitions, 763 flow. Second operand 7 states and 1194 transitions. [2021-03-11 19:59:57,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 103 transitions, 993 flow [2021-03-11 19:59:57,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 103 transitions, 926 flow, removed 9 selfloop flow, removed 4 redundant places. [2021-03-11 19:59:57,509 INFO L241 Difference]: Finished difference. Result has 92 places, 73 transitions, 536 flow [2021-03-11 19:59:57,510 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=536, PETRI_PLACES=92, PETRI_TRANSITIONS=73} [2021-03-11 19:59:57,510 INFO L335 CegarLoopForPetriNet]: 45 programPoint places, 47 predicate places. [2021-03-11 19:59:57,510 INFO L480 AbstractCegarLoop]: Abstraction has has 92 places, 73 transitions, 536 flow [2021-03-11 19:59:57,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 168.66666666666666) internal successors, (1012), 6 states have internal predecessors, (1012), 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 19:59:57,510 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:59:57,511 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] [2021-03-11 19:59:57,511 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-11 19:59:57,511 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:59:57,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:59:57,511 INFO L82 PathProgramCache]: Analyzing trace with hash -2138574942, now seen corresponding path program 3 times [2021-03-11 19:59:57,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:59:57,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809268721] [2021-03-11 19:59:57,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:59:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:59:57,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:57,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:59:57,679 INFO L142 QuantifierPusher]: treesize reduction 4, result has 89.7 percent of original size [2021-03-11 19:59:57,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-11 19:59:57,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:57,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-11 19:59:57,716 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:57,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 19:59:57,730 INFO L142 QuantifierPusher]: treesize reduction 21, result has 73.1 percent of original size [2021-03-11 19:59:57,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 57 [2021-03-11 19:59:57,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:57,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:57,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:57,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:57,762 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 19:59:57,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809268721] [2021-03-11 19:59:57,762 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:59:57,763 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 19:59:57,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757740993] [2021-03-11 19:59:57,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-11 19:59:57,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:59:57,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-11 19:59:57,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-03-11 19:59:57,765 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 217 [2021-03-11 19:59:57,766 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 73 transitions, 536 flow. Second operand has 9 states, 9 states have (on average 156.11111111111111) internal successors, (1405), 9 states have internal predecessors, (1405), 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 19:59:57,766 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:59:57,766 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 217 [2021-03-11 19:59:57,766 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:59:58,289 INFO L129 PetriNetUnfolder]: 1704/4366 cut-off events. [2021-03-11 19:59:58,289 INFO L130 PetriNetUnfolder]: For 13537/14651 co-relation queries the response was YES. [2021-03-11 19:59:58,310 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14909 conditions, 4366 events. 1704/4366 cut-off events. For 13537/14651 co-relation queries the response was YES. Maximal size of possible extension queue 654. Compared 46322 event pairs, 103 based on Foata normal form. 373/4399 useless extension candidates. Maximal degree in co-relation 14877. Up to 1225 conditions per place. [2021-03-11 19:59:58,317 INFO L132 encePairwiseOnDemand]: 209/217 looper letters, 15 selfloop transitions, 8 changer transitions 10/94 dead transitions. [2021-03-11 19:59:58,317 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 94 transitions, 724 flow [2021-03-11 19:59:58,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-11 19:59:58,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-11 19:59:58,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1268 transitions. [2021-03-11 19:59:58,320 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7304147465437788 [2021-03-11 19:59:58,320 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1268 transitions. [2021-03-11 19:59:58,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1268 transitions. [2021-03-11 19:59:58,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:59:58,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1268 transitions. [2021-03-11 19:59:58,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 158.5) internal successors, (1268), 8 states have internal predecessors, (1268), 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 19:59:58,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 217.0) internal successors, (1953), 9 states have internal predecessors, (1953), 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 19:59:58,325 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 217.0) internal successors, (1953), 9 states have internal predecessors, (1953), 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 19:59:58,325 INFO L185 Difference]: Start difference. First operand has 92 places, 73 transitions, 536 flow. Second operand 8 states and 1268 transitions. [2021-03-11 19:59:58,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 94 transitions, 724 flow [2021-03-11 19:59:58,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 94 transitions, 683 flow, removed 12 selfloop flow, removed 7 redundant places. [2021-03-11 19:59:58,766 INFO L241 Difference]: Finished difference. Result has 93 places, 76 transitions, 557 flow [2021-03-11 19:59:58,766 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=557, PETRI_PLACES=93, PETRI_TRANSITIONS=76} [2021-03-11 19:59:58,767 INFO L335 CegarLoopForPetriNet]: 45 programPoint places, 48 predicate places. [2021-03-11 19:59:58,767 INFO L480 AbstractCegarLoop]: Abstraction has has 93 places, 76 transitions, 557 flow [2021-03-11 19:59:58,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 156.11111111111111) internal successors, (1405), 9 states have internal predecessors, (1405), 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 19:59:58,767 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:59:58,767 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] [2021-03-11 19:59:58,767 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-11 19:59:58,768 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:59:58,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:59:58,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1770871914, now seen corresponding path program 4 times [2021-03-11 19:59:58,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:59:58,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158683292] [2021-03-11 19:59:58,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:59:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 19:59:58,810 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 19:59:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 19:59:58,861 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 19:59:58,890 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 19:59:58,890 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 19:59:58,890 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-11 19:59:58,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 07:59:58 BasicIcfg [2021-03-11 19:59:58,978 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 19:59:58,979 INFO L168 Benchmark]: Toolchain (without parser) took 16049.56 ms. Allocated memory was 255.9 MB in the beginning and 648.0 MB in the end (delta: 392.2 MB). Free memory was 234.6 MB in the beginning and 482.9 MB in the end (delta: -248.3 MB). Peak memory consumption was 144.2 MB. Max. memory is 16.0 GB. [2021-03-11 19:59:58,979 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 19:59:58,979 INFO L168 Benchmark]: CACSL2BoogieTranslator took 556.14 ms. Allocated memory was 255.9 MB in the beginning and 360.7 MB in the end (delta: 104.9 MB). Free memory was 233.9 MB in the beginning and 318.5 MB in the end (delta: -84.6 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. [2021-03-11 19:59:58,979 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.05 ms. Allocated memory is still 360.7 MB. Free memory was 318.5 MB in the beginning and 316.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-11 19:59:58,979 INFO L168 Benchmark]: Boogie Preprocessor took 44.31 ms. Allocated memory is still 360.7 MB. Free memory was 316.0 MB in the beginning and 313.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 19:59:58,980 INFO L168 Benchmark]: RCFGBuilder took 1926.71 ms. Allocated memory was 360.7 MB in the beginning and 434.1 MB in the end (delta: 73.4 MB). Free memory was 313.5 MB in the beginning and 370.7 MB in the end (delta: -57.2 MB). Peak memory consumption was 64.2 MB. Max. memory is 16.0 GB. [2021-03-11 19:59:58,980 INFO L168 Benchmark]: TraceAbstraction took 13439.92 ms. Allocated memory was 434.1 MB in the beginning and 648.0 MB in the end (delta: 213.9 MB). Free memory was 369.7 MB in the beginning and 482.9 MB in the end (delta: -113.2 MB). Peak memory consumption was 101.7 MB. Max. memory is 16.0 GB. [2021-03-11 19:59:58,981 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.12 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 556.14 ms. Allocated memory was 255.9 MB in the beginning and 360.7 MB in the end (delta: 104.9 MB). Free memory was 233.9 MB in the beginning and 318.5 MB in the end (delta: -84.6 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 74.05 ms. Allocated memory is still 360.7 MB. Free memory was 318.5 MB in the beginning and 316.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 44.31 ms. Allocated memory is still 360.7 MB. Free memory was 316.0 MB in the beginning and 313.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1926.71 ms. Allocated memory was 360.7 MB in the beginning and 434.1 MB in the end (delta: 73.4 MB). Free memory was 313.5 MB in the beginning and 370.7 MB in the end (delta: -57.2 MB). Peak memory consumption was 64.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 13439.92 ms. Allocated memory was 434.1 MB in the beginning and 648.0 MB in the end (delta: 213.9 MB). Free memory was 369.7 MB in the beginning and 482.9 MB in the end (delta: -113.2 MB). Peak memory consumption was 101.7 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5776.1ms, 127 PlacesBefore, 45 PlacesAfterwards, 116 TransitionsBefore, 33 TransitionsAfterwards, 2886 CoEnabledTransitionPairs, 6 FixpointIterations, 42 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 97 TotalNumberOfCompositions, 8480 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4876, positive: 4664, positive conditional: 0, positive unconditional: 4664, negative: 212, negative conditional: 0, negative unconditional: 212, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2253, positive: 2196, positive conditional: 0, positive unconditional: 2196, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2253, positive: 2161, positive conditional: 0, positive unconditional: 2161, negative: 92, negative conditional: 0, negative unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 92, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 812, positive: 84, positive conditional: 0, positive unconditional: 84, negative: 727, negative conditional: 0, negative unconditional: 727, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4876, positive: 2468, positive conditional: 0, positive unconditional: 2468, negative: 155, negative conditional: 0, negative unconditional: 155, unknown: 2253, unknown conditional: 0, unknown unconditional: 2253] , Statistics on independence cache: Total cache size (in pairs): 341, Positive cache size: 317, Positive conditional cache size: 0, Positive unconditional cache size: 317, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool a$flush_delayed; [L724] 0 int a$mem_tmp; [L725] 0 _Bool a$r_buff0_thd0; [L726] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd2; [L728] 0 _Bool a$r_buff0_thd3; [L729] 0 _Bool a$r_buff0_thd4; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$r_buff1_thd4; [L735] 0 _Bool a$read_delayed; [L736] 0 int *a$read_delayed_var; [L737] 0 int a$w_buff0; [L738] 0 _Bool a$w_buff0_used; [L739] 0 int a$w_buff1; [L740] 0 _Bool a$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t185; [L872] FCALL, FORK 0 pthread_create(&t185, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t186; [L874] FCALL, FORK 0 pthread_create(&t186, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L875] 0 pthread_t t187; [L876] FCALL, FORK 0 pthread_create(&t187, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L877] 0 pthread_t t188; [L878] FCALL, FORK 0 pthread_create(&t188, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L813] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L813] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L814] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L815] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L815] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L816] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L816] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L817] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L817] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L790] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 a$flush_delayed = weak$$choice2 [L836] 4 a$mem_tmp = a [L837] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L837] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L838] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L838] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L838] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L838] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L839] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L839] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L839] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L839] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L840] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L840] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used) [L840] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L840] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L841] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L841] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L842] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L842] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L842] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L843] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L843] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = a [L845] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L845] 4 a = a$flush_delayed ? a$mem_tmp : a [L846] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=2, z=1] [L849] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L849] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L849] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L849] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L850] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L850] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L851] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L851] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L852] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L852] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L853] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L853] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L884] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L884] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L884] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L884] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L885] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L885] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L886] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L886] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L887] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L887] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L888] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L888] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L891] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 13226.1ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 5401.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5855.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 150 SDtfs, 141 SDslu, 201 SDs, 0 SdLazy, 445 SolverSat, 104 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 450.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 432.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=869occurred in iteration=9, InterpolantAutomatonStates: 88, 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: 51.1ms SsaConstructionTime, 698.2ms SatisfiabilityAnalysisTime, 913.1ms InterpolantComputationTime, 286 NumberOfCodeBlocks, 286 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 243 ConstructedInterpolants, 0 QuantifiedInterpolants, 1890 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...