/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-OGIterative-Hitting.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f [2021-08-13 11:33:33,617 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-13 11:33:33,619 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-13 11:33:33,650 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-13 11:33:33,650 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-13 11:33:33,653 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-13 11:33:33,654 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-13 11:33:33,659 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-13 11:33:33,660 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-13 11:33:33,663 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-13 11:33:33,664 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-13 11:33:33,665 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-13 11:33:33,665 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-13 11:33:33,667 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-13 11:33:33,668 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-13 11:33:33,669 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-13 11:33:33,671 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-13 11:33:33,671 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-13 11:33:33,673 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-13 11:33:33,677 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-13 11:33:33,679 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-13 11:33:33,680 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-13 11:33:33,681 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-13 11:33:33,682 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-13 11:33:33,687 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-13 11:33:33,687 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-13 11:33:33,687 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-13 11:33:33,688 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-13 11:33:33,689 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-13 11:33:33,689 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-13 11:33:33,689 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-13 11:33:33,690 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-13 11:33:33,691 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-13 11:33:33,691 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-13 11:33:33,693 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-13 11:33:33,693 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-13 11:33:33,694 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-13 11:33:33,694 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-13 11:33:33,694 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-13 11:33:33,694 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-13 11:33:33,695 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-13 11:33:33,698 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-OGIterative-Hitting.epf [2021-08-13 11:33:36,795 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-13 11:33:36,796 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-13 11:33:36,797 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-13 11:33:36,797 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-13 11:33:36,797 INFO L138 SettingsManager]: * Use SBE=true [2021-08-13 11:33:36,797 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-13 11:33:36,797 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-13 11:33:36,797 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-13 11:33:36,797 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-13 11:33:36,797 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-13 11:33:36,797 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-13 11:33:36,798 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-13 11:33:36,798 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-13 11:33:36,798 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-13 11:33:36,798 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-13 11:33:36,798 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-13 11:33:36,798 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-13 11:33:36,798 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-13 11:33:36,798 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-13 11:33:36,798 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-13 11:33:36,798 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-13 11:33:36,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-13 11:33:36,799 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-13 11:33:36,799 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-13 11:33:36,799 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-13 11:33:36,799 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-13 11:33:36,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-13 11:33:36,799 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-13 11:33:36,799 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-08-13 11:33:36,799 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-13 11:33:36,799 INFO L138 SettingsManager]: * Compute cosets for OwickiGries annotation iteratively=true [2021-08-13 11:33:36,799 INFO L138 SettingsManager]: * Use hitting sets in computation of OwickiGries annotation=true [2021-08-13 11:33:36,799 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-08-13 11:33:37,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-13 11:33:37,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-13 11:33:37,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-13 11:33:37,084 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-13 11:33:37,086 INFO L275 PluginConnector]: CDTParser initialized [2021-08-13 11:33:37,087 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i [2021-08-13 11:33:37,128 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87a6615cd/521fbc00a1864134acab2cbc85d95c9e/FLAG65a0691c1 [2021-08-13 11:33:37,473 INFO L306 CDTParser]: Found 1 translation units. [2021-08-13 11:33:37,473 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i [2021-08-13 11:33:37,486 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87a6615cd/521fbc00a1864134acab2cbc85d95c9e/FLAG65a0691c1 [2021-08-13 11:33:37,855 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87a6615cd/521fbc00a1864134acab2cbc85d95c9e [2021-08-13 11:33:37,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-13 11:33:37,858 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-13 11:33:37,861 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-13 11:33:37,861 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-13 11:33:37,864 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-13 11:33:37,865 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 11:33:37" (1/1) ... [2021-08-13 11:33:37,866 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d43629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 11:33:37, skipping insertion in model container [2021-08-13 11:33:37,866 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 11:33:37" (1/1) ... [2021-08-13 11:33:37,870 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-13 11:33:37,916 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-13 11:33:38,074 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i[950,963] [2021-08-13 11:33:38,261 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 11:33:38,266 INFO L203 MainTranslator]: Completed pre-run [2021-08-13 11:33:38,276 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i[950,963] [2021-08-13 11:33:38,321 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 11:33:38,381 INFO L208 MainTranslator]: Completed translation [2021-08-13 11:33:38,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 11:33:38 WrapperNode [2021-08-13 11:33:38,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-13 11:33:38,383 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-13 11:33:38,383 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-13 11:33:38,383 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-13 11:33:38,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 11:33:38" (1/1) ... [2021-08-13 11:33:38,415 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 11:33:38" (1/1) ... [2021-08-13 11:33:38,445 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-13 11:33:38,446 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-13 11:33:38,446 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-13 11:33:38,446 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-13 11:33:38,451 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 11:33:38" (1/1) ... [2021-08-13 11:33:38,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 11:33:38" (1/1) ... [2021-08-13 11:33:38,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 11:33:38" (1/1) ... [2021-08-13 11:33:38,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 11:33:38" (1/1) ... [2021-08-13 11:33:38,466 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 11:33:38" (1/1) ... [2021-08-13 11:33:38,468 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 11:33:38" (1/1) ... [2021-08-13 11:33:38,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 11:33:38" (1/1) ... [2021-08-13 11:33:38,472 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-13 11:33:38,472 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-13 11:33:38,492 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-13 11:33:38,492 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-13 11:33:38,493 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 11:33:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-13 11:33:38,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-13 11:33:38,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-13 11:33:38,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-13 11:33:38,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-13 11:33:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-13 11:33:38,548 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-13 11:33:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-13 11:33:38,548 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-13 11:33:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-13 11:33:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-13 11:33:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-13 11:33:38,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-13 11:33:38,550 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-13 11:33:39,828 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-13 11:33:39,828 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-13 11:33:39,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 11:33:39 BoogieIcfgContainer [2021-08-13 11:33:39,829 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-13 11:33:39,830 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-13 11:33:39,831 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-13 11:33:39,832 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-13 11:33:39,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.08 11:33:37" (1/3) ... [2021-08-13 11:33:39,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a56d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 11:33:39, skipping insertion in model container [2021-08-13 11:33:39,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 11:33:38" (2/3) ... [2021-08-13 11:33:39,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a56d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 11:33:39, skipping insertion in model container [2021-08-13 11:33:39,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 11:33:39" (3/3) ... [2021-08-13 11:33:39,834 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_pso.oepc.i [2021-08-13 11:33:39,838 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-13 11:33:39,838 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-13 11:33:39,839 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-13 11:33:39,856 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,856 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,856 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,857 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,857 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,857 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,857 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,857 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,857 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,857 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,857 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,857 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,857 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,858 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,858 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,858 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,858 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,858 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,858 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,858 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,858 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,858 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,858 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,860 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,860 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,860 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,860 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,860 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,860 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,860 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,860 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,862 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,862 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,862 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,862 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,862 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,862 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,863 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,863 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,865 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,865 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,865 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,865 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,865 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,866 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,866 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,866 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,866 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,866 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,866 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,866 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:33:39,867 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-13 11:33:39,880 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-08-13 11:33:39,892 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-13 11:33:39,892 INFO L379 AbstractCegarLoop]: Hoare is false [2021-08-13 11:33:39,892 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-13 11:33:39,892 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-13 11:33:39,892 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-13 11:33:39,892 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-13 11:33:39,893 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-13 11:33:39,893 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-13 11:33:39,899 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 90 places, 85 transitions, 180 flow [2021-08-13 11:33:39,919 INFO L129 PetriNetUnfolder]: 2/83 cut-off events. [2021-08-13 11:33:39,919 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 11:33:39,921 INFO L84 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 83 events. 2/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 42 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2021-08-13 11:33:39,921 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 85 transitions, 180 flow [2021-08-13 11:33:39,924 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 83 transitions, 172 flow [2021-08-13 11:33:39,929 INFO L129 PetriNetUnfolder]: 0/38 cut-off events. [2021-08-13 11:33:39,929 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 11:33:39,929 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:33:39,930 INFO L266 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] [2021-08-13 11:33:39,930 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:33:39,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:33:39,933 INFO L82 PathProgramCache]: Analyzing trace with hash 182407281, now seen corresponding path program 1 times [2021-08-13 11:33:39,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:33:39,938 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491499690] [2021-08-13 11:33:39,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:33:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:33:40,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:40,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:33:40,107 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:40,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:33:40,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 11:33:40,114 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:33:40,114 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491499690] [2021-08-13 11:33:40,115 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491499690] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:33:40,115 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:33:40,115 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-13 11:33:40,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546662490] [2021-08-13 11:33:40,121 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-13 11:33:40,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:33:40,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-13 11:33:40,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-13 11:33:40,131 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 85 [2021-08-13 11:33:40,134 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 83 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:40,134 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:33:40,134 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 85 [2021-08-13 11:33:40,135 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:33:40,211 INFO L129 PetriNetUnfolder]: 16/143 cut-off events. [2021-08-13 11:33:40,211 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 11:33:40,212 INFO L84 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 143 events. 16/143 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 362 event pairs, 2 based on Foata normal form. 7/143 useless extension candidates. Maximal degree in co-relation 143. Up to 27 conditions per place. [2021-08-13 11:33:40,214 INFO L132 encePairwiseOnDemand]: 80/85 looper letters, 7 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2021-08-13 11:33:40,214 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 82 transitions, 188 flow [2021-08-13 11:33:40,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-13 11:33:40,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-13 11:33:40,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 239 transitions. [2021-08-13 11:33:40,223 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9372549019607843 [2021-08-13 11:33:40,224 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 239 transitions. [2021-08-13 11:33:40,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 239 transitions. [2021-08-13 11:33:40,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:33:40,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 239 transitions. [2021-08-13 11:33:40,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:40,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:40,236 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:40,237 INFO L348 CegarLoopForPetriNet]: 88 programPoint places, 0 predicate places. [2021-08-13 11:33:40,237 INFO L482 AbstractCegarLoop]: Abstraction has has 88 places, 82 transitions, 188 flow [2021-08-13 11:33:40,238 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:40,238 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:33:40,238 INFO L266 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] [2021-08-13 11:33:40,238 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-13 11:33:40,239 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:33:40,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:33:40,239 INFO L82 PathProgramCache]: Analyzing trace with hash 85745205, now seen corresponding path program 1 times [2021-08-13 11:33:40,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:33:40,242 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49350277] [2021-08-13 11:33:40,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:33:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:33:40,362 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:40,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:33:40,363 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:40,363 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:33:40,370 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 11:33:40,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 11:33:40,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:40,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:33:40,395 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:40,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:33:40,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:40,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:33:40,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 11:33:40,407 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:33:40,407 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49350277] [2021-08-13 11:33:40,407 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49350277] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:33:40,407 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:33:40,407 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 11:33:40,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237558462] [2021-08-13 11:33:40,409 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 11:33:40,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:33:40,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 11:33:40,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 11:33:40,412 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 85 [2021-08-13 11:33:40,412 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 82 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:40,412 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:33:40,412 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 85 [2021-08-13 11:33:40,413 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:33:40,596 INFO L129 PetriNetUnfolder]: 59/348 cut-off events. [2021-08-13 11:33:40,596 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-08-13 11:33:40,599 INFO L84 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 348 events. 59/348 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1854 event pairs, 22 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 477. Up to 72 conditions per place. [2021-08-13 11:33:40,600 INFO L132 encePairwiseOnDemand]: 78/85 looper letters, 10 selfloop transitions, 3 changer transitions 22/106 dead transitions. [2021-08-13 11:33:40,600 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 106 transitions, 310 flow [2021-08-13 11:33:40,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 11:33:40,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 11:33:40,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 683 transitions. [2021-08-13 11:33:40,604 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8928104575163399 [2021-08-13 11:33:40,605 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 683 transitions. [2021-08-13 11:33:40,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 683 transitions. [2021-08-13 11:33:40,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:33:40,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 683 transitions. [2021-08-13 11:33:40,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 75.88888888888889) internal successors, (683), 9 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:40,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 85.0) internal successors, (850), 10 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:40,610 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 85.0) internal successors, (850), 10 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:40,610 INFO L348 CegarLoopForPetriNet]: 88 programPoint places, 8 predicate places. [2021-08-13 11:33:40,610 INFO L482 AbstractCegarLoop]: Abstraction has has 96 places, 106 transitions, 310 flow [2021-08-13 11:33:40,611 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:40,611 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:33:40,611 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 11:33:40,611 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-13 11:33:40,611 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:33:40,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:33:40,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1675875978, now seen corresponding path program 1 times [2021-08-13 11:33:40,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:33:40,619 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821451925] [2021-08-13 11:33:40,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:33:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:33:40,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:40,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:33:40,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:40,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:33:40,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:40,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 11:33:40,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:40,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 11:33:40,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:40,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 11:33:40,817 INFO L142 QuantifierPusher]: treesize reduction 37, result has 45.6 percent of original size [2021-08-13 11:33:40,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-08-13 11:33:40,838 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 11:33:40,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 11:33:40,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:40,856 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:33:40,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:40,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:33:40,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:40,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:33:40,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 11:33:40,881 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:33:40,881 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821451925] [2021-08-13 11:33:40,882 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821451925] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:33:40,882 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:33:40,882 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-13 11:33:40,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934051377] [2021-08-13 11:33:40,882 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-13 11:33:40,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:33:40,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-13 11:33:40,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-08-13 11:33:40,884 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 85 [2021-08-13 11:33:40,885 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 106 transitions, 310 flow. Second operand has 10 states, 10 states have (on average 66.1) internal successors, (661), 10 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:40,885 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:33:40,885 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 85 [2021-08-13 11:33:40,885 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:33:41,227 INFO L129 PetriNetUnfolder]: 377/1237 cut-off events. [2021-08-13 11:33:41,228 INFO L130 PetriNetUnfolder]: For 286/338 co-relation queries the response was YES. [2021-08-13 11:33:41,230 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2435 conditions, 1237 events. 377/1237 cut-off events. For 286/338 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 9177 event pairs, 100 based on Foata normal form. 2/1206 useless extension candidates. Maximal degree in co-relation 2384. Up to 298 conditions per place. [2021-08-13 11:33:41,232 INFO L132 encePairwiseOnDemand]: 73/85 looper letters, 15 selfloop transitions, 10 changer transitions 91/174 dead transitions. [2021-08-13 11:33:41,232 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 174 transitions, 760 flow [2021-08-13 11:33:41,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-13 11:33:41,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-08-13 11:33:41,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1038 transitions. [2021-08-13 11:33:41,234 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8141176470588235 [2021-08-13 11:33:41,234 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1038 transitions. [2021-08-13 11:33:41,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1038 transitions. [2021-08-13 11:33:41,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:33:41,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1038 transitions. [2021-08-13 11:33:41,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 69.2) internal successors, (1038), 15 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:41,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 85.0) internal successors, (1360), 16 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:41,239 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 85.0) internal successors, (1360), 16 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:41,239 INFO L348 CegarLoopForPetriNet]: 88 programPoint places, 22 predicate places. [2021-08-13 11:33:41,239 INFO L482 AbstractCegarLoop]: Abstraction has has 110 places, 174 transitions, 760 flow [2021-08-13 11:33:41,240 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 66.1) internal successors, (661), 10 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:41,240 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:33:41,240 INFO L266 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] [2021-08-13 11:33:41,240 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-13 11:33:41,240 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:33:41,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:33:41,240 INFO L82 PathProgramCache]: Analyzing trace with hash -279188178, now seen corresponding path program 1 times [2021-08-13 11:33:41,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:33:41,240 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426202892] [2021-08-13 11:33:41,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:33:41,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:33:41,286 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:41,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:33:41,287 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:41,287 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:33:41,290 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 11:33:41,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 11:33:41,304 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:41,304 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:33:41,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:41,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:33:41,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:41,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:33:41,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 11:33:41,318 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:33:41,318 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426202892] [2021-08-13 11:33:41,318 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426202892] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:33:41,318 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:33:41,318 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 11:33:41,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415025592] [2021-08-13 11:33:41,319 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 11:33:41,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:33:41,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 11:33:41,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 11:33:41,320 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 85 [2021-08-13 11:33:41,320 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 174 transitions, 760 flow. Second operand has 6 states, 6 states have (on average 73.33333333333333) internal successors, (440), 6 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:41,320 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:33:41,320 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 85 [2021-08-13 11:33:41,320 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:33:41,584 INFO L129 PetriNetUnfolder]: 523/1818 cut-off events. [2021-08-13 11:33:41,584 INFO L130 PetriNetUnfolder]: For 693/810 co-relation queries the response was YES. [2021-08-13 11:33:41,587 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4086 conditions, 1818 events. 523/1818 cut-off events. For 693/810 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 15581 event pairs, 142 based on Foata normal form. 3/1783 useless extension candidates. Maximal degree in co-relation 4032. Up to 553 conditions per place. [2021-08-13 11:33:41,590 INFO L132 encePairwiseOnDemand]: 79/85 looper letters, 14 selfloop transitions, 3 changer transitions 125/212 dead transitions. [2021-08-13 11:33:41,590 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 212 transitions, 1202 flow [2021-08-13 11:33:41,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 11:33:41,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 11:33:41,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 678 transitions. [2021-08-13 11:33:41,592 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8862745098039215 [2021-08-13 11:33:41,592 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 678 transitions. [2021-08-13 11:33:41,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 678 transitions. [2021-08-13 11:33:41,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:33:41,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 678 transitions. [2021-08-13 11:33:41,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 75.33333333333333) internal successors, (678), 9 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:41,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 85.0) internal successors, (850), 10 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:41,595 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 85.0) internal successors, (850), 10 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:41,595 INFO L348 CegarLoopForPetriNet]: 88 programPoint places, 30 predicate places. [2021-08-13 11:33:41,595 INFO L482 AbstractCegarLoop]: Abstraction has has 118 places, 212 transitions, 1202 flow [2021-08-13 11:33:41,595 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 73.33333333333333) internal successors, (440), 6 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:41,595 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:33:41,595 INFO L266 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] [2021-08-13 11:33:41,595 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-13 11:33:41,595 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:33:41,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:33:41,596 INFO L82 PathProgramCache]: Analyzing trace with hash 585299762, now seen corresponding path program 1 times [2021-08-13 11:33:41,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:33:41,596 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570511148] [2021-08-13 11:33:41,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:33:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:33:41,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:41,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:33:41,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:41,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:33:41,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:41,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 11:33:41,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:41,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 11:33:41,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:41,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 11:33:41,721 INFO L142 QuantifierPusher]: treesize reduction 21, result has 67.2 percent of original size [2021-08-13 11:33:41,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-08-13 11:33:41,749 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 11:33:41,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 11:33:41,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:41,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:33:41,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:41,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:33:41,865 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:41,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:33:41,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 11:33:41,866 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:33:41,866 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570511148] [2021-08-13 11:33:41,867 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570511148] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:33:41,867 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:33:41,867 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-13 11:33:41,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277228434] [2021-08-13 11:33:41,867 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-13 11:33:41,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:33:41,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-13 11:33:41,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-08-13 11:33:41,868 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 85 [2021-08-13 11:33:41,869 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 212 transitions, 1202 flow. Second operand has 10 states, 10 states have (on average 66.2) internal successors, (662), 10 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:41,869 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:33:41,869 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 85 [2021-08-13 11:33:41,869 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:33:42,501 INFO L129 PetriNetUnfolder]: 628/2179 cut-off events. [2021-08-13 11:33:42,501 INFO L130 PetriNetUnfolder]: For 1160/1681 co-relation queries the response was YES. [2021-08-13 11:33:42,504 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6144 conditions, 2179 events. 628/2179 cut-off events. For 1160/1681 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 19686 event pairs, 59 based on Foata normal form. 18/2159 useless extension candidates. Maximal degree in co-relation 6084. Up to 771 conditions per place. [2021-08-13 11:33:42,508 INFO L132 encePairwiseOnDemand]: 74/85 looper letters, 34 selfloop transitions, 12 changer transitions 241/345 dead transitions. [2021-08-13 11:33:42,508 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 345 transitions, 2732 flow [2021-08-13 11:33:42,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-13 11:33:42,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-08-13 11:33:42,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1317 transitions. [2021-08-13 11:33:42,510 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8154798761609907 [2021-08-13 11:33:42,510 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1317 transitions. [2021-08-13 11:33:42,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1317 transitions. [2021-08-13 11:33:42,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:33:42,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1317 transitions. [2021-08-13 11:33:42,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 69.3157894736842) internal successors, (1317), 19 states have internal predecessors, (1317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:42,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 85.0) internal successors, (1700), 20 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:42,515 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 85.0) internal successors, (1700), 20 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:42,516 INFO L348 CegarLoopForPetriNet]: 88 programPoint places, 48 predicate places. [2021-08-13 11:33:42,516 INFO L482 AbstractCegarLoop]: Abstraction has has 136 places, 345 transitions, 2732 flow [2021-08-13 11:33:42,516 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 66.2) internal successors, (662), 10 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:42,516 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:33:42,516 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 11:33:42,516 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-13 11:33:42,516 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:33:42,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:33:42,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1219701388, now seen corresponding path program 1 times [2021-08-13 11:33:42,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:33:42,517 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813140740] [2021-08-13 11:33:42,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:33:42,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:33:42,568 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:42,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:33:42,569 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:42,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:33:42,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:42,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 11:33:42,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:42,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 11:33:42,584 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-08-13 11:33:42,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-08-13 11:33:42,601 INFO L142 QuantifierPusher]: treesize reduction 52, result has 52.7 percent of original size [2021-08-13 11:33:42,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 58 [2021-08-13 11:33:42,625 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 11:33:42,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 11:33:42,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:42,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:33:42,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:42,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:33:42,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:42,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:33:42,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 11:33:42,678 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:33:42,678 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813140740] [2021-08-13 11:33:42,678 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813140740] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:33:42,678 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:33:42,678 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-13 11:33:42,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101751740] [2021-08-13 11:33:42,678 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-13 11:33:42,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:33:42,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-13 11:33:42,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-08-13 11:33:42,680 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 85 [2021-08-13 11:33:42,680 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 345 transitions, 2732 flow. Second operand has 10 states, 10 states have (on average 66.2) internal successors, (662), 10 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:42,680 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:33:42,680 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 85 [2021-08-13 11:33:42,680 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:33:43,214 INFO L129 PetriNetUnfolder]: 670/2544 cut-off events. [2021-08-13 11:33:43,214 INFO L130 PetriNetUnfolder]: For 1824/2523 co-relation queries the response was YES. [2021-08-13 11:33:43,218 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8126 conditions, 2544 events. 670/2544 cut-off events. For 1824/2523 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 24696 event pairs, 17 based on Foata normal form. 60/2582 useless extension candidates. Maximal degree in co-relation 8060. Up to 870 conditions per place. [2021-08-13 11:33:43,221 INFO L132 encePairwiseOnDemand]: 74/85 looper letters, 33 selfloop transitions, 10 changer transitions 320/421 dead transitions. [2021-08-13 11:33:43,221 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 421 transitions, 4118 flow [2021-08-13 11:33:43,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-13 11:33:43,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-13 11:33:43,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1102 transitions. [2021-08-13 11:33:43,223 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8102941176470588 [2021-08-13 11:33:43,223 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1102 transitions. [2021-08-13 11:33:43,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1102 transitions. [2021-08-13 11:33:43,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:33:43,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1102 transitions. [2021-08-13 11:33:43,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 68.875) internal successors, (1102), 16 states have internal predecessors, (1102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:43,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 85.0) internal successors, (1445), 17 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:43,228 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 85.0) internal successors, (1445), 17 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:43,228 INFO L348 CegarLoopForPetriNet]: 88 programPoint places, 63 predicate places. [2021-08-13 11:33:43,228 INFO L482 AbstractCegarLoop]: Abstraction has has 151 places, 421 transitions, 4118 flow [2021-08-13 11:33:43,229 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 66.2) internal successors, (662), 10 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:43,229 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:33:43,229 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 11:33:43,229 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-13 11:33:43,229 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:33:43,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:33:43,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1090617911, now seen corresponding path program 1 times [2021-08-13 11:33:43,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:33:43,229 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275304088] [2021-08-13 11:33:43,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:33:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:33:43,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:43,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:33:43,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:43,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:33:43,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:43,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 11:33:43,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:43,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 11:33:43,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:43,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 11:33:43,347 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:43,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-08-13 11:33:43,360 INFO L142 QuantifierPusher]: treesize reduction 37, result has 56.0 percent of original size [2021-08-13 11:33:43,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-08-13 11:33:43,380 INFO L142 QuantifierPusher]: treesize reduction 26, result has 54.4 percent of original size [2021-08-13 11:33:43,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-08-13 11:33:43,402 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 11:33:43,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 11:33:43,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:43,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:33:43,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:43,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:33:43,439 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:43,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:33:43,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 11:33:43,440 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:33:43,440 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275304088] [2021-08-13 11:33:43,440 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275304088] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:33:43,440 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:33:43,440 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-13 11:33:43,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835005415] [2021-08-13 11:33:43,440 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-08-13 11:33:43,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:33:43,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-13 11:33:43,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-08-13 11:33:43,441 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 85 [2021-08-13 11:33:43,442 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 421 transitions, 4118 flow. Second operand has 12 states, 12 states have (on average 65.16666666666667) internal successors, (782), 12 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:43,442 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:33:43,442 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 85 [2021-08-13 11:33:43,442 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:33:43,908 INFO L129 PetriNetUnfolder]: 700/2706 cut-off events. [2021-08-13 11:33:43,908 INFO L130 PetriNetUnfolder]: For 2727/3906 co-relation queries the response was YES. [2021-08-13 11:33:43,913 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9870 conditions, 2706 events. 700/2706 cut-off events. For 2727/3906 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 26894 event pairs, 4 based on Foata normal form. 29/2714 useless extension candidates. Maximal degree in co-relation 9797. Up to 1125 conditions per place. [2021-08-13 11:33:43,916 INFO L132 encePairwiseOnDemand]: 75/85 looper letters, 31 selfloop transitions, 8 changer transitions 366/462 dead transitions. [2021-08-13 11:33:43,916 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 462 transitions, 5340 flow [2021-08-13 11:33:43,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 11:33:43,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 11:33:43,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 886 transitions. [2021-08-13 11:33:43,918 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8018099547511313 [2021-08-13 11:33:43,918 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 886 transitions. [2021-08-13 11:33:43,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 886 transitions. [2021-08-13 11:33:43,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:33:43,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 886 transitions. [2021-08-13 11:33:43,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 68.15384615384616) internal successors, (886), 13 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:43,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:43,922 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:43,922 INFO L348 CegarLoopForPetriNet]: 88 programPoint places, 75 predicate places. [2021-08-13 11:33:43,922 INFO L482 AbstractCegarLoop]: Abstraction has has 163 places, 462 transitions, 5340 flow [2021-08-13 11:33:43,922 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 65.16666666666667) internal successors, (782), 12 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:43,922 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:33:43,922 INFO L266 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] [2021-08-13 11:33:43,923 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-13 11:33:43,923 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:33:43,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:33:43,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1301708467, now seen corresponding path program 1 times [2021-08-13 11:33:43,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:33:43,923 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065185689] [2021-08-13 11:33:43,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:33:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:33:43,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:43,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:33:43,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:43,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:33:43,961 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 11:33:43,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 11:33:43,973 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:43,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 11:33:43,979 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 11:33:43,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:33:43,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:43,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:33:43,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 11:33:43,986 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:33:43,986 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065185689] [2021-08-13 11:33:43,986 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065185689] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:33:43,986 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:33:43,986 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 11:33:43,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500641950] [2021-08-13 11:33:43,987 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 11:33:43,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:33:43,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 11:33:43,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 11:33:43,988 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 85 [2021-08-13 11:33:43,988 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 462 transitions, 5340 flow. Second operand has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:43,988 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:33:43,988 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 85 [2021-08-13 11:33:43,988 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:33:44,166 INFO L129 PetriNetUnfolder]: 181/805 cut-off events. [2021-08-13 11:33:44,166 INFO L130 PetriNetUnfolder]: For 585/650 co-relation queries the response was YES. [2021-08-13 11:33:44,168 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2528 conditions, 805 events. 181/805 cut-off events. For 585/650 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5679 event pairs, 12 based on Foata normal form. 1/759 useless extension candidates. Maximal degree in co-relation 2452. Up to 258 conditions per place. [2021-08-13 11:33:44,169 INFO L132 encePairwiseOnDemand]: 76/85 looper letters, 13 selfloop transitions, 14 changer transitions 68/184 dead transitions. [2021-08-13 11:33:44,169 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 184 transitions, 1532 flow [2021-08-13 11:33:44,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-13 11:33:44,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-13 11:33:44,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 755 transitions. [2021-08-13 11:33:44,171 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.888235294117647 [2021-08-13 11:33:44,171 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 755 transitions. [2021-08-13 11:33:44,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 755 transitions. [2021-08-13 11:33:44,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:33:44,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 755 transitions. [2021-08-13 11:33:44,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 75.5) internal successors, (755), 10 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:44,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 85.0) internal successors, (935), 11 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:44,174 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 85.0) internal successors, (935), 11 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:44,174 INFO L348 CegarLoopForPetriNet]: 88 programPoint places, 54 predicate places. [2021-08-13 11:33:44,174 INFO L482 AbstractCegarLoop]: Abstraction has has 142 places, 184 transitions, 1532 flow [2021-08-13 11:33:44,174 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:44,174 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:33:44,174 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 11:33:44,174 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-13 11:33:44,174 INFO L430 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:33:44,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:33:44,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1233357192, now seen corresponding path program 1 times [2021-08-13 11:33:44,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:33:44,175 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842529506] [2021-08-13 11:33:44,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:33:44,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:33:44,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:44,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:33:44,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:44,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:33:44,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:44,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:33:44,230 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 11:33:44,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 11:33:44,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:44,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 11:33:44,250 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 11:33:44,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:33:44,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:44,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:33:44,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 11:33:44,257 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:33:44,257 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842529506] [2021-08-13 11:33:44,258 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842529506] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:33:44,260 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:33:44,260 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 11:33:44,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022267780] [2021-08-13 11:33:44,260 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 11:33:44,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:33:44,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 11:33:44,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-13 11:33:44,261 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 85 [2021-08-13 11:33:44,261 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 184 transitions, 1532 flow. Second operand has 7 states, 7 states have (on average 73.14285714285714) internal successors, (512), 7 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:44,261 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:33:44,261 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 85 [2021-08-13 11:33:44,261 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:33:44,403 INFO L129 PetriNetUnfolder]: 80/395 cut-off events. [2021-08-13 11:33:44,403 INFO L130 PetriNetUnfolder]: For 160/366 co-relation queries the response was YES. [2021-08-13 11:33:44,404 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1051 conditions, 395 events. 80/395 cut-off events. For 160/366 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2495 event pairs, 0 based on Foata normal form. 51/418 useless extension candidates. Maximal degree in co-relation 972. Up to 69 conditions per place. [2021-08-13 11:33:44,404 INFO L132 encePairwiseOnDemand]: 76/85 looper letters, 12 selfloop transitions, 17 changer transitions 40/134 dead transitions. [2021-08-13 11:33:44,404 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 134 transitions, 802 flow [2021-08-13 11:33:44,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 11:33:44,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 11:33:44,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 972 transitions. [2021-08-13 11:33:44,407 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8796380090497737 [2021-08-13 11:33:44,407 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 972 transitions. [2021-08-13 11:33:44,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 972 transitions. [2021-08-13 11:33:44,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:33:44,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 972 transitions. [2021-08-13 11:33:44,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 74.76923076923077) internal successors, (972), 13 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:44,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:44,412 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:44,413 INFO L348 CegarLoopForPetriNet]: 88 programPoint places, 51 predicate places. [2021-08-13 11:33:44,413 INFO L482 AbstractCegarLoop]: Abstraction has has 139 places, 134 transitions, 802 flow [2021-08-13 11:33:44,413 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 73.14285714285714) internal successors, (512), 7 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:44,413 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:33:44,413 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 11:33:44,413 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-13 11:33:44,413 INFO L430 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:33:44,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:33:44,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1033692867, now seen corresponding path program 1 times [2021-08-13 11:33:44,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:33:44,414 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913721413] [2021-08-13 11:33:44,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:33:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:33:44,506 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:44,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:33:44,507 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:44,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:33:44,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:44,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 11:33:44,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:44,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 11:33:44,527 INFO L142 QuantifierPusher]: treesize reduction 19, result has 74.3 percent of original size [2021-08-13 11:33:44,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 55 [2021-08-13 11:33:44,552 INFO L142 QuantifierPusher]: treesize reduction 34, result has 70.9 percent of original size [2021-08-13 11:33:44,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 83 [2021-08-13 11:33:44,604 INFO L142 QuantifierPusher]: treesize reduction 34, result has 71.7 percent of original size [2021-08-13 11:33:44,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 86 [2021-08-13 11:33:44,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:44,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-08-13 11:33:44,651 INFO L142 QuantifierPusher]: treesize reduction 26, result has 57.4 percent of original size [2021-08-13 11:33:44,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-08-13 11:33:44,673 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 11:33:44,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 11:33:44,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:44,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:33:44,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:44,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:33:44,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:33:44,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:33:44,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 11:33:44,709 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:33:44,709 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913721413] [2021-08-13 11:33:44,709 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913721413] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:33:44,709 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:33:44,709 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-13 11:33:44,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730900153] [2021-08-13 11:33:44,710 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-08-13 11:33:44,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:33:44,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-13 11:33:44,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-08-13 11:33:44,711 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 85 [2021-08-13 11:33:44,712 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 134 transitions, 802 flow. Second operand has 13 states, 13 states have (on average 63.38461538461539) internal successors, (824), 13 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:44,712 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:33:44,712 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 85 [2021-08-13 11:33:44,712 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:33:44,946 INFO L129 PetriNetUnfolder]: 168/735 cut-off events. [2021-08-13 11:33:44,947 INFO L130 PetriNetUnfolder]: For 324/398 co-relation queries the response was YES. [2021-08-13 11:33:44,948 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2025 conditions, 735 events. 168/735 cut-off events. For 324/398 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5706 event pairs, 0 based on Foata normal form. 4/694 useless extension candidates. Maximal degree in co-relation 1937. Up to 149 conditions per place. [2021-08-13 11:33:44,949 INFO L132 encePairwiseOnDemand]: 74/85 looper letters, 20 selfloop transitions, 6 changer transitions 79/159 dead transitions. [2021-08-13 11:33:44,949 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 159 transitions, 1266 flow [2021-08-13 11:33:44,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-13 11:33:44,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-08-13 11:33:44,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 784 transitions. [2021-08-13 11:33:44,951 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.7686274509803922 [2021-08-13 11:33:44,951 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 784 transitions. [2021-08-13 11:33:44,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 784 transitions. [2021-08-13 11:33:44,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:33:44,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 784 transitions. [2021-08-13 11:33:44,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 65.33333333333333) internal successors, (784), 12 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:44,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 85.0) internal successors, (1105), 13 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:44,954 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 85.0) internal successors, (1105), 13 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:44,954 INFO L348 CegarLoopForPetriNet]: 88 programPoint places, 62 predicate places. [2021-08-13 11:33:44,954 INFO L482 AbstractCegarLoop]: Abstraction has has 150 places, 159 transitions, 1266 flow [2021-08-13 11:33:44,954 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 63.38461538461539) internal successors, (824), 13 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:33:44,954 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:33:44,954 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 11:33:44,954 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-13 11:33:44,954 INFO L430 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:33:44,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:33:44,955 INFO L82 PathProgramCache]: Analyzing trace with hash -732201855, now seen corresponding path program 2 times [2021-08-13 11:33:44,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:33:44,955 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691308010] [2021-08-13 11:33:44,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:33:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 11:33:44,977 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 11:33:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 11:33:45,002 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 11:33:45,028 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-13 11:33:45,028 INFO L651 BasicCegarLoop]: Counterexample might be feasible [2021-08-13 11:33:45,028 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-13 11:33:45,030 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-13 11:33:45,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.08 11:33:45 BasicIcfg [2021-08-13 11:33:45,087 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-13 11:33:45,088 INFO L168 Benchmark]: Toolchain (without parser) took 7229.63 ms. Allocated memory was 127.9 MB in the beginning and 546.3 MB in the end (delta: 418.4 MB). Free memory was 90.5 MB in the beginning and 349.6 MB in the end (delta: -259.1 MB). Peak memory consumption was 160.3 MB. Max. memory is 8.0 GB. [2021-08-13 11:33:45,088 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 127.9 MB. Free memory is still 108.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-13 11:33:45,088 INFO L168 Benchmark]: CACSL2BoogieTranslator took 520.93 ms. Allocated memory was 127.9 MB in the beginning and 174.1 MB in the end (delta: 46.1 MB). Free memory was 90.3 MB in the beginning and 134.4 MB in the end (delta: -44.1 MB). Peak memory consumption was 6.0 MB. Max. memory is 8.0 GB. [2021-08-13 11:33:45,088 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.58 ms. Allocated memory is still 174.1 MB. Free memory was 134.4 MB in the beginning and 131.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-13 11:33:45,089 INFO L168 Benchmark]: Boogie Preprocessor took 25.91 ms. Allocated memory is still 174.1 MB. Free memory was 131.8 MB in the beginning and 129.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-13 11:33:45,089 INFO L168 Benchmark]: RCFGBuilder took 1357.38 ms. Allocated memory is still 174.1 MB. Free memory was 129.7 MB in the beginning and 137.0 MB in the end (delta: -7.4 MB). Peak memory consumption was 78.6 MB. Max. memory is 8.0 GB. [2021-08-13 11:33:45,089 INFO L168 Benchmark]: TraceAbstraction took 5257.09 ms. Allocated memory was 174.1 MB in the beginning and 546.3 MB in the end (delta: 372.2 MB). Free memory was 136.5 MB in the beginning and 349.6 MB in the end (delta: -213.1 MB). Peak memory consumption was 158.6 MB. Max. memory is 8.0 GB. [2021-08-13 11:33:45,090 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09 ms. Allocated memory is still 127.9 MB. Free memory is still 108.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 520.93 ms. Allocated memory was 127.9 MB in the beginning and 174.1 MB in the end (delta: 46.1 MB). Free memory was 90.3 MB in the beginning and 134.4 MB in the end (delta: -44.1 MB). Peak memory consumption was 6.0 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 62.58 ms. Allocated memory is still 174.1 MB. Free memory was 134.4 MB in the beginning and 131.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 25.91 ms. Allocated memory is still 174.1 MB. Free memory was 131.8 MB in the beginning and 129.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1357.38 ms. Allocated memory is still 174.1 MB. Free memory was 129.7 MB in the beginning and 137.0 MB in the end (delta: -7.4 MB). Peak memory consumption was 78.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 5257.09 ms. Allocated memory was 174.1 MB in the beginning and 546.3 MB in the end (delta: 372.2 MB). Free memory was 136.5 MB in the beginning and 349.6 MB in the end (delta: -213.1 MB). Peak memory consumption was 158.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L709] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L710] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L712] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L714] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L715] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L716] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L717] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L718] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L719] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L720] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L721] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L722] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L723] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L724] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L725] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L726] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L727] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L728] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L729] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L730] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 0 pthread_t t2477; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] FCALL, FORK 0 pthread_create(&t2477, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 x = 1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L792] 0 pthread_t t2478; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L793] FCALL, FORK 0 pthread_create(&t2478, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L752] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L799] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L799] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L799] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L801] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L803] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L810] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L811] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L812] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L813] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L815] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 103 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 5.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 5138.9ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 3204.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 31.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 120 SDtfs, 448 SDslu, 443 SDs, 0 SdLazy, 664 SolverSat, 158 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 648.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 1590.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=5340occurred in iteration=7, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 31.2ms SsaConstructionTime, 310.7ms SatisfiabilityAnalysisTime, 1354.4ms InterpolantComputationTime, 646 NumberOfCodeBlocks, 646 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 570 ConstructedInterpolants, 0 QuantifiedInterpolants, 3133 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...