/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe004_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-24 11:00:38,401 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-24 11:00:38,403 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-24 11:00:38,430 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-24 11:00:38,430 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-24 11:00:38,431 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-24 11:00:38,437 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-24 11:00:38,442 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-24 11:00:38,444 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-24 11:00:38,449 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-24 11:00:38,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-24 11:00:38,450 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-24 11:00:38,450 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-24 11:00:38,452 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-24 11:00:38,453 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-24 11:00:38,456 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-24 11:00:38,457 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-24 11:00:38,457 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-24 11:00:38,458 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-24 11:00:38,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-24 11:00:38,460 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-24 11:00:38,464 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-24 11:00:38,464 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-24 11:00:38,466 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-24 11:00:38,470 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-24 11:00:38,471 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-24 11:00:38,471 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-24 11:00:38,472 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-24 11:00:38,472 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-24 11:00:38,473 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-24 11:00:38,473 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-24 11:00:38,474 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-24 11:00:38,475 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-24 11:00:38,476 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-24 11:00:38,476 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-24 11:00:38,476 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-24 11:00:38,477 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-24 11:00:38,477 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-24 11:00:38,477 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-24 11:00:38,477 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-24 11:00:38,478 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-24 11:00:38,481 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2021-03-24 11:00:38,508 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-24 11:00:38,508 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-24 11:00:38,510 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-24 11:00:38,511 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-24 11:00:38,511 INFO L138 SettingsManager]: * Use SBE=true [2021-03-24 11:00:38,511 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-24 11:00:38,511 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-24 11:00:38,511 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-24 11:00:38,511 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-24 11:00:38,511 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-24 11:00:38,512 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-24 11:00:38,512 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-24 11:00:38,512 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-24 11:00:38,512 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-24 11:00:38,512 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-24 11:00:38,512 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-24 11:00:38,512 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-24 11:00:38,512 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-24 11:00:38,512 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-24 11:00:38,513 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-24 11:00:38,513 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-24 11:00:38,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-24 11:00:38,513 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-24 11:00:38,513 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-24 11:00:38,513 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-24 11:00:38,513 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-24 11:00:38,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-24 11:00:38,513 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-24 11:00:38,513 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-24 11:00:38,513 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-24 11:00:38,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-24 11:00:38,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-24 11:00:38,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-24 11:00:38,831 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-24 11:00:38,831 INFO L275 PluginConnector]: CDTParser initialized [2021-03-24 11:00:38,832 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_pso.opt.i [2021-03-24 11:00:38,874 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3380d81e2/5a6a6d3534bf407fb85e7ec5dfe3a61b/FLAG76ece80dd [2021-03-24 11:00:39,361 INFO L306 CDTParser]: Found 1 translation units. [2021-03-24 11:00:39,362 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_pso.opt.i [2021-03-24 11:00:39,380 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3380d81e2/5a6a6d3534bf407fb85e7ec5dfe3a61b/FLAG76ece80dd [2021-03-24 11:00:39,867 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3380d81e2/5a6a6d3534bf407fb85e7ec5dfe3a61b [2021-03-24 11:00:39,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-24 11:00:39,871 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-24 11:00:39,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-24 11:00:39,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-24 11:00:39,880 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-24 11:00:39,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.03 11:00:39" (1/1) ... [2021-03-24 11:00:39,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3841ed9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 11:00:39, skipping insertion in model container [2021-03-24 11:00:39,882 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.03 11:00:39" (1/1) ... [2021-03-24 11:00:39,887 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-24 11:00:39,922 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-24 11:00:40,054 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/safe004_pso.opt.i[949,962] [2021-03-24 11:00:40,225 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-24 11:00:40,230 INFO L203 MainTranslator]: Completed pre-run [2021-03-24 11:00:40,240 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/safe004_pso.opt.i[949,962] [2021-03-24 11:00:40,288 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-24 11:00:40,336 INFO L208 MainTranslator]: Completed translation [2021-03-24 11:00:40,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 11:00:40 WrapperNode [2021-03-24 11:00:40,337 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-24 11:00:40,340 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-24 11:00:40,340 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-24 11:00:40,340 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-24 11:00:40,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 11:00:40" (1/1) ... [2021-03-24 11:00:40,371 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 11:00:40" (1/1) ... [2021-03-24 11:00:40,400 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-24 11:00:40,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-24 11:00:40,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-24 11:00:40,401 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-24 11:00:40,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 11:00:40" (1/1) ... [2021-03-24 11:00:40,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 11:00:40" (1/1) ... [2021-03-24 11:00:40,428 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 11:00:40" (1/1) ... [2021-03-24 11:00:40,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 11:00:40" (1/1) ... [2021-03-24 11:00:40,434 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 11:00:40" (1/1) ... [2021-03-24 11:00:40,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 11:00:40" (1/1) ... [2021-03-24 11:00:40,438 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 11:00:40" (1/1) ... [2021-03-24 11:00:40,457 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-24 11:00:40,458 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-24 11:00:40,458 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-24 11:00:40,458 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-24 11:00:40,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 11:00:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-24 11:00:40,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-24 11:00:40,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-24 11:00:40,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-24 11:00:40,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-24 11:00:40,508 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-24 11:00:40,508 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-24 11:00:40,508 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-24 11:00:40,508 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-24 11:00:40,508 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-24 11:00:40,508 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-24 11:00:40,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-24 11:00:40,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-24 11:00:40,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-24 11:00:40,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-24 11:00:40,510 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-24 11:00:41,828 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-24 11:00:41,828 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-24 11:00:41,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.03 11:00:41 BoogieIcfgContainer [2021-03-24 11:00:41,829 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-24 11:00:41,830 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-24 11:00:41,830 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-24 11:00:41,832 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-24 11:00:41,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.03 11:00:39" (1/3) ... [2021-03-24 11:00:41,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50110a3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.03 11:00:41, skipping insertion in model container [2021-03-24 11:00:41,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 11:00:40" (2/3) ... [2021-03-24 11:00:41,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50110a3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.03 11:00:41, skipping insertion in model container [2021-03-24 11:00:41,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.03 11:00:41" (3/3) ... [2021-03-24 11:00:41,834 INFO L111 eAbstractionObserver]: Analyzing ICFG safe004_pso.opt.i [2021-03-24 11:00:41,838 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-24 11:00:41,841 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-24 11:00:41,841 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-24 11:00:41,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,862 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,862 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,862 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,862 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,864 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,864 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,864 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,864 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,864 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,864 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,864 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,864 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,865 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,865 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,865 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,865 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,865 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,865 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,866 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,866 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,868 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,868 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,868 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,868 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,868 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,868 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,869 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,869 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,872 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,872 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,872 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,872 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,872 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,872 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,872 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,872 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,872 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,873 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,873 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,873 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,874 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,874 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,874 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,874 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,874 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,874 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,875 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,875 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,875 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,875 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,876 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,876 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,876 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,876 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,876 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,876 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,876 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,876 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,876 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,876 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:00:41,877 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-24 11:00:41,889 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-24 11:00:41,901 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-24 11:00:41,901 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-24 11:00:41,901 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-24 11:00:41,901 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-24 11:00:41,901 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-24 11:00:41,901 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-24 11:00:41,901 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-24 11:00:41,902 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-24 11:00:41,908 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-03-24 11:00:41,930 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-24 11:00:41,931 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 11:00:41,933 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-24 11:00:41,933 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow [2021-03-24 11:00:41,936 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2021-03-24 11:00:41,937 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-24 11:00:41,943 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-24 11:00:41,944 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-24 11:00:41,945 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 197 flow [2021-03-24 11:00:41,957 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-24 11:00:41,957 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 11:00:41,957 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-24 11:00:41,959 INFO L142 LiptonReduction]: Number of co-enabled transitions 1686 [2021-03-24 11:00:43,217 WARN L205 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2021-03-24 11:00:43,445 WARN L205 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-24 11:00:44,774 WARN L205 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-24 11:00:45,323 WARN L205 SmtUtils]: Spent 547.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-24 11:00:45,466 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-24 11:00:45,765 WARN L205 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-24 11:00:46,549 WARN L205 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-24 11:00:46,792 WARN L205 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-24 11:00:47,325 WARN L205 SmtUtils]: Spent 512.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-24 11:00:47,915 WARN L205 SmtUtils]: Spent 579.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-24 11:00:48,034 INFO L154 LiptonReduction]: Checked pairs total: 2882 [2021-03-24 11:00:48,034 INFO L156 LiptonReduction]: Total number of compositions: 64 [2021-03-24 11:00:48,049 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6113 [2021-03-24 11:00:48,065 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2021-03-24 11:00:48,065 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 11:00:48,065 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:00:48,065 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 11:00:48,066 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:00:48,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:00:48,078 INFO L82 PathProgramCache]: Analyzing trace with hash 788348067, now seen corresponding path program 1 times [2021-03-24 11:00:48,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:00:48,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205276453] [2021-03-24 11:00:48,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:00:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 11:00:48,389 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:00:48,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:00:48,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:00:48,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:00:48,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-24 11:00:48,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205276453] [2021-03-24 11:00:48,413 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 11:00:48,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-24 11:00:48,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076772599] [2021-03-24 11:00:48,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-24 11:00:48,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 11:00:48,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-24 11:00:48,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-24 11:00:48,428 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 161 [2021-03-24 11:00:48,432 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:48,432 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 11:00:48,432 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 161 [2021-03-24 11:00:48,433 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 11:00:48,532 INFO L129 PetriNetUnfolder]: 69/198 cut-off events. [2021-03-24 11:00:48,532 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 11:00:48,533 INFO L84 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 198 events. 69/198 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 921 event pairs, 39 based on Foata normal form. 11/192 useless extension candidates. Maximal degree in co-relation 307. Up to 89 conditions per place. [2021-03-24 11:00:48,535 INFO L132 encePairwiseOnDemand]: 157/161 looper letters, 9 selfloop transitions, 2 changer transitions 5/41 dead transitions. [2021-03-24 11:00:48,535 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 41 transitions, 117 flow [2021-03-24 11:00:48,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-24 11:00:48,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-24 11:00:48,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2021-03-24 11:00:48,551 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8902691511387164 [2021-03-24 11:00:48,551 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 430 transitions. [2021-03-24 11:00:48,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 430 transitions. [2021-03-24 11:00:48,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 11:00:48,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 430 transitions. [2021-03-24 11:00:48,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:48,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:48,567 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:48,568 INFO L185 Difference]: Start difference. First operand has 48 places, 39 transitions, 87 flow. Second operand 3 states and 430 transitions. [2021-03-24 11:00:48,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 41 transitions, 117 flow [2021-03-24 11:00:48,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 114 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-24 11:00:48,572 INFO L241 Difference]: Finished difference. Result has 45 places, 32 transitions, 74 flow [2021-03-24 11:00:48,574 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2021-03-24 11:00:48,574 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2021-03-24 11:00:48,574 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 74 flow [2021-03-24 11:00:48,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:48,575 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:00:48,575 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 11:00:48,575 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-24 11:00:48,575 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:00:48,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:00:48,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1851944499, now seen corresponding path program 1 times [2021-03-24 11:00:48,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:00:48,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751270453] [2021-03-24 11:00:48,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:00:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 11:00:48,728 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:00:48,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:00:48,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:00:48,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:00:48,749 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 11:00:48,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 11:00:48,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 11:00:48,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751270453] [2021-03-24 11:00:48,753 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 11:00:48,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-24 11:00:48,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286177955] [2021-03-24 11:00:48,754 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-24 11:00:48,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 11:00:48,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-24 11:00:48,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-24 11:00:48,755 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 161 [2021-03-24 11:00:48,756 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:48,756 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 11:00:48,756 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 161 [2021-03-24 11:00:48,756 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 11:00:48,787 INFO L129 PetriNetUnfolder]: 0/36 cut-off events. [2021-03-24 11:00:48,788 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 11:00:48,788 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 36 events. 0/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 46 event pairs, 0 based on Foata normal form. 2/37 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-24 11:00:48,788 INFO L132 encePairwiseOnDemand]: 157/161 looper letters, 2 selfloop transitions, 2 changer transitions 3/34 dead transitions. [2021-03-24 11:00:48,788 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 34 transitions, 90 flow [2021-03-24 11:00:48,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-24 11:00:48,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-24 11:00:48,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 718 transitions. [2021-03-24 11:00:48,790 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8919254658385093 [2021-03-24 11:00:48,790 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 718 transitions. [2021-03-24 11:00:48,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 718 transitions. [2021-03-24 11:00:48,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 11:00:48,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 718 transitions. [2021-03-24 11:00:48,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.6) internal successors, (718), 5 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:48,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 161.0) internal successors, (966), 6 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:48,793 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 161.0) internal successors, (966), 6 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:48,793 INFO L185 Difference]: Start difference. First operand has 45 places, 32 transitions, 74 flow. Second operand 5 states and 718 transitions. [2021-03-24 11:00:48,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 34 transitions, 90 flow [2021-03-24 11:00:48,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 34 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-24 11:00:48,794 INFO L241 Difference]: Finished difference. Result has 46 places, 31 transitions, 80 flow [2021-03-24 11:00:48,794 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=80, PETRI_PLACES=46, PETRI_TRANSITIONS=31} [2021-03-24 11:00:48,795 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2021-03-24 11:00:48,795 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 31 transitions, 80 flow [2021-03-24 11:00:48,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:48,795 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:00:48,795 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 11:00:48,795 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-24 11:00:48,795 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:00:48,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:00:48,796 INFO L82 PathProgramCache]: Analyzing trace with hash 615852779, now seen corresponding path program 1 times [2021-03-24 11:00:48,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:00:48,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856063004] [2021-03-24 11:00:48,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:00:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 11:00:48,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:00:48,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:00:48,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:00:48,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:00:48,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:00:48,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:00:48,903 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 11:00:48,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 11:00:48,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 11:00:48,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856063004] [2021-03-24 11:00:48,907 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 11:00:48,907 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-24 11:00:48,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47690449] [2021-03-24 11:00:48,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-24 11:00:48,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 11:00:48,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-24 11:00:48,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-24 11:00:48,909 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 161 [2021-03-24 11:00:48,910 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 31 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 134.2) internal successors, (671), 5 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-24 11:00:48,910 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 11:00:48,910 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 161 [2021-03-24 11:00:48,910 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 11:00:48,974 INFO L129 PetriNetUnfolder]: 16/87 cut-off events. [2021-03-24 11:00:48,975 INFO L130 PetriNetUnfolder]: For 17/23 co-relation queries the response was YES. [2021-03-24 11:00:48,975 INFO L84 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 87 events. 16/87 cut-off events. For 17/23 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 325 event pairs, 0 based on Foata normal form. 5/92 useless extension candidates. Maximal degree in co-relation 141. Up to 16 conditions per place. [2021-03-24 11:00:48,976 INFO L132 encePairwiseOnDemand]: 154/161 looper letters, 8 selfloop transitions, 5 changer transitions 7/43 dead transitions. [2021-03-24 11:00:48,976 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 43 transitions, 151 flow [2021-03-24 11:00:48,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-24 11:00:48,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-24 11:00:48,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 820 transitions. [2021-03-24 11:00:48,978 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8488612836438924 [2021-03-24 11:00:48,978 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 820 transitions. [2021-03-24 11:00:48,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 820 transitions. [2021-03-24 11:00:48,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 11:00:48,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 820 transitions. [2021-03-24 11:00:48,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.66666666666666) internal successors, (820), 6 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:48,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 161.0) internal successors, (1127), 7 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:48,982 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 161.0) internal successors, (1127), 7 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:48,982 INFO L185 Difference]: Start difference. First operand has 46 places, 31 transitions, 80 flow. Second operand 6 states and 820 transitions. [2021-03-24 11:00:48,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 43 transitions, 151 flow [2021-03-24 11:00:48,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 141 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-24 11:00:48,984 INFO L241 Difference]: Finished difference. Result has 48 places, 33 transitions, 110 flow [2021-03-24 11:00:48,984 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=110, PETRI_PLACES=48, PETRI_TRANSITIONS=33} [2021-03-24 11:00:48,984 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 0 predicate places. [2021-03-24 11:00:48,984 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 33 transitions, 110 flow [2021-03-24 11:00:48,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 134.2) internal successors, (671), 5 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-24 11:00:48,985 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:00:48,985 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 11:00:48,985 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-24 11:00:48,985 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:00:48,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:00:48,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1218956721, now seen corresponding path program 1 times [2021-03-24 11:00:48,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:00:48,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631316926] [2021-03-24 11:00:48,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:00:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 11:00:49,058 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:00:49,059 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:00:49,060 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:00:49,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:00:49,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:00:49,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:00:49,068 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 11:00:49,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 11:00:49,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 11:00:49,072 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631316926] [2021-03-24 11:00:49,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 11:00:49,073 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-24 11:00:49,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707881691] [2021-03-24 11:00:49,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-24 11:00:49,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 11:00:49,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-24 11:00:49,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-24 11:00:49,076 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 161 [2021-03-24 11:00:49,077 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 33 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:49,077 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 11:00:49,077 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 161 [2021-03-24 11:00:49,077 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 11:00:49,146 INFO L129 PetriNetUnfolder]: 7/88 cut-off events. [2021-03-24 11:00:49,146 INFO L130 PetriNetUnfolder]: For 55/57 co-relation queries the response was YES. [2021-03-24 11:00:49,148 INFO L84 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 88 events. 7/88 cut-off events. For 55/57 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 334 event pairs, 2 based on Foata normal form. 5/93 useless extension candidates. Maximal degree in co-relation 174. Up to 20 conditions per place. [2021-03-24 11:00:49,148 INFO L132 encePairwiseOnDemand]: 156/161 looper letters, 10 selfloop transitions, 3 changer transitions 5/41 dead transitions. [2021-03-24 11:00:49,148 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 41 transitions, 196 flow [2021-03-24 11:00:49,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-24 11:00:49,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-24 11:00:49,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 950 transitions. [2021-03-24 11:00:49,153 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8429458740017747 [2021-03-24 11:00:49,153 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 950 transitions. [2021-03-24 11:00:49,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 950 transitions. [2021-03-24 11:00:49,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 11:00:49,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 950 transitions. [2021-03-24 11:00:49,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.71428571428572) internal successors, (950), 7 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:49,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 161.0) internal successors, (1288), 8 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:49,158 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 161.0) internal successors, (1288), 8 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:49,159 INFO L185 Difference]: Start difference. First operand has 48 places, 33 transitions, 110 flow. Second operand 7 states and 950 transitions. [2021-03-24 11:00:49,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 41 transitions, 196 flow [2021-03-24 11:00:49,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 41 transitions, 169 flow, removed 9 selfloop flow, removed 3 redundant places. [2021-03-24 11:00:49,162 INFO L241 Difference]: Finished difference. Result has 54 places, 33 transitions, 116 flow [2021-03-24 11:00:49,162 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=116, PETRI_PLACES=54, PETRI_TRANSITIONS=33} [2021-03-24 11:00:49,163 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 6 predicate places. [2021-03-24 11:00:49,163 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 33 transitions, 116 flow [2021-03-24 11:00:49,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:49,164 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:00:49,164 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 11:00:49,164 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-24 11:00:49,164 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:00:49,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:00:49,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1250956628, now seen corresponding path program 1 times [2021-03-24 11:00:49,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:00:49,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878809603] [2021-03-24 11:00:49,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:00:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 11:00:49,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:00:49,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:00:49,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:00:49,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:00:49,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:00:49,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:00:49,236 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 11:00:49,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 11:00:49,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 11:00:49,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878809603] [2021-03-24 11:00:49,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 11:00:49,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-24 11:00:49,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737694669] [2021-03-24 11:00:49,242 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-24 11:00:49,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 11:00:49,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-24 11:00:49,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-24 11:00:49,246 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 161 [2021-03-24 11:00:49,247 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 33 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:49,247 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 11:00:49,247 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 161 [2021-03-24 11:00:49,247 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 11:00:49,294 INFO L129 PetriNetUnfolder]: 5/85 cut-off events. [2021-03-24 11:00:49,294 INFO L130 PetriNetUnfolder]: For 133/135 co-relation queries the response was YES. [2021-03-24 11:00:49,295 INFO L84 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 85 events. 5/85 cut-off events. For 133/135 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 347 event pairs, 2 based on Foata normal form. 5/90 useless extension candidates. Maximal degree in co-relation 195. Up to 22 conditions per place. [2021-03-24 11:00:49,295 INFO L132 encePairwiseOnDemand]: 154/161 looper letters, 6 selfloop transitions, 5 changer transitions 5/39 dead transitions. [2021-03-24 11:00:49,295 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 39 transitions, 191 flow [2021-03-24 11:00:49,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-24 11:00:49,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-24 11:00:49,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 682 transitions. [2021-03-24 11:00:49,297 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8472049689440994 [2021-03-24 11:00:49,297 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 682 transitions. [2021-03-24 11:00:49,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 682 transitions. [2021-03-24 11:00:49,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 11:00:49,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 682 transitions. [2021-03-24 11:00:49,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.4) internal successors, (682), 5 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:49,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 161.0) internal successors, (966), 6 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:49,300 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 161.0) internal successors, (966), 6 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:49,300 INFO L185 Difference]: Start difference. First operand has 54 places, 33 transitions, 116 flow. Second operand 5 states and 682 transitions. [2021-03-24 11:00:49,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 39 transitions, 191 flow [2021-03-24 11:00:49,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 173 flow, removed 6 selfloop flow, removed 5 redundant places. [2021-03-24 11:00:49,304 INFO L241 Difference]: Finished difference. Result has 51 places, 33 transitions, 124 flow [2021-03-24 11:00:49,304 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=51, PETRI_TRANSITIONS=33} [2021-03-24 11:00:49,304 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2021-03-24 11:00:49,304 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 33 transitions, 124 flow [2021-03-24 11:00:49,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:49,305 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:00:49,305 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 11:00:49,305 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-24 11:00:49,306 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:00:49,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:00:49,307 INFO L82 PathProgramCache]: Analyzing trace with hash -945109024, now seen corresponding path program 2 times [2021-03-24 11:00:49,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:00:49,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824393392] [2021-03-24 11:00:49,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:00:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 11:00:49,347 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:00:49,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:00:49,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:00:49,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:00:49,351 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 11:00:49,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 11:00:49,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 11:00:49,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824393392] [2021-03-24 11:00:49,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 11:00:49,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-24 11:00:49,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676558433] [2021-03-24 11:00:49,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-24 11:00:49,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 11:00:49,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-24 11:00:49,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-24 11:00:49,357 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 161 [2021-03-24 11:00:49,357 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 33 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 137.5) internal successors, (550), 4 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:49,357 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 11:00:49,357 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 161 [2021-03-24 11:00:49,357 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 11:00:49,389 INFO L129 PetriNetUnfolder]: 2/58 cut-off events. [2021-03-24 11:00:49,389 INFO L130 PetriNetUnfolder]: For 62/65 co-relation queries the response was YES. [2021-03-24 11:00:49,389 INFO L84 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 58 events. 2/58 cut-off events. For 62/65 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 144 event pairs, 0 based on Foata normal form. 3/61 useless extension candidates. Maximal degree in co-relation 130. Up to 12 conditions per place. [2021-03-24 11:00:49,389 INFO L132 encePairwiseOnDemand]: 157/161 looper letters, 5 selfloop transitions, 2 changer transitions 5/36 dead transitions. [2021-03-24 11:00:49,389 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 36 transitions, 169 flow [2021-03-24 11:00:49,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-24 11:00:49,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-24 11:00:49,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 693 transitions. [2021-03-24 11:00:49,391 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8608695652173913 [2021-03-24 11:00:49,391 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 693 transitions. [2021-03-24 11:00:49,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 693 transitions. [2021-03-24 11:00:49,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 11:00:49,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 693 transitions. [2021-03-24 11:00:49,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.6) internal successors, (693), 5 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:49,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 161.0) internal successors, (966), 6 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:49,394 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 161.0) internal successors, (966), 6 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:49,394 INFO L185 Difference]: Start difference. First operand has 51 places, 33 transitions, 124 flow. Second operand 5 states and 693 transitions. [2021-03-24 11:00:49,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 36 transitions, 169 flow [2021-03-24 11:00:49,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 36 transitions, 152 flow, removed 3 selfloop flow, removed 4 redundant places. [2021-03-24 11:00:49,396 INFO L241 Difference]: Finished difference. Result has 53 places, 31 transitions, 108 flow [2021-03-24 11:00:49,396 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=53, PETRI_TRANSITIONS=31} [2021-03-24 11:00:49,397 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 5 predicate places. [2021-03-24 11:00:49,397 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 31 transitions, 108 flow [2021-03-24 11:00:49,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 137.5) internal successors, (550), 4 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:49,398 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:00:49,398 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 11:00:49,398 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-24 11:00:49,399 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:00:49,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:00:49,405 INFO L82 PathProgramCache]: Analyzing trace with hash 739492848, now seen corresponding path program 1 times [2021-03-24 11:00:49,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:00:49,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796617651] [2021-03-24 11:00:49,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:00:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 11:00:49,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:00:49,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:00:49,496 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:00:49,496 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:00:49,498 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:00:49,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 11:00:49,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:00:49,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-24 11:00:49,519 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-24 11:00:49,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-24 11:00:49,542 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:00:49,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-24 11:00:49,553 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 11:00:49,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 11:00:49,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 11:00:49,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796617651] [2021-03-24 11:00:49,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 11:00:49,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-24 11:00:49,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523065311] [2021-03-24 11:00:49,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-24 11:00:49,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 11:00:49,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-24 11:00:49,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-03-24 11:00:49,562 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 161 [2021-03-24 11:00:49,565 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 31 transitions, 108 flow. Second operand has 8 states, 8 states have (on average 122.0) internal successors, (976), 8 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:49,565 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 11:00:49,565 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 161 [2021-03-24 11:00:49,565 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 11:00:49,677 INFO L129 PetriNetUnfolder]: 81/196 cut-off events. [2021-03-24 11:00:49,677 INFO L130 PetriNetUnfolder]: For 232/237 co-relation queries the response was YES. [2021-03-24 11:00:49,677 INFO L84 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 196 events. 81/196 cut-off events. For 232/237 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 725 event pairs, 26 based on Foata normal form. 13/206 useless extension candidates. Maximal degree in co-relation 432. Up to 124 conditions per place. [2021-03-24 11:00:49,678 INFO L132 encePairwiseOnDemand]: 151/161 looper letters, 9 selfloop transitions, 8 changer transitions 8/44 dead transitions. [2021-03-24 11:00:49,678 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 44 transitions, 192 flow [2021-03-24 11:00:49,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-24 11:00:49,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-24 11:00:49,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1116 transitions. [2021-03-24 11:00:49,681 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7701863354037267 [2021-03-24 11:00:49,681 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1116 transitions. [2021-03-24 11:00:49,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1116 transitions. [2021-03-24 11:00:49,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 11:00:49,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1116 transitions. [2021-03-24 11:00:49,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 124.0) internal successors, (1116), 9 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:49,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 161.0) internal successors, (1610), 10 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:49,686 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 161.0) internal successors, (1610), 10 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:49,686 INFO L185 Difference]: Start difference. First operand has 53 places, 31 transitions, 108 flow. Second operand 9 states and 1116 transitions. [2021-03-24 11:00:49,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 44 transitions, 192 flow [2021-03-24 11:00:49,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 44 transitions, 178 flow, removed 4 selfloop flow, removed 6 redundant places. [2021-03-24 11:00:49,688 INFO L241 Difference]: Finished difference. Result has 56 places, 34 transitions, 138 flow [2021-03-24 11:00:49,688 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=138, PETRI_PLACES=56, PETRI_TRANSITIONS=34} [2021-03-24 11:00:49,688 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 8 predicate places. [2021-03-24 11:00:49,688 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 34 transitions, 138 flow [2021-03-24 11:00:49,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 122.0) internal successors, (976), 8 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:49,689 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:00:49,689 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 11:00:49,689 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-24 11:00:49,689 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:00:49,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:00:49,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1449394629, now seen corresponding path program 1 times [2021-03-24 11:00:49,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:00:49,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786808016] [2021-03-24 11:00:49,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:00:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 11:00:49,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:00:49,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:00:49,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:00:49,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:00:49,763 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-24 11:00:49,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 11:00:49,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:00:49,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:00:49,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-24 11:00:49,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786808016] [2021-03-24 11:00:49,769 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 11:00:49,769 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-24 11:00:49,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329468370] [2021-03-24 11:00:49,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-24 11:00:49,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 11:00:49,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-24 11:00:49,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-24 11:00:49,771 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 161 [2021-03-24 11:00:49,771 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 34 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:49,771 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 11:00:49,771 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 161 [2021-03-24 11:00:49,771 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 11:00:49,817 INFO L129 PetriNetUnfolder]: 82/216 cut-off events. [2021-03-24 11:00:49,817 INFO L130 PetriNetUnfolder]: For 214/218 co-relation queries the response was YES. [2021-03-24 11:00:49,818 INFO L84 FinitePrefix]: Finished finitePrefix Result has 560 conditions, 216 events. 82/216 cut-off events. For 214/218 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 968 event pairs, 38 based on Foata normal form. 17/224 useless extension candidates. Maximal degree in co-relation 530. Up to 94 conditions per place. [2021-03-24 11:00:49,820 INFO L132 encePairwiseOnDemand]: 155/161 looper letters, 8 selfloop transitions, 8 changer transitions 0/44 dead transitions. [2021-03-24 11:00:49,820 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 44 transitions, 190 flow [2021-03-24 11:00:49,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-24 11:00:49,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-24 11:00:49,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 683 transitions. [2021-03-24 11:00:49,822 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8484472049689441 [2021-03-24 11:00:49,822 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 683 transitions. [2021-03-24 11:00:49,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 683 transitions. [2021-03-24 11:00:49,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 11:00:49,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 683 transitions. [2021-03-24 11:00:49,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.6) internal successors, (683), 5 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:49,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 161.0) internal successors, (966), 6 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:49,824 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 161.0) internal successors, (966), 6 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:49,825 INFO L185 Difference]: Start difference. First operand has 56 places, 34 transitions, 138 flow. Second operand 5 states and 683 transitions. [2021-03-24 11:00:49,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 44 transitions, 190 flow [2021-03-24 11:00:49,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 44 transitions, 172 flow, removed 2 selfloop flow, removed 7 redundant places. [2021-03-24 11:00:49,829 INFO L241 Difference]: Finished difference. Result has 54 places, 41 transitions, 180 flow [2021-03-24 11:00:49,829 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=180, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2021-03-24 11:00:49,829 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 6 predicate places. [2021-03-24 11:00:49,829 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 180 flow [2021-03-24 11:00:49,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:49,829 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:00:49,830 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 11:00:49,830 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-24 11:00:49,830 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:00:49,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:00:49,830 INFO L82 PathProgramCache]: Analyzing trace with hash 903678916, now seen corresponding path program 1 times [2021-03-24 11:00:49,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:00:49,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143087661] [2021-03-24 11:00:49,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:00:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 11:00:49,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:00:49,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:00:49,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:00:49,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:00:49,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:00:49,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:00:49,895 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-24 11:00:49,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 11:00:49,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:00:49,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:00:49,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 11:00:49,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143087661] [2021-03-24 11:00:49,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 11:00:49,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-24 11:00:49,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888042240] [2021-03-24 11:00:49,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-24 11:00:49,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 11:00:49,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-24 11:00:49,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-24 11:00:49,903 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 161 [2021-03-24 11:00:49,904 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 180 flow. Second operand has 5 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:49,904 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 11:00:49,904 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 161 [2021-03-24 11:00:49,904 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 11:00:49,963 INFO L129 PetriNetUnfolder]: 42/152 cut-off events. [2021-03-24 11:00:49,963 INFO L130 PetriNetUnfolder]: For 209/306 co-relation queries the response was YES. [2021-03-24 11:00:49,964 INFO L84 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 152 events. 42/152 cut-off events. For 209/306 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 623 event pairs, 7 based on Foata normal form. 66/214 useless extension candidates. Maximal degree in co-relation 489. Up to 79 conditions per place. [2021-03-24 11:00:49,965 INFO L132 encePairwiseOnDemand]: 155/161 looper letters, 5 selfloop transitions, 15 changer transitions 3/51 dead transitions. [2021-03-24 11:00:49,965 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 51 transitions, 284 flow [2021-03-24 11:00:49,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-24 11:00:49,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-24 11:00:49,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 956 transitions. [2021-03-24 11:00:49,968 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8482697426796806 [2021-03-24 11:00:49,968 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 956 transitions. [2021-03-24 11:00:49,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 956 transitions. [2021-03-24 11:00:49,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 11:00:49,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 956 transitions. [2021-03-24 11:00:49,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.57142857142858) internal successors, (956), 7 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:49,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 161.0) internal successors, (1288), 8 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:49,972 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 161.0) internal successors, (1288), 8 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:49,972 INFO L185 Difference]: Start difference. First operand has 54 places, 41 transitions, 180 flow. Second operand 7 states and 956 transitions. [2021-03-24 11:00:49,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 51 transitions, 284 flow [2021-03-24 11:00:49,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 51 transitions, 280 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-24 11:00:49,974 INFO L241 Difference]: Finished difference. Result has 62 places, 48 transitions, 275 flow [2021-03-24 11:00:49,974 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=275, PETRI_PLACES=62, PETRI_TRANSITIONS=48} [2021-03-24 11:00:49,975 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 14 predicate places. [2021-03-24 11:00:49,975 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 48 transitions, 275 flow [2021-03-24 11:00:49,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:49,975 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:00:49,975 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 11:00:49,975 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-24 11:00:49,975 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:00:49,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:00:49,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1902063160, now seen corresponding path program 1 times [2021-03-24 11:00:49,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:00:49,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818846720] [2021-03-24 11:00:49,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:00:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 11:00:50,048 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:00:50,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:00:50,049 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:00:50,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:00:50,053 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:00:50,053 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:00:50,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:00:50,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:00:50,062 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-24 11:00:50,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 11:00:50,070 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:00:50,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:00:50,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 11:00:50,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818846720] [2021-03-24 11:00:50,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 11:00:50,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-24 11:00:50,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598250436] [2021-03-24 11:00:50,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-24 11:00:50,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 11:00:50,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-24 11:00:50,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-24 11:00:50,074 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 161 [2021-03-24 11:00:50,074 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 48 transitions, 275 flow. Second operand has 6 states, 6 states have (on average 133.83333333333334) internal successors, (803), 6 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:50,074 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 11:00:50,075 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 161 [2021-03-24 11:00:50,075 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 11:00:50,157 INFO L129 PetriNetUnfolder]: 28/120 cut-off events. [2021-03-24 11:00:50,157 INFO L130 PetriNetUnfolder]: For 421/543 co-relation queries the response was YES. [2021-03-24 11:00:50,158 INFO L84 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 120 events. 28/120 cut-off events. For 421/543 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 478 event pairs, 1 based on Foata normal form. 59/176 useless extension candidates. Maximal degree in co-relation 487. Up to 69 conditions per place. [2021-03-24 11:00:50,158 INFO L132 encePairwiseOnDemand]: 155/161 looper letters, 2 selfloop transitions, 19 changer transitions 3/52 dead transitions. [2021-03-24 11:00:50,158 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 52 transitions, 353 flow [2021-03-24 11:00:50,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-24 11:00:50,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-24 11:00:50,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1223 transitions. [2021-03-24 11:00:50,161 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8440303657694962 [2021-03-24 11:00:50,161 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1223 transitions. [2021-03-24 11:00:50,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1223 transitions. [2021-03-24 11:00:50,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 11:00:50,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1223 transitions. [2021-03-24 11:00:50,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 135.88888888888889) internal successors, (1223), 9 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:50,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 161.0) internal successors, (1610), 10 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:50,165 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 161.0) internal successors, (1610), 10 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:50,165 INFO L185 Difference]: Start difference. First operand has 62 places, 48 transitions, 275 flow. Second operand 9 states and 1223 transitions. [2021-03-24 11:00:50,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 52 transitions, 353 flow [2021-03-24 11:00:50,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 52 transitions, 300 flow, removed 18 selfloop flow, removed 5 redundant places. [2021-03-24 11:00:50,168 INFO L241 Difference]: Finished difference. Result has 68 places, 49 transitions, 283 flow [2021-03-24 11:00:50,168 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=283, PETRI_PLACES=68, PETRI_TRANSITIONS=49} [2021-03-24 11:00:50,168 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 20 predicate places. [2021-03-24 11:00:50,168 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 49 transitions, 283 flow [2021-03-24 11:00:50,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 133.83333333333334) internal successors, (803), 6 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:50,169 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:00:50,169 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 11:00:50,169 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-24 11:00:50,169 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:00:50,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:00:50,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1407423664, now seen corresponding path program 1 times [2021-03-24 11:00:50,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:00:50,169 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843608762] [2021-03-24 11:00:50,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:00:50,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 11:00:50,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:00:50,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:00:50,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:00:50,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:00:50,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:00:50,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 11:00:50,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:00:50,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-24 11:00:50,268 INFO L142 QuantifierPusher]: treesize reduction 4, result has 90.7 percent of original size [2021-03-24 11:00:50,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-24 11:00:50,293 INFO L142 QuantifierPusher]: treesize reduction 17, result has 76.7 percent of original size [2021-03-24 11:00:50,297 INFO L147 QuantifierPusher]: treesize reduction 9, result has 83.9 percent of original size 47 [2021-03-24 11:00:50,328 INFO L142 QuantifierPusher]: treesize reduction 17, result has 77.9 percent of original size [2021-03-24 11:00:50,330 INFO L147 QuantifierPusher]: treesize reduction 9, result has 85.0 percent of original size 51 [2021-03-24 11:00:50,365 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:00:50,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-24 11:00:50,393 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:00:50,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-24 11:00:50,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:00:50,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-24 11:00:50,452 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 11:00:50,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 11:00:50,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 11:00:50,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843608762] [2021-03-24 11:00:50,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 11:00:50,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-24 11:00:50,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614291344] [2021-03-24 11:00:50,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-24 11:00:50,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 11:00:50,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-24 11:00:50,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-03-24 11:00:50,460 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 161 [2021-03-24 11:00:50,460 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 49 transitions, 283 flow. Second operand has 12 states, 12 states have (on average 117.16666666666667) internal successors, (1406), 12 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:50,461 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 11:00:50,461 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 161 [2021-03-24 11:00:50,461 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 11:00:50,670 INFO L129 PetriNetUnfolder]: 60/237 cut-off events. [2021-03-24 11:00:50,670 INFO L130 PetriNetUnfolder]: For 1040/1118 co-relation queries the response was YES. [2021-03-24 11:00:50,671 INFO L84 FinitePrefix]: Finished finitePrefix Result has 952 conditions, 237 events. 60/237 cut-off events. For 1040/1118 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 1418 event pairs, 0 based on Foata normal form. 29/257 useless extension candidates. Maximal degree in co-relation 915. Up to 75 conditions per place. [2021-03-24 11:00:50,671 INFO L132 encePairwiseOnDemand]: 152/161 looper letters, 15 selfloop transitions, 8 changer transitions 8/61 dead transitions. [2021-03-24 11:00:50,671 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 61 transitions, 405 flow [2021-03-24 11:00:50,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-24 11:00:50,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-24 11:00:50,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1190 transitions. [2021-03-24 11:00:50,674 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7391304347826086 [2021-03-24 11:00:50,674 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1190 transitions. [2021-03-24 11:00:50,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1190 transitions. [2021-03-24 11:00:50,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 11:00:50,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1190 transitions. [2021-03-24 11:00:50,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 119.0) internal successors, (1190), 10 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:50,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 161.0) internal successors, (1771), 11 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:50,678 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 161.0) internal successors, (1771), 11 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:50,678 INFO L185 Difference]: Start difference. First operand has 68 places, 49 transitions, 283 flow. Second operand 10 states and 1190 transitions. [2021-03-24 11:00:50,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 61 transitions, 405 flow [2021-03-24 11:00:50,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 61 transitions, 323 flow, removed 24 selfloop flow, removed 9 redundant places. [2021-03-24 11:00:50,682 INFO L241 Difference]: Finished difference. Result has 71 places, 48 transitions, 236 flow [2021-03-24 11:00:50,682 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=236, PETRI_PLACES=71, PETRI_TRANSITIONS=48} [2021-03-24 11:00:50,682 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 23 predicate places. [2021-03-24 11:00:50,682 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 48 transitions, 236 flow [2021-03-24 11:00:50,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 117.16666666666667) internal successors, (1406), 12 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:00:50,683 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:00:50,683 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 11:00:50,683 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-24 11:00:50,683 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:00:50,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:00:50,683 INFO L82 PathProgramCache]: Analyzing trace with hash 391927184, now seen corresponding path program 2 times [2021-03-24 11:00:50,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:00:50,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92410319] [2021-03-24 11:00:50,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:00:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-24 11:00:50,709 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-24 11:00:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-24 11:00:50,758 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-24 11:00:50,797 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-24 11:00:50,798 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-24 11:00:50,798 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-24 11:00:50,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.03 11:00:50 BasicIcfg [2021-03-24 11:00:50,869 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-24 11:00:50,869 INFO L168 Benchmark]: Toolchain (without parser) took 10997.79 ms. Allocated memory was 406.8 MB in the beginning and 717.2 MB in the end (delta: 310.4 MB). Free memory was 369.3 MB in the beginning and 638.1 MB in the end (delta: -268.8 MB). Peak memory consumption was 39.9 MB. Max. memory is 16.0 GB. [2021-03-24 11:00:50,869 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 406.8 MB. Free memory was 388.3 MB in the beginning and 388.2 MB in the end (delta: 77.2 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-24 11:00:50,870 INFO L168 Benchmark]: CACSL2BoogieTranslator took 464.08 ms. Allocated memory is still 406.8 MB. Free memory was 369.1 MB in the beginning and 365.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.0 GB. [2021-03-24 11:00:50,870 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.55 ms. Allocated memory is still 406.8 MB. Free memory was 364.6 MB in the beginning and 362.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-24 11:00:50,870 INFO L168 Benchmark]: Boogie Preprocessor took 56.87 ms. Allocated memory is still 406.8 MB. Free memory was 362.5 MB in the beginning and 360.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-24 11:00:50,870 INFO L168 Benchmark]: RCFGBuilder took 1371.30 ms. Allocated memory is still 406.8 MB. Free memory was 360.5 MB in the beginning and 309.0 MB in the end (delta: 51.4 MB). Peak memory consumption was 157.3 MB. Max. memory is 16.0 GB. [2021-03-24 11:00:50,870 INFO L168 Benchmark]: TraceAbstraction took 9038.47 ms. Allocated memory was 406.8 MB in the beginning and 717.2 MB in the end (delta: 310.4 MB). Free memory was 308.0 MB in the beginning and 638.1 MB in the end (delta: -330.1 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-24 11:00:50,871 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 406.8 MB. Free memory was 388.3 MB in the beginning and 388.2 MB in the end (delta: 77.2 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 464.08 ms. Allocated memory is still 406.8 MB. Free memory was 369.1 MB in the beginning and 365.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 60.55 ms. Allocated memory is still 406.8 MB. Free memory was 364.6 MB in the beginning and 362.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 56.87 ms. Allocated memory is still 406.8 MB. Free memory was 362.5 MB in the beginning and 360.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1371.30 ms. Allocated memory is still 406.8 MB. Free memory was 360.5 MB in the beginning and 309.0 MB in the end (delta: 51.4 MB). Peak memory consumption was 157.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 9038.47 ms. Allocated memory was 406.8 MB in the beginning and 717.2 MB in the end (delta: 310.4 MB). Free memory was 308.0 MB in the beginning and 638.1 MB in the end (delta: -330.1 MB). There was no memory consumed. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6102.9ms, 102 PlacesBefore, 48 PlacesAfterwards, 94 TransitionsBefore, 39 TransitionsAfterwards, 1686 CoEnabledTransitionPairs, 4 FixpointIterations, 26 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 64 TotalNumberOfCompositions, 2882 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1232, positive: 1160, positive conditional: 0, positive unconditional: 1160, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 772, positive: 752, positive conditional: 0, positive unconditional: 752, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 772, positive: 752, positive conditional: 0, positive unconditional: 752, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1232, positive: 408, positive conditional: 0, positive unconditional: 408, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 772, unknown conditional: 0, unknown unconditional: 772] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 54, Positive conditional cache size: 0, Positive unconditional cache size: 54, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1882; [L819] FCALL, FORK 0 pthread_create(&t1882, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] 0 pthread_t t1883; [L821] FCALL, FORK 0 pthread_create(&t1883, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L822] 0 pthread_t t1884; [L823] FCALL, FORK 0 pthread_create(&t1884, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L741] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L848] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 6.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 8899.7ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1035.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6156.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 67 SDtfs, 71 SDslu, 89 SDs, 0 SdLazy, 315 SolverSat, 82 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 337.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 458.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=283occurred in iteration=10, InterpolantAutomatonStates: 71, 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: 59.1ms SsaConstructionTime, 408.7ms SatisfiabilityAnalysisTime, 952.0ms InterpolantComputationTime, 287 NumberOfCodeBlocks, 287 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 245 ConstructedInterpolants, 0 QuantifiedInterpolants, 1115 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...