/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe001_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 18:31:37,486 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 18:31:37,488 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 18:31:37,522 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 18:31:37,523 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 18:31:37,531 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 18:31:37,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 18:31:37,535 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 18:31:37,537 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 18:31:37,539 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 18:31:37,540 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 18:31:37,543 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 18:31:37,543 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 18:31:37,545 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 18:31:37,548 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 18:31:37,549 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 18:31:37,551 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 18:31:37,552 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 18:31:37,554 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 18:31:37,560 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 18:31:37,562 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 18:31:37,564 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 18:31:37,566 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 18:31:37,566 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 18:31:37,579 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 18:31:37,580 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 18:31:37,580 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 18:31:37,581 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 18:31:37,585 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 18:31:37,585 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 18:31:37,586 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 18:31:37,590 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 18:31:37,590 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 18:31:37,591 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 18:31:37,594 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 18:31:37,595 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 18:31:37,595 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 18:31:37,596 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 18:31:37,596 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 18:31:37,597 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 18:31:37,599 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 18:31:37,600 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf [2020-10-11 18:31:37,636 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 18:31:37,636 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 18:31:37,638 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 18:31:37,638 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 18:31:37,638 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 18:31:37,638 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 18:31:37,639 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 18:31:37,639 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 18:31:37,639 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 18:31:37,639 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 18:31:37,639 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 18:31:37,639 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 18:31:37,640 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 18:31:37,640 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 18:31:37,640 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 18:31:37,640 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 18:31:37,640 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 18:31:37,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 18:31:37,641 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 18:31:37,641 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 18:31:37,641 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 18:31:37,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 18:31:37,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 18:31:37,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 18:31:37,642 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 18:31:37,642 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 18:31:37,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 18:31:37,643 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-11 18:31:37,643 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-11 18:31:37,643 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 18:31:37,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 18:31:37,954 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 18:31:37,958 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 18:31:37,959 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 18:31:37,959 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 18:31:37,960 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_pso.opt.i [2020-10-11 18:31:38,040 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bf4c7684/23e7292245664ff4a0f10a73a7b563e2/FLAGa52d7f6c0 [2020-10-11 18:31:38,604 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 18:31:38,605 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_pso.opt.i [2020-10-11 18:31:38,625 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bf4c7684/23e7292245664ff4a0f10a73a7b563e2/FLAGa52d7f6c0 [2020-10-11 18:31:38,861 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bf4c7684/23e7292245664ff4a0f10a73a7b563e2 [2020-10-11 18:31:38,872 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 18:31:38,874 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 18:31:38,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 18:31:38,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 18:31:38,879 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 18:31:38,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:31:38" (1/1) ... [2020-10-11 18:31:38,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38f274e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:31:38, skipping insertion in model container [2020-10-11 18:31:38,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:31:38" (1/1) ... [2020-10-11 18:31:38,892 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 18:31:38,961 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 18:31:39,472 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:31:39,484 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 18:31:39,597 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:31:39,683 INFO L208 MainTranslator]: Completed translation [2020-10-11 18:31:39,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:31:39 WrapperNode [2020-10-11 18:31:39,684 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 18:31:39,685 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 18:31:39,685 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 18:31:39,685 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 18:31:39,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:31:39" (1/1) ... [2020-10-11 18:31:39,715 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:31:39" (1/1) ... [2020-10-11 18:31:39,749 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 18:31:39,750 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 18:31:39,750 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 18:31:39,750 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 18:31:39,759 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:31:39" (1/1) ... [2020-10-11 18:31:39,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:31:39" (1/1) ... [2020-10-11 18:31:39,765 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:31:39" (1/1) ... [2020-10-11 18:31:39,765 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:31:39" (1/1) ... [2020-10-11 18:31:39,780 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:31:39" (1/1) ... [2020-10-11 18:31:39,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:31:39" (1/1) ... [2020-10-11 18:31:39,799 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:31:39" (1/1) ... [2020-10-11 18:31:39,807 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 18:31:39,808 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 18:31:39,808 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 18:31:39,808 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 18:31:39,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:31:39" (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 [2020-10-11 18:31:39,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 18:31:39,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 18:31:39,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 18:31:39,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 18:31:39,869 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 18:31:39,870 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 18:31:39,870 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 18:31:39,870 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 18:31:39,870 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-11 18:31:39,870 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-11 18:31:39,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 18:31:39,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 18:31:39,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 18:31:39,873 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 18:31:42,015 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 18:31:42,016 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 18:31:42,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:31:42 BoogieIcfgContainer [2020-10-11 18:31:42,018 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 18:31:42,020 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 18:31:42,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 18:31:42,024 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 18:31:42,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:31:38" (1/3) ... [2020-10-11 18:31:42,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e64f7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:31:42, skipping insertion in model container [2020-10-11 18:31:42,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:31:39" (2/3) ... [2020-10-11 18:31:42,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e64f7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:31:42, skipping insertion in model container [2020-10-11 18:31:42,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:31:42" (3/3) ... [2020-10-11 18:31:42,028 INFO L111 eAbstractionObserver]: Analyzing ICFG safe001_pso.opt.i [2020-10-11 18:31:42,040 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 18:31:42,047 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 18:31:42,048 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 18:31:42,079 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,080 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,080 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,080 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,081 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,081 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,081 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,081 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,082 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,082 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,082 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,083 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,083 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,084 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,084 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,085 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,085 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,085 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,085 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,086 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,086 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,086 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,086 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,086 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,087 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,087 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,087 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,088 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,088 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,089 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,089 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,096 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,097 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,102 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,102 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,102 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,102 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,103 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,103 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,103 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,103 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,104 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,104 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,106 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,106 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,106 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:31:42,126 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-11 18:31:42,148 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 18:31:42,148 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-11 18:31:42,149 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 18:31:42,149 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 18:31:42,149 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 18:31:42,149 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 18:31:42,149 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 18:31:42,150 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 18:31:42,164 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow [2020-10-11 18:31:42,213 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-11 18:31:42,214 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:31:42,219 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-11 18:31:42,220 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 92 transitions, 199 flow [2020-10-11 18:31:42,227 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 89 transitions, 187 flow [2020-10-11 18:31:42,281 INFO L129 PetriNetUnfolder]: 0/46 cut-off events. [2020-10-11 18:31:42,282 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:31:42,282 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:31:42,283 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:31:42,283 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:31:42,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:31:42,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1958206964, now seen corresponding path program 1 times [2020-10-11 18:31:42,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:31:42,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211494221] [2020-10-11 18:31:42,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:31:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:31:42,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:31:42,608 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211494221] [2020-10-11 18:31:42,609 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:31:42,609 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 18:31:42,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833603428] [2020-10-11 18:31:42,620 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 18:31:42,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:31:42,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 18:31:42,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 18:31:42,738 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 92 [2020-10-11 18:31:42,740 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 89 transitions, 187 flow. Second operand 3 states. [2020-10-11 18:31:42,740 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:31:42,740 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 92 [2020-10-11 18:31:42,742 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:31:42,771 INFO L129 PetriNetUnfolder]: 0/86 cut-off events. [2020-10-11 18:31:42,772 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:31:42,772 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 86 events. 0/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 4/88 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2020-10-11 18:31:42,773 INFO L132 encePairwiseOnDemand]: 87/92 looper letters, 0 selfloop transitions, 2 changer transitions 11/86 dead transitions. [2020-10-11 18:31:42,774 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 86 transitions, 185 flow [2020-10-11 18:31:42,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 18:31:42,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-11 18:31:42,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 268 transitions. [2020-10-11 18:31:42,790 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9710144927536232 [2020-10-11 18:31:42,791 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 268 transitions. [2020-10-11 18:31:42,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 268 transitions. [2020-10-11 18:31:42,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:31:42,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 268 transitions. [2020-10-11 18:31:42,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-11 18:31:42,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-11 18:31:42,806 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-11 18:31:42,808 INFO L185 Difference]: Start difference. First operand has 97 places, 89 transitions, 187 flow. Second operand 3 states and 268 transitions. [2020-10-11 18:31:42,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 86 transitions, 185 flow [2020-10-11 18:31:42,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 86 transitions, 182 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-11 18:31:42,817 INFO L241 Difference]: Finished difference. Result has 95 places, 75 transitions, 160 flow [2020-10-11 18:31:42,821 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=95, PETRI_TRANSITIONS=75} [2020-10-11 18:31:42,822 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, -2 predicate places. [2020-10-11 18:31:42,822 INFO L481 AbstractCegarLoop]: Abstraction has has 95 places, 75 transitions, 160 flow [2020-10-11 18:31:42,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 18:31:42,822 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:31:42,823 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:31:42,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 18:31:42,823 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:31:42,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:31:42,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1296494551, now seen corresponding path program 1 times [2020-10-11 18:31:42,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:31:42,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224250102] [2020-10-11 18:31:42,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:31:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:31:43,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:31:43,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224250102] [2020-10-11 18:31:43,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:31:43,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:31:43,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304375411] [2020-10-11 18:31:43,157 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:31:43,157 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:31:43,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:31:43,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:31:43,289 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 92 [2020-10-11 18:31:43,290 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 75 transitions, 160 flow. Second operand 6 states. [2020-10-11 18:31:43,290 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:31:43,290 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 92 [2020-10-11 18:31:43,291 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:31:43,429 INFO L129 PetriNetUnfolder]: 3/101 cut-off events. [2020-10-11 18:31:43,429 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:31:43,430 INFO L80 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 101 events. 3/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 133 event pairs, 0 based on Foata normal form. 2/103 useless extension candidates. Maximal degree in co-relation 95. Up to 7 conditions per place. [2020-10-11 18:31:43,431 INFO L132 encePairwiseOnDemand]: 86/92 looper letters, 6 selfloop transitions, 2 changer transitions 10/85 dead transitions. [2020-10-11 18:31:43,431 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 85 transitions, 216 flow [2020-10-11 18:31:43,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:31:43,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:31:43,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 758 transitions. [2020-10-11 18:31:43,437 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9154589371980676 [2020-10-11 18:31:43,437 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 758 transitions. [2020-10-11 18:31:43,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 758 transitions. [2020-10-11 18:31:43,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:31:43,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 758 transitions. [2020-10-11 18:31:43,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:31:43,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:31:43,444 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:31:43,444 INFO L185 Difference]: Start difference. First operand has 95 places, 75 transitions, 160 flow. Second operand 9 states and 758 transitions. [2020-10-11 18:31:43,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 85 transitions, 216 flow [2020-10-11 18:31:43,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 85 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-11 18:31:43,448 INFO L241 Difference]: Finished difference. Result has 97 places, 75 transitions, 176 flow [2020-10-11 18:31:43,449 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=176, PETRI_PLACES=97, PETRI_TRANSITIONS=75} [2020-10-11 18:31:43,449 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 0 predicate places. [2020-10-11 18:31:43,450 INFO L481 AbstractCegarLoop]: Abstraction has has 97 places, 75 transitions, 176 flow [2020-10-11 18:31:43,450 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:31:43,450 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:31:43,450 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:31:43,450 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 18:31:43,451 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:31:43,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:31:43,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1302539400, now seen corresponding path program 1 times [2020-10-11 18:31:43,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:31:43,452 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367231722] [2020-10-11 18:31:43,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:31:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:31:43,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:31:43,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367231722] [2020-10-11 18:31:43,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:31:43,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:31:43,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252207399] [2020-10-11 18:31:43,618 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:31:43,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:31:43,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:31:43,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:31:43,780 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 92 [2020-10-11 18:31:43,781 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 75 transitions, 176 flow. Second operand 6 states. [2020-10-11 18:31:43,781 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:31:43,781 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 92 [2020-10-11 18:31:43,781 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:31:43,935 INFO L129 PetriNetUnfolder]: 3/101 cut-off events. [2020-10-11 18:31:43,935 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-11 18:31:43,936 INFO L80 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 101 events. 3/101 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 133 event pairs, 0 based on Foata normal form. 2/103 useless extension candidates. Maximal degree in co-relation 140. Up to 7 conditions per place. [2020-10-11 18:31:43,936 INFO L132 encePairwiseOnDemand]: 86/92 looper letters, 6 selfloop transitions, 2 changer transitions 10/85 dead transitions. [2020-10-11 18:31:43,936 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 85 transitions, 250 flow [2020-10-11 18:31:43,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:31:43,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:31:43,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 758 transitions. [2020-10-11 18:31:43,940 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9154589371980676 [2020-10-11 18:31:43,940 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 758 transitions. [2020-10-11 18:31:43,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 758 transitions. [2020-10-11 18:31:43,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:31:43,941 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 758 transitions. [2020-10-11 18:31:43,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:31:43,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:31:43,944 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:31:43,944 INFO L185 Difference]: Start difference. First operand has 97 places, 75 transitions, 176 flow. Second operand 9 states and 758 transitions. [2020-10-11 18:31:43,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 85 transitions, 250 flow [2020-10-11 18:31:43,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 85 transitions, 218 flow, removed 14 selfloop flow, removed 8 redundant places. [2020-10-11 18:31:43,948 INFO L241 Difference]: Finished difference. Result has 98 places, 75 transitions, 180 flow [2020-10-11 18:31:43,948 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=180, PETRI_PLACES=98, PETRI_TRANSITIONS=75} [2020-10-11 18:31:43,949 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 1 predicate places. [2020-10-11 18:31:43,949 INFO L481 AbstractCegarLoop]: Abstraction has has 98 places, 75 transitions, 180 flow [2020-10-11 18:31:43,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:31:43,949 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:31:43,949 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:31:43,950 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 18:31:43,950 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:31:43,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:31:43,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1546971049, now seen corresponding path program 1 times [2020-10-11 18:31:43,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:31:43,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624602286] [2020-10-11 18:31:43,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:31:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:31:44,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:31:44,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624602286] [2020-10-11 18:31:44,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:31:44,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:31:44,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086371670] [2020-10-11 18:31:44,101 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:31:44,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:31:44,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:31:44,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:31:44,290 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 92 [2020-10-11 18:31:44,290 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 75 transitions, 180 flow. Second operand 6 states. [2020-10-11 18:31:44,290 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:31:44,290 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 92 [2020-10-11 18:31:44,291 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:31:44,473 INFO L129 PetriNetUnfolder]: 24/172 cut-off events. [2020-10-11 18:31:44,473 INFO L130 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2020-10-11 18:31:44,475 INFO L80 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 172 events. 24/172 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 573 event pairs, 5 based on Foata normal form. 4/174 useless extension candidates. Maximal degree in co-relation 265. Up to 31 conditions per place. [2020-10-11 18:31:44,477 INFO L132 encePairwiseOnDemand]: 85/92 looper letters, 8 selfloop transitions, 3 changer transitions 19/96 dead transitions. [2020-10-11 18:31:44,478 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 96 transitions, 302 flow [2020-10-11 18:31:44,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:31:44,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:31:44,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 761 transitions. [2020-10-11 18:31:44,481 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9190821256038647 [2020-10-11 18:31:44,481 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 761 transitions. [2020-10-11 18:31:44,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 761 transitions. [2020-10-11 18:31:44,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:31:44,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 761 transitions. [2020-10-11 18:31:44,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:31:44,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:31:44,486 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:31:44,486 INFO L185 Difference]: Start difference. First operand has 98 places, 75 transitions, 180 flow. Second operand 9 states and 761 transitions. [2020-10-11 18:31:44,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 96 transitions, 302 flow [2020-10-11 18:31:44,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 96 transitions, 270 flow, removed 14 selfloop flow, removed 8 redundant places. [2020-10-11 18:31:44,494 INFO L241 Difference]: Finished difference. Result has 99 places, 77 transitions, 207 flow [2020-10-11 18:31:44,494 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=207, PETRI_PLACES=99, PETRI_TRANSITIONS=77} [2020-10-11 18:31:44,495 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 2 predicate places. [2020-10-11 18:31:44,495 INFO L481 AbstractCegarLoop]: Abstraction has has 99 places, 77 transitions, 207 flow [2020-10-11 18:31:44,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:31:44,495 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:31:44,496 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:31:44,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 18:31:44,496 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:31:44,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:31:44,497 INFO L82 PathProgramCache]: Analyzing trace with hash 2060175034, now seen corresponding path program 1 times [2020-10-11 18:31:44,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:31:44,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702649178] [2020-10-11 18:31:44,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:31:44,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:31:44,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:31:44,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702649178] [2020-10-11 18:31:44,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:31:44,727 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:31:44,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128382468] [2020-10-11 18:31:44,727 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:31:44,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:31:44,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:31:44,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:31:45,026 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 92 [2020-10-11 18:31:45,027 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 77 transitions, 207 flow. Second operand 7 states. [2020-10-11 18:31:45,027 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:31:45,027 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 92 [2020-10-11 18:31:45,028 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:31:45,193 INFO L129 PetriNetUnfolder]: 22/162 cut-off events. [2020-10-11 18:31:45,194 INFO L130 PetriNetUnfolder]: For 245/298 co-relation queries the response was YES. [2020-10-11 18:31:45,195 INFO L80 FinitePrefix]: Finished finitePrefix Result has 400 conditions, 162 events. 22/162 cut-off events. For 245/298 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 496 event pairs, 5 based on Foata normal form. 7/164 useless extension candidates. Maximal degree in co-relation 361. Up to 35 conditions per place. [2020-10-11 18:31:45,198 INFO L132 encePairwiseOnDemand]: 83/92 looper letters, 10 selfloop transitions, 5 changer transitions 11/90 dead transitions. [2020-10-11 18:31:45,198 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 90 transitions, 364 flow [2020-10-11 18:31:45,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 18:31:45,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-11 18:31:45,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 580 transitions. [2020-10-11 18:31:45,201 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9006211180124224 [2020-10-11 18:31:45,201 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 580 transitions. [2020-10-11 18:31:45,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 580 transitions. [2020-10-11 18:31:45,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:31:45,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 580 transitions. [2020-10-11 18:31:45,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-11 18:31:45,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-11 18:31:45,205 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-11 18:31:45,205 INFO L185 Difference]: Start difference. First operand has 99 places, 77 transitions, 207 flow. Second operand 7 states and 580 transitions. [2020-10-11 18:31:45,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 90 transitions, 364 flow [2020-10-11 18:31:45,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 90 transitions, 351 flow, removed 5 selfloop flow, removed 4 redundant places. [2020-10-11 18:31:45,212 INFO L241 Difference]: Finished difference. Result has 99 places, 77 transitions, 221 flow [2020-10-11 18:31:45,212 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=221, PETRI_PLACES=99, PETRI_TRANSITIONS=77} [2020-10-11 18:31:45,212 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 2 predicate places. [2020-10-11 18:31:45,213 INFO L481 AbstractCegarLoop]: Abstraction has has 99 places, 77 transitions, 221 flow [2020-10-11 18:31:45,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:31:45,213 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:31:45,213 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:31:45,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 18:31:45,214 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:31:45,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:31:45,214 INFO L82 PathProgramCache]: Analyzing trace with hash 557236214, now seen corresponding path program 2 times [2020-10-11 18:31:45,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:31:45,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577235846] [2020-10-11 18:31:45,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:31:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:31:45,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:31:45,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577235846] [2020-10-11 18:31:45,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:31:45,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:31:45,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180401373] [2020-10-11 18:31:45,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:31:45,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:31:45,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:31:45,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:31:45,720 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 92 [2020-10-11 18:31:45,721 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 77 transitions, 221 flow. Second operand 7 states. [2020-10-11 18:31:45,721 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:31:45,721 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 92 [2020-10-11 18:31:45,721 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:31:45,833 INFO L129 PetriNetUnfolder]: 14/139 cut-off events. [2020-10-11 18:31:45,833 INFO L130 PetriNetUnfolder]: For 201/268 co-relation queries the response was YES. [2020-10-11 18:31:45,835 INFO L80 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 139 events. 14/139 cut-off events. For 201/268 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 380 event pairs, 5 based on Foata normal form. 4/140 useless extension candidates. Maximal degree in co-relation 304. Up to 25 conditions per place. [2020-10-11 18:31:45,835 INFO L132 encePairwiseOnDemand]: 83/92 looper letters, 7 selfloop transitions, 4 changer transitions 14/89 dead transitions. [2020-10-11 18:31:45,836 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 89 transitions, 368 flow [2020-10-11 18:31:45,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 18:31:45,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-11 18:31:45,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 579 transitions. [2020-10-11 18:31:45,838 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8990683229813664 [2020-10-11 18:31:45,839 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 579 transitions. [2020-10-11 18:31:45,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 579 transitions. [2020-10-11 18:31:45,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:31:45,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 579 transitions. [2020-10-11 18:31:45,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-11 18:31:45,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-11 18:31:45,842 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-11 18:31:45,842 INFO L185 Difference]: Start difference. First operand has 99 places, 77 transitions, 221 flow. Second operand 7 states and 579 transitions. [2020-10-11 18:31:45,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 89 transitions, 368 flow [2020-10-11 18:31:45,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 89 transitions, 336 flow, removed 11 selfloop flow, removed 6 redundant places. [2020-10-11 18:31:45,846 INFO L241 Difference]: Finished difference. Result has 100 places, 75 transitions, 208 flow [2020-10-11 18:31:45,847 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=208, PETRI_PLACES=100, PETRI_TRANSITIONS=75} [2020-10-11 18:31:45,847 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 3 predicate places. [2020-10-11 18:31:45,847 INFO L481 AbstractCegarLoop]: Abstraction has has 100 places, 75 transitions, 208 flow [2020-10-11 18:31:45,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:31:45,848 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:31:45,848 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:31:45,848 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 18:31:45,848 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:31:45,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:31:45,849 INFO L82 PathProgramCache]: Analyzing trace with hash 974612925, now seen corresponding path program 1 times [2020-10-11 18:31:45,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:31:45,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96542387] [2020-10-11 18:31:45,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:31:45,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:31:46,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:31:46,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96542387] [2020-10-11 18:31:46,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:31:46,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:31:46,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175433378] [2020-10-11 18:31:46,005 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:31:46,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:31:46,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:31:46,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:31:46,187 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 92 [2020-10-11 18:31:46,187 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 75 transitions, 208 flow. Second operand 6 states. [2020-10-11 18:31:46,187 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:31:46,188 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 92 [2020-10-11 18:31:46,188 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:31:46,295 INFO L129 PetriNetUnfolder]: 3/90 cut-off events. [2020-10-11 18:31:46,295 INFO L130 PetriNetUnfolder]: For 83/89 co-relation queries the response was YES. [2020-10-11 18:31:46,296 INFO L80 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 90 events. 3/90 cut-off events. For 83/89 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 107 event pairs, 0 based on Foata normal form. 2/92 useless extension candidates. Maximal degree in co-relation 165. Up to 9 conditions per place. [2020-10-11 18:31:46,296 INFO L132 encePairwiseOnDemand]: 86/92 looper letters, 7 selfloop transitions, 2 changer transitions 10/85 dead transitions. [2020-10-11 18:31:46,297 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 85 transitions, 314 flow [2020-10-11 18:31:46,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:31:46,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:31:46,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 750 transitions. [2020-10-11 18:31:46,299 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9057971014492754 [2020-10-11 18:31:46,300 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 750 transitions. [2020-10-11 18:31:46,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 750 transitions. [2020-10-11 18:31:46,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:31:46,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 750 transitions. [2020-10-11 18:31:46,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:31:46,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:31:46,304 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:31:46,304 INFO L185 Difference]: Start difference. First operand has 100 places, 75 transitions, 208 flow. Second operand 9 states and 750 transitions. [2020-10-11 18:31:46,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 85 transitions, 314 flow [2020-10-11 18:31:46,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 85 transitions, 278 flow, removed 13 selfloop flow, removed 7 redundant places. [2020-10-11 18:31:46,309 INFO L241 Difference]: Finished difference. Result has 105 places, 75 transitions, 208 flow [2020-10-11 18:31:46,309 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=208, PETRI_PLACES=105, PETRI_TRANSITIONS=75} [2020-10-11 18:31:46,309 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 8 predicate places. [2020-10-11 18:31:46,310 INFO L481 AbstractCegarLoop]: Abstraction has has 105 places, 75 transitions, 208 flow [2020-10-11 18:31:46,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:31:46,310 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:31:46,310 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:31:46,310 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 18:31:46,310 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:31:46,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:31:46,311 INFO L82 PathProgramCache]: Analyzing trace with hash -370970758, now seen corresponding path program 1 times [2020-10-11 18:31:46,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:31:46,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927170298] [2020-10-11 18:31:46,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:31:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:31:46,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:31:46,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927170298] [2020-10-11 18:31:46,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:31:46,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 18:31:46,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135946904] [2020-10-11 18:31:46,583 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 18:31:46,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:31:46,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 18:31:46,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-10-11 18:31:47,175 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 92 [2020-10-11 18:31:47,176 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 75 transitions, 208 flow. Second operand 10 states. [2020-10-11 18:31:47,177 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:31:47,177 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 92 [2020-10-11 18:31:47,177 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:31:47,558 INFO L129 PetriNetUnfolder]: 184/443 cut-off events. [2020-10-11 18:31:47,558 INFO L130 PetriNetUnfolder]: For 369/376 co-relation queries the response was YES. [2020-10-11 18:31:47,561 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1014 conditions, 443 events. 184/443 cut-off events. For 369/376 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1826 event pairs, 64 based on Foata normal form. 12/447 useless extension candidates. Maximal degree in co-relation 956. Up to 193 conditions per place. [2020-10-11 18:31:47,565 INFO L132 encePairwiseOnDemand]: 80/92 looper letters, 13 selfloop transitions, 8 changer transitions 28/108 dead transitions. [2020-10-11 18:31:47,565 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 108 transitions, 404 flow [2020-10-11 18:31:47,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 18:31:47,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 18:31:47,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1000 transitions. [2020-10-11 18:31:47,571 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8361204013377926 [2020-10-11 18:31:47,572 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1000 transitions. [2020-10-11 18:31:47,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1000 transitions. [2020-10-11 18:31:47,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:31:47,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1000 transitions. [2020-10-11 18:31:47,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 18:31:47,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 18:31:47,579 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 18:31:47,580 INFO L185 Difference]: Start difference. First operand has 105 places, 75 transitions, 208 flow. Second operand 13 states and 1000 transitions. [2020-10-11 18:31:47,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 108 transitions, 404 flow [2020-10-11 18:31:47,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 108 transitions, 352 flow, removed 24 selfloop flow, removed 11 redundant places. [2020-10-11 18:31:47,588 INFO L241 Difference]: Finished difference. Result has 107 places, 78 transitions, 244 flow [2020-10-11 18:31:47,588 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=244, PETRI_PLACES=107, PETRI_TRANSITIONS=78} [2020-10-11 18:31:47,588 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 10 predicate places. [2020-10-11 18:31:47,589 INFO L481 AbstractCegarLoop]: Abstraction has has 107 places, 78 transitions, 244 flow [2020-10-11 18:31:47,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 18:31:47,589 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:31:47,589 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:31:47,590 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 18:31:47,590 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:31:47,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:31:47,591 INFO L82 PathProgramCache]: Analyzing trace with hash -124229939, now seen corresponding path program 1 times [2020-10-11 18:31:47,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:31:47,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369685041] [2020-10-11 18:31:47,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:31:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:31:47,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:31:47,708 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369685041] [2020-10-11 18:31:47,708 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:31:47,708 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:31:47,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674676288] [2020-10-11 18:31:47,709 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:31:47,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:31:47,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:31:47,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:31:47,824 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 92 [2020-10-11 18:31:47,824 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 78 transitions, 244 flow. Second operand 6 states. [2020-10-11 18:31:47,824 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:31:47,825 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 92 [2020-10-11 18:31:47,825 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:31:48,057 INFO L129 PetriNetUnfolder]: 206/637 cut-off events. [2020-10-11 18:31:48,057 INFO L130 PetriNetUnfolder]: For 608/617 co-relation queries the response was YES. [2020-10-11 18:31:48,062 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1420 conditions, 637 events. 206/637 cut-off events. For 608/617 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3930 event pairs, 58 based on Foata normal form. 14/618 useless extension candidates. Maximal degree in co-relation 1363. Up to 137 conditions per place. [2020-10-11 18:31:48,068 INFO L132 encePairwiseOnDemand]: 83/92 looper letters, 19 selfloop transitions, 16 changer transitions 0/103 dead transitions. [2020-10-11 18:31:48,069 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 103 transitions, 364 flow [2020-10-11 18:31:48,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:31:48,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:31:48,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 748 transitions. [2020-10-11 18:31:48,072 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9033816425120773 [2020-10-11 18:31:48,072 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 748 transitions. [2020-10-11 18:31:48,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 748 transitions. [2020-10-11 18:31:48,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:31:48,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 748 transitions. [2020-10-11 18:31:48,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:31:48,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:31:48,077 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:31:48,077 INFO L185 Difference]: Start difference. First operand has 107 places, 78 transitions, 244 flow. Second operand 9 states and 748 transitions. [2020-10-11 18:31:48,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 103 transitions, 364 flow [2020-10-11 18:31:48,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 103 transitions, 342 flow, removed 4 selfloop flow, removed 9 redundant places. [2020-10-11 18:31:48,083 INFO L241 Difference]: Finished difference. Result has 105 places, 92 transitions, 333 flow [2020-10-11 18:31:48,083 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=333, PETRI_PLACES=105, PETRI_TRANSITIONS=92} [2020-10-11 18:31:48,084 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 8 predicate places. [2020-10-11 18:31:48,084 INFO L481 AbstractCegarLoop]: Abstraction has has 105 places, 92 transitions, 333 flow [2020-10-11 18:31:48,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:31:48,084 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:31:48,084 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:31:48,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 18:31:48,085 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:31:48,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:31:48,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1812929867, now seen corresponding path program 1 times [2020-10-11 18:31:48,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:31:48,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846512705] [2020-10-11 18:31:48,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:31:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:31:48,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:31:48,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846512705] [2020-10-11 18:31:48,240 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:31:48,240 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:31:48,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131974583] [2020-10-11 18:31:48,241 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:31:48,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:31:48,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:31:48,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:31:48,408 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 92 [2020-10-11 18:31:48,409 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 92 transitions, 333 flow. Second operand 7 states. [2020-10-11 18:31:48,409 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:31:48,409 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 92 [2020-10-11 18:31:48,410 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:31:48,726 INFO L129 PetriNetUnfolder]: 153/531 cut-off events. [2020-10-11 18:31:48,726 INFO L130 PetriNetUnfolder]: For 939/1279 co-relation queries the response was YES. [2020-10-11 18:31:48,730 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1576 conditions, 531 events. 153/531 cut-off events. For 939/1279 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3337 event pairs, 9 based on Foata normal form. 78/580 useless extension candidates. Maximal degree in co-relation 1520. Up to 149 conditions per place. [2020-10-11 18:31:48,734 INFO L132 encePairwiseOnDemand]: 83/92 looper letters, 15 selfloop transitions, 31 changer transitions 6/120 dead transitions. [2020-10-11 18:31:48,734 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 120 transitions, 618 flow [2020-10-11 18:31:48,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:31:48,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:31:48,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 998 transitions. [2020-10-11 18:31:48,738 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9039855072463768 [2020-10-11 18:31:48,738 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 998 transitions. [2020-10-11 18:31:48,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 998 transitions. [2020-10-11 18:31:48,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:31:48,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 998 transitions. [2020-10-11 18:31:48,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:31:48,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:31:48,744 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:31:48,744 INFO L185 Difference]: Start difference. First operand has 105 places, 92 transitions, 333 flow. Second operand 12 states and 998 transitions. [2020-10-11 18:31:48,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 120 transitions, 618 flow [2020-10-11 18:31:48,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 120 transitions, 616 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-11 18:31:48,750 INFO L241 Difference]: Finished difference. Result has 118 places, 111 transitions, 561 flow [2020-10-11 18:31:48,751 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=561, PETRI_PLACES=118, PETRI_TRANSITIONS=111} [2020-10-11 18:31:48,751 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 21 predicate places. [2020-10-11 18:31:48,751 INFO L481 AbstractCegarLoop]: Abstraction has has 118 places, 111 transitions, 561 flow [2020-10-11 18:31:48,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:31:48,751 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:31:48,751 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:31:48,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 18:31:48,752 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:31:48,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:31:48,752 INFO L82 PathProgramCache]: Analyzing trace with hash -2105024114, now seen corresponding path program 1 times [2020-10-11 18:31:48,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:31:48,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415632855] [2020-10-11 18:31:48,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:31:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:31:48,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:31:48,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415632855] [2020-10-11 18:31:48,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:31:48,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 18:31:48,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106654834] [2020-10-11 18:31:48,886 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 18:31:48,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:31:48,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 18:31:48,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 18:31:49,089 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 92 [2020-10-11 18:31:49,090 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 111 transitions, 561 flow. Second operand 8 states. [2020-10-11 18:31:49,090 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:31:49,090 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 92 [2020-10-11 18:31:49,090 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:31:49,496 INFO L129 PetriNetUnfolder]: 118/461 cut-off events. [2020-10-11 18:31:49,497 INFO L130 PetriNetUnfolder]: For 1453/2062 co-relation queries the response was YES. [2020-10-11 18:31:49,501 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1590 conditions, 461 events. 118/461 cut-off events. For 1453/2062 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 2999 event pairs, 1 based on Foata normal form. 94/527 useless extension candidates. Maximal degree in co-relation 1529. Up to 127 conditions per place. [2020-10-11 18:31:49,504 INFO L132 encePairwiseOnDemand]: 83/92 looper letters, 10 selfloop transitions, 36 changer transitions 16/130 dead transitions. [2020-10-11 18:31:49,505 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 130 transitions, 815 flow [2020-10-11 18:31:49,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:31:49,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:31:49,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1236 transitions. [2020-10-11 18:31:49,511 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8956521739130435 [2020-10-11 18:31:49,512 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1236 transitions. [2020-10-11 18:31:49,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1236 transitions. [2020-10-11 18:31:49,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:31:49,514 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1236 transitions. [2020-10-11 18:31:49,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:31:49,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:31:49,525 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:31:49,525 INFO L185 Difference]: Start difference. First operand has 118 places, 111 transitions, 561 flow. Second operand 15 states and 1236 transitions. [2020-10-11 18:31:49,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 130 transitions, 815 flow [2020-10-11 18:31:49,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 130 transitions, 649 flow, removed 67 selfloop flow, removed 9 redundant places. [2020-10-11 18:31:49,544 INFO L241 Difference]: Finished difference. Result has 129 places, 111 transitions, 539 flow [2020-10-11 18:31:49,545 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=539, PETRI_PLACES=129, PETRI_TRANSITIONS=111} [2020-10-11 18:31:49,545 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 32 predicate places. [2020-10-11 18:31:49,545 INFO L481 AbstractCegarLoop]: Abstraction has has 129 places, 111 transitions, 539 flow [2020-10-11 18:31:49,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 18:31:49,546 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:31:49,547 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:31:49,547 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 18:31:49,547 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:31:49,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:31:49,548 INFO L82 PathProgramCache]: Analyzing trace with hash 957936959, now seen corresponding path program 1 times [2020-10-11 18:31:49,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:31:49,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135855626] [2020-10-11 18:31:49,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:31:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:31:49,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:31:49,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135855626] [2020-10-11 18:31:49,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:31:49,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 18:31:49,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408777691] [2020-10-11 18:31:49,842 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 18:31:49,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:31:49,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 18:31:49,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-10-11 18:31:50,736 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 92 [2020-10-11 18:31:50,737 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 111 transitions, 539 flow. Second operand 10 states. [2020-10-11 18:31:50,737 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:31:50,737 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 92 [2020-10-11 18:31:50,738 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:31:50,935 INFO L129 PetriNetUnfolder]: 158/664 cut-off events. [2020-10-11 18:31:50,936 INFO L130 PetriNetUnfolder]: For 1282/1487 co-relation queries the response was YES. [2020-10-11 18:31:50,940 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1903 conditions, 664 events. 158/664 cut-off events. For 1282/1487 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 5243 event pairs, 0 based on Foata normal form. 2/615 useless extension candidates. Maximal degree in co-relation 1847. Up to 79 conditions per place. [2020-10-11 18:31:50,943 INFO L132 encePairwiseOnDemand]: 82/92 looper letters, 13 selfloop transitions, 7 changer transitions 4/118 dead transitions. [2020-10-11 18:31:50,943 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 118 transitions, 617 flow [2020-10-11 18:31:50,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:31:50,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:31:50,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 706 transitions. [2020-10-11 18:31:50,946 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8526570048309179 [2020-10-11 18:31:50,946 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 706 transitions. [2020-10-11 18:31:50,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 706 transitions. [2020-10-11 18:31:50,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:31:50,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 706 transitions. [2020-10-11 18:31:50,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:31:50,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:31:50,951 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:31:50,951 INFO L185 Difference]: Start difference. First operand has 129 places, 111 transitions, 539 flow. Second operand 9 states and 706 transitions. [2020-10-11 18:31:50,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 118 transitions, 617 flow [2020-10-11 18:31:50,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 118 transitions, 530 flow, removed 19 selfloop flow, removed 14 redundant places. [2020-10-11 18:31:50,964 INFO L241 Difference]: Finished difference. Result has 125 places, 113 transitions, 502 flow [2020-10-11 18:31:50,964 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=502, PETRI_PLACES=125, PETRI_TRANSITIONS=113} [2020-10-11 18:31:50,965 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 28 predicate places. [2020-10-11 18:31:50,965 INFO L481 AbstractCegarLoop]: Abstraction has has 125 places, 113 transitions, 502 flow [2020-10-11 18:31:50,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 18:31:50,965 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:31:50,965 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:31:50,965 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 18:31:50,965 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:31:50,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:31:50,966 INFO L82 PathProgramCache]: Analyzing trace with hash -311527253, now seen corresponding path program 2 times [2020-10-11 18:31:50,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:31:50,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334315076] [2020-10-11 18:31:50,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:31:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:31:51,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:31:51,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334315076] [2020-10-11 18:31:51,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:31:51,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:31:51,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853166086] [2020-10-11 18:31:51,093 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:31:51,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:31:51,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:31:51,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:31:51,294 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 92 [2020-10-11 18:31:51,295 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 113 transitions, 502 flow. Second operand 7 states. [2020-10-11 18:31:51,295 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:31:51,295 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 92 [2020-10-11 18:31:51,295 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:31:51,493 INFO L129 PetriNetUnfolder]: 268/1066 cut-off events. [2020-10-11 18:31:51,493 INFO L130 PetriNetUnfolder]: For 1241/1291 co-relation queries the response was YES. [2020-10-11 18:31:51,499 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2861 conditions, 1066 events. 268/1066 cut-off events. For 1241/1291 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 9810 event pairs, 0 based on Foata normal form. 1/1004 useless extension candidates. Maximal degree in co-relation 2838. Up to 144 conditions per place. [2020-10-11 18:31:51,502 INFO L132 encePairwiseOnDemand]: 85/92 looper letters, 9 selfloop transitions, 2 changer transitions 6/119 dead transitions. [2020-10-11 18:31:51,503 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 119 transitions, 555 flow [2020-10-11 18:31:51,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-11 18:31:51,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-11 18:31:51,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 650 transitions. [2020-10-11 18:31:51,505 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8831521739130435 [2020-10-11 18:31:51,505 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 650 transitions. [2020-10-11 18:31:51,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 650 transitions. [2020-10-11 18:31:51,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:31:51,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 650 transitions. [2020-10-11 18:31:51,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-11 18:31:51,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-11 18:31:51,509 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-11 18:31:51,509 INFO L185 Difference]: Start difference. First operand has 125 places, 113 transitions, 502 flow. Second operand 8 states and 650 transitions. [2020-10-11 18:31:51,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 119 transitions, 555 flow [2020-10-11 18:31:51,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 119 transitions, 531 flow, removed 7 selfloop flow, removed 7 redundant places. [2020-10-11 18:31:51,525 INFO L241 Difference]: Finished difference. Result has 127 places, 113 transitions, 498 flow [2020-10-11 18:31:51,525 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=498, PETRI_PLACES=127, PETRI_TRANSITIONS=113} [2020-10-11 18:31:51,525 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 30 predicate places. [2020-10-11 18:31:51,525 INFO L481 AbstractCegarLoop]: Abstraction has has 127 places, 113 transitions, 498 flow [2020-10-11 18:31:51,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:31:51,526 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:31:51,526 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:31:51,526 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-11 18:31:51,526 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:31:51,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:31:51,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1871120629, now seen corresponding path program 3 times [2020-10-11 18:31:51,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:31:51,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306624118] [2020-10-11 18:31:51,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:31:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:31:51,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:31:51,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306624118] [2020-10-11 18:31:51,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:31:51,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-10-11 18:31:51,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901053304] [2020-10-11 18:31:51,895 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 18:31:51,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:31:51,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 18:31:51,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2020-10-11 18:31:54,844 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 92 [2020-10-11 18:31:54,845 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 113 transitions, 498 flow. Second operand 14 states. [2020-10-11 18:31:54,845 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:31:54,845 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 92 [2020-10-11 18:31:54,846 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:31:55,527 INFO L129 PetriNetUnfolder]: 200/862 cut-off events. [2020-10-11 18:31:55,528 INFO L130 PetriNetUnfolder]: For 902/938 co-relation queries the response was YES. [2020-10-11 18:31:55,534 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2228 conditions, 862 events. 200/862 cut-off events. For 902/938 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 7482 event pairs, 1 based on Foata normal form. 4/820 useless extension candidates. Maximal degree in co-relation 2203. Up to 105 conditions per place. [2020-10-11 18:31:55,536 INFO L132 encePairwiseOnDemand]: 80/92 looper letters, 14 selfloop transitions, 10 changer transitions 9/123 dead transitions. [2020-10-11 18:31:55,537 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 123 transitions, 604 flow [2020-10-11 18:31:55,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:31:55,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:31:55,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1025 transitions. [2020-10-11 18:31:55,540 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7958074534161491 [2020-10-11 18:31:55,540 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1025 transitions. [2020-10-11 18:31:55,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1025 transitions. [2020-10-11 18:31:55,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:31:55,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1025 transitions. [2020-10-11 18:31:55,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:31:55,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:31:55,548 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:31:55,548 INFO L185 Difference]: Start difference. First operand has 127 places, 113 transitions, 498 flow. Second operand 14 states and 1025 transitions. [2020-10-11 18:31:55,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 123 transitions, 604 flow [2020-10-11 18:31:55,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 123 transitions, 586 flow, removed 7 selfloop flow, removed 6 redundant places. [2020-10-11 18:31:55,559 INFO L241 Difference]: Finished difference. Result has 134 places, 113 transitions, 518 flow [2020-10-11 18:31:55,559 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=518, PETRI_PLACES=134, PETRI_TRANSITIONS=113} [2020-10-11 18:31:55,560 INFO L341 CegarLoopForPetriNet]: 97 programPoint places, 37 predicate places. [2020-10-11 18:31:55,560 INFO L481 AbstractCegarLoop]: Abstraction has has 134 places, 113 transitions, 518 flow [2020-10-11 18:31:55,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 18:31:55,560 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:31:55,560 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:31:55,560 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-11 18:31:55,560 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:31:55,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:31:55,561 INFO L82 PathProgramCache]: Analyzing trace with hash 433885557, now seen corresponding path program 4 times [2020-10-11 18:31:55,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:31:55,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619994143] [2020-10-11 18:31:55,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:31:55,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:31:55,616 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:31:55,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:31:55,660 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:31:55,719 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 18:31:55,719 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 18:31:55,719 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-11 18:31:55,761 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:31:55,762 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:31:55,764 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:31:55,764 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:31:55,764 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:31:55,765 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:31:55,765 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:31:55,765 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:31:55,765 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:31:55,765 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:31:55,766 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:31:55,766 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:31:55,767 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:31:55,767 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:31:55,767 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:31:55,767 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:31:55,767 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:31:55,767 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:31:55,768 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:31:55,768 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:31:55,768 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:31:55,768 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:31:55,769 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:31:55,769 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:31:55,769 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:31:55,769 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:31:55,770 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:31:55,770 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:31:55,770 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:31:55,770 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:31:55,771 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:31:55,771 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:31:55,771 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:31:55,771 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:31:55,772 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:31:55,772 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:31:55,773 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:31:55,773 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:31:55,773 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:31:55,773 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:31:55,778 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:31:55,778 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:31:55,779 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:31:55,779 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:31:55,779 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:31:55,779 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:31:55,779 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:31:55,780 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:31:55,780 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:31:55,780 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:31:55,780 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:31:55,780 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:31:55,780 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:31:55,780 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:31:55,780 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:31:55,780 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:31:55,780 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:31:55,780 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:31:55,781 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:31:55,781 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:31:55,781 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:31:55,781 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:31:55,781 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:31:55,781 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:31:55,781 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:31:55,781 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:31:55,781 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:31:55,781 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:31:55,782 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:31:55,782 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:31:55,782 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:31:55,782 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:31:55,782 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:31:55,782 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:31:55,782 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:31:55,782 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:31:55,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:31:55 BasicIcfg [2020-10-11 18:31:55,892 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 18:31:55,894 INFO L168 Benchmark]: Toolchain (without parser) took 17019.80 ms. Allocated memory was 252.7 MB in the beginning and 630.7 MB in the end (delta: 378.0 MB). Free memory was 207.8 MB in the beginning and 410.2 MB in the end (delta: -202.3 MB). Peak memory consumption was 175.7 MB. Max. memory is 14.2 GB. [2020-10-11 18:31:55,895 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 252.7 MB. Free memory was 230.8 MB in the beginning and 229.9 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. [2020-10-11 18:31:55,895 INFO L168 Benchmark]: CACSL2BoogieTranslator took 809.07 ms. Allocated memory was 252.7 MB in the beginning and 318.2 MB in the end (delta: 65.5 MB). Free memory was 207.8 MB in the beginning and 269.0 MB in the end (delta: -61.1 MB). Peak memory consumption was 30.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:31:55,896 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.01 ms. Allocated memory is still 318.2 MB. Free memory was 269.0 MB in the beginning and 265.5 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:31:55,897 INFO L168 Benchmark]: Boogie Preprocessor took 57.37 ms. Allocated memory is still 318.2 MB. Free memory was 265.5 MB in the beginning and 263.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:31:55,898 INFO L168 Benchmark]: RCFGBuilder took 2210.62 ms. Allocated memory was 318.2 MB in the beginning and 361.8 MB in the end (delta: 43.5 MB). Free memory was 263.0 MB in the beginning and 184.5 MB in the end (delta: 78.5 MB). Peak memory consumption was 122.0 MB. Max. memory is 14.2 GB. [2020-10-11 18:31:55,899 INFO L168 Benchmark]: TraceAbstraction took 13872.00 ms. Allocated memory was 361.8 MB in the beginning and 630.7 MB in the end (delta: 269.0 MB). Free memory was 184.5 MB in the beginning and 410.2 MB in the end (delta: -225.7 MB). Peak memory consumption was 43.3 MB. Max. memory is 14.2 GB. [2020-10-11 18:31:55,903 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 252.7 MB. Free memory was 230.8 MB in the beginning and 229.9 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 809.07 ms. Allocated memory was 252.7 MB in the beginning and 318.2 MB in the end (delta: 65.5 MB). Free memory was 207.8 MB in the beginning and 269.0 MB in the end (delta: -61.1 MB). Peak memory consumption was 30.5 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 65.01 ms. Allocated memory is still 318.2 MB. Free memory was 269.0 MB in the beginning and 265.5 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 57.37 ms. Allocated memory is still 318.2 MB. Free memory was 265.5 MB in the beginning and 263.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2210.62 ms. Allocated memory was 318.2 MB in the beginning and 361.8 MB in the end (delta: 43.5 MB). Free memory was 263.0 MB in the beginning and 184.5 MB in the end (delta: 78.5 MB). Peak memory consumption was 122.0 MB. Max. memory is 14.2 GB. * TraceAbstraction took 13872.00 ms. Allocated memory was 361.8 MB in the beginning and 630.7 MB in the end (delta: 269.0 MB). Free memory was 184.5 MB in the beginning and 410.2 MB in the end (delta: -225.7 MB). Peak memory consumption was 43.3 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L700] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L702] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L703] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L704] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L706] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L707] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L708] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L709] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L710] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L711] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L712] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L713] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L714] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L715] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L716] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L717] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L718] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L719] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L720] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L721] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L722] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L724] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L725] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L726] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L807] 0 pthread_t t1810; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L808] FCALL, FORK 0 pthread_create(&t1810, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L809] 0 pthread_t t1811; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L810] FCALL, FORK 0 pthread_create(&t1811, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L750] 2 x$w_buff1 = x$w_buff0 [L751] 2 x$w_buff0 = 2 [L752] 2 x$w_buff1_used = x$w_buff0_used [L753] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L755] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L756] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L757] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L758] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L759] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L762] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L811] 0 pthread_t t1812; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L812] FCALL, FORK 0 pthread_create(&t1812, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L779] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L782] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L730] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] 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) [L785] 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) [L786] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L786] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L787] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L787] 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 [L788] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L788] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L789] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L789] 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 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 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) [L736] 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) [L737] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L737] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L738] 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 [L739] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L739] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L740] 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 [L765] 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) [L765] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L765] 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) [L765] 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) [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L767] 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 [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L769] 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 [L772] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L792] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L814] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L818] 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) [L818] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L818] 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) [L818] 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) [L819] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L819] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L820] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L820] 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 [L821] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L821] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L822] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L822] 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 [L825] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 0 x$flush_delayed = weak$$choice2 [L828] 0 x$mem_tmp = x [L829] 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) [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1 [L829] 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) [L829] 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) [L830] 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)) [L830] 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) [L830] 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)) [L830] 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)) [L831] 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)) [L831] 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) [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1 [L831] 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) [L831] 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)) [L831] 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)) [L832] 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)) [L832] 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) [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 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) [L832] 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)) [L832] 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)) [L833] 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)) [L833] 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)) [L834] 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)) [L834] 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)) [L835] 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)) [L835] 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) [L835] 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)) [L835] 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)) [L836] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L837] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L837] 0 x = x$flush_delayed ? x$mem_tmp : x [L838] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L7] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L7] 0 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 91 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 13.5s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 10.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 461 SDtfs, 581 SDslu, 1809 SDs, 0 SdLazy, 1510 SolverSat, 232 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=561occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 917 NumberOfCodeBlocks, 917 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 834 ConstructedInterpolants, 0 QuantifiedInterpolants, 223379 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...