/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix041_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:08:46,815 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:08:46,817 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:08:46,840 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:08:46,841 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:08:46,842 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:08:46,843 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:08:46,845 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:08:46,846 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:08:46,847 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:08:46,848 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:08:46,849 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:08:46,849 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:08:46,850 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:08:46,851 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:08:46,852 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:08:46,852 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:08:46,853 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:08:46,854 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:08:46,856 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:08:46,857 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:08:46,858 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:08:46,859 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:08:46,859 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:08:46,862 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:08:46,862 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:08:46,862 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:08:46,863 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:08:46,863 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:08:46,864 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:08:46,864 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:08:46,865 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:08:46,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:08:46,866 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:08:46,867 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:08:46,867 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:08:46,868 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:08:46,868 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:08:46,868 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:08:46,869 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:08:46,869 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:08:46,870 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 10:08:46,894 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:08:46,895 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:08:46,896 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:08:46,896 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:08:46,896 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:08:46,896 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:08:46,896 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:08:46,896 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:08:46,897 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:08:46,897 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:08:46,897 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:08:46,897 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:08:46,897 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:08:46,897 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:08:46,897 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:08:46,897 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:08:46,898 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:08:46,898 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:08:46,898 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:08:46,898 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:08:46,898 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:08:46,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:08:46,898 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:08:46,899 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:08:46,899 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:08:46,899 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:08:46,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:08:46,899 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:08:46,899 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:08:46,899 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:08:46,899 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 10:08:47,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:08:47,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:08:47,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:08:47,224 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:08:47,224 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:08:47,226 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_rmo.opt.i [2021-03-26 10:08:47,297 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c05490f42/73bd765c2699427fa19d70c6b24e610a/FLAG592d3dff3 [2021-03-26 10:08:47,781 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:08:47,781 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_rmo.opt.i [2021-03-26 10:08:47,805 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c05490f42/73bd765c2699427fa19d70c6b24e610a/FLAG592d3dff3 [2021-03-26 10:08:48,076 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c05490f42/73bd765c2699427fa19d70c6b24e610a [2021-03-26 10:08:48,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:08:48,080 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:08:48,087 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:08:48,087 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:08:48,102 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:08:48,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:08:48" (1/1) ... [2021-03-26 10:08:48,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@625a721d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:08:48, skipping insertion in model container [2021-03-26 10:08:48,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:08:48" (1/1) ... [2021-03-26 10:08:48,112 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:08:48,155 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:08:48,278 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_rmo.opt.i[948,961] [2021-03-26 10:08:48,441 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:08:48,448 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:08:48,461 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_rmo.opt.i[948,961] [2021-03-26 10:08:48,524 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:08:48,582 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:08:48,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:08:48 WrapperNode [2021-03-26 10:08:48,583 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:08:48,584 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:08:48,584 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:08:48,584 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:08:48,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:08:48" (1/1) ... [2021-03-26 10:08:48,607 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:08:48" (1/1) ... [2021-03-26 10:08:48,633 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:08:48,634 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:08:48,634 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:08:48,634 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:08:48,641 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:08:48" (1/1) ... [2021-03-26 10:08:48,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:08:48" (1/1) ... [2021-03-26 10:08:48,648 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:08:48" (1/1) ... [2021-03-26 10:08:48,648 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:08:48" (1/1) ... [2021-03-26 10:08:48,657 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:08:48" (1/1) ... [2021-03-26 10:08:48,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:08:48" (1/1) ... [2021-03-26 10:08:48,669 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:08:48" (1/1) ... [2021-03-26 10:08:48,673 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:08:48,685 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:08:48,686 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:08:48,686 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:08:48,686 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:08:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:08:48,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:08:48,753 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:08:48,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:08:48,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:08:48,753 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:08:48,753 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:08:48,753 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:08:48,753 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:08:48,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:08:48,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:08:48,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:08:48,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:08:48,755 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 10:08:50,236 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:08:50,237 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:08:50,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:08:50 BoogieIcfgContainer [2021-03-26 10:08:50,239 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:08:50,241 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:08:50,241 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:08:50,243 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:08:50,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:08:48" (1/3) ... [2021-03-26 10:08:50,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b6f43ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:08:50, skipping insertion in model container [2021-03-26 10:08:50,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:08:48" (2/3) ... [2021-03-26 10:08:50,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b6f43ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:08:50, skipping insertion in model container [2021-03-26 10:08:50,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:08:50" (3/3) ... [2021-03-26 10:08:50,246 INFO L111 eAbstractionObserver]: Analyzing ICFG mix041_rmo.opt.i [2021-03-26 10:08:50,251 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:08:50,255 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:08:50,256 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:08:50,288 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,288 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,288 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,288 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,289 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,289 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,289 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,289 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,289 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,289 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,289 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,289 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,289 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,293 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,293 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,293 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,293 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,293 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,294 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,294 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,295 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,298 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,298 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,298 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,298 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,298 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,301 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,301 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,301 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,306 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,306 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,306 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:08:50,307 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:08:50,323 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-26 10:08:50,350 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:08:50,350 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:08:50,350 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:08:50,350 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:08:50,351 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:08:50,351 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:08:50,351 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:08:50,351 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:08:50,364 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 89 places, 84 transitions, 178 flow [2021-03-26 10:08:50,402 INFO L129 PetriNetUnfolder]: 2/82 cut-off events. [2021-03-26 10:08:50,402 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:08:50,416 INFO L84 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 82 events. 2/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2021-03-26 10:08:50,416 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 84 transitions, 178 flow [2021-03-26 10:08:50,420 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 82 transitions, 170 flow [2021-03-26 10:08:50,421 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:08:50,436 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 82 transitions, 170 flow [2021-03-26 10:08:50,439 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 82 transitions, 170 flow [2021-03-26 10:08:50,444 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 87 places, 82 transitions, 170 flow [2021-03-26 10:08:50,468 INFO L129 PetriNetUnfolder]: 2/82 cut-off events. [2021-03-26 10:08:50,468 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:08:50,469 INFO L84 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 82 events. 2/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2021-03-26 10:08:50,476 INFO L142 LiptonReduction]: Number of co-enabled transitions 1046 [2021-03-26 10:08:51,604 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:08:52,012 WARN L205 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-26 10:08:52,133 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 10:08:53,288 WARN L205 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2021-03-26 10:08:53,566 WARN L205 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2021-03-26 10:08:54,902 WARN L205 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2021-03-26 10:08:55,463 WARN L205 SmtUtils]: Spent 555.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-26 10:08:55,990 INFO L154 LiptonReduction]: Checked pairs total: 1861 [2021-03-26 10:08:55,990 INFO L156 LiptonReduction]: Total number of compositions: 59 [2021-03-26 10:08:55,992 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5572 [2021-03-26 10:08:56,001 INFO L129 PetriNetUnfolder]: 0/11 cut-off events. [2021-03-26 10:08:56,001 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:08:56,001 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:08:56,002 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:08:56,002 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:08:56,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:08:56,006 INFO L82 PathProgramCache]: Analyzing trace with hash 511986455, now seen corresponding path program 1 times [2021-03-26 10:08:56,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:08:56,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447525962] [2021-03-26 10:08:56,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:08:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:08:56,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:08:56,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:08:56,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:08:56,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:08:56,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:08:56,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447525962] [2021-03-26 10:08:56,237 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:08:56,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:08:56,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188540196] [2021-03-26 10:08:56,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:08:56,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:08:56,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:08:56,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:08:56,259 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 143 [2021-03-26 10:08:56,263 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:08:56,263 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:08:56,263 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 143 [2021-03-26 10:08:56,264 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:08:56,327 INFO L129 PetriNetUnfolder]: 16/84 cut-off events. [2021-03-26 10:08:56,328 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:08:56,329 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 84 events. 16/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 288 event pairs, 6 based on Foata normal form. 6/83 useless extension candidates. Maximal degree in co-relation 112. Up to 27 conditions per place. [2021-03-26 10:08:56,330 INFO L132 encePairwiseOnDemand]: 139/143 looper letters, 7 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2021-03-26 10:08:56,331 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 30 transitions, 84 flow [2021-03-26 10:08:56,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:08:56,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:08:56,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2021-03-26 10:08:56,349 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8741258741258742 [2021-03-26 10:08:56,350 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2021-03-26 10:08:56,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2021-03-26 10:08:56,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:08:56,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2021-03-26 10:08:56,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:08:56,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:08:56,371 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:08:56,372 INFO L185 Difference]: Start difference. First operand has 36 places, 30 transitions, 66 flow. Second operand 3 states and 375 transitions. [2021-03-26 10:08:56,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 30 transitions, 84 flow [2021-03-26 10:08:56,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:08:56,377 INFO L241 Difference]: Finished difference. Result has 34 places, 27 transitions, 62 flow [2021-03-26 10:08:56,378 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2021-03-26 10:08:56,379 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2021-03-26 10:08:56,379 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:08:56,380 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 62 flow [2021-03-26 10:08:56,381 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 27 transitions, 62 flow [2021-03-26 10:08:56,382 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 27 transitions, 62 flow [2021-03-26 10:08:56,390 INFO L129 PetriNetUnfolder]: 0/27 cut-off events. [2021-03-26 10:08:56,390 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:08:56,390 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 27 events. 0/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:08:56,391 INFO L142 LiptonReduction]: Number of co-enabled transitions 218 [2021-03-26 10:08:56,960 WARN L205 SmtUtils]: Spent 392.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-26 10:08:57,288 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-26 10:08:58,474 WARN L205 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 266 DAG size of output: 265 [2021-03-26 10:08:59,062 WARN L205 SmtUtils]: Spent 586.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 10:08:59,616 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-26 10:08:59,734 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-26 10:09:00,319 WARN L205 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 194 [2021-03-26 10:09:00,596 WARN L205 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 194 [2021-03-26 10:09:01,758 WARN L205 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 277 DAG size of output: 276 [2021-03-26 10:09:02,342 WARN L205 SmtUtils]: Spent 582.00 ms on a formula simplification that was a NOOP. DAG size: 276 [2021-03-26 10:09:02,767 WARN L205 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2021-03-26 10:09:02,884 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-26 10:09:03,166 WARN L205 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2021-03-26 10:09:03,293 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-26 10:09:03,302 INFO L154 LiptonReduction]: Checked pairs total: 651 [2021-03-26 10:09:03,303 INFO L156 LiptonReduction]: Total number of compositions: 11 [2021-03-26 10:09:03,303 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6924 [2021-03-26 10:09:03,304 INFO L480 AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 42 flow [2021-03-26 10:09:03,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:03,304 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:09:03,304 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:09:03,305 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:09:03,305 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:09:03,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:09:03,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1652750832, now seen corresponding path program 1 times [2021-03-26 10:09:03,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:09:03,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729666566] [2021-03-26 10:09:03,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:09:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:09:03,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:03,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:09:03,425 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:03,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:09:03,433 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 10:09:03,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:09:03,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:09:03,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729666566] [2021-03-26 10:09:03,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:09:03,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:09:03,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669018289] [2021-03-26 10:09:03,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:09:03,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:09:03,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:09:03,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:09:03,440 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 154 [2021-03-26 10:09:03,441 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:03,441 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:09:03,441 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 154 [2021-03-26 10:09:03,442 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:09:03,479 INFO L129 PetriNetUnfolder]: 1/20 cut-off events. [2021-03-26 10:09:03,479 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:09:03,479 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 20 events. 1/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 34 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 26. Up to 3 conditions per place. [2021-03-26 10:09:03,479 INFO L132 encePairwiseOnDemand]: 150/154 looper letters, 1 selfloop transitions, 2 changer transitions 4/19 dead transitions. [2021-03-26 10:09:03,480 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 19 transitions, 58 flow [2021-03-26 10:09:03,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:09:03,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:09:03,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 647 transitions. [2021-03-26 10:09:03,482 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8402597402597403 [2021-03-26 10:09:03,482 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 647 transitions. [2021-03-26 10:09:03,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 647 transitions. [2021-03-26 10:09:03,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:09:03,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 647 transitions. [2021-03-26 10:09:03,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.4) internal successors, (647), 5 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:03,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 154.0) internal successors, (924), 6 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:03,487 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 154.0) internal successors, (924), 6 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:03,487 INFO L185 Difference]: Start difference. First operand has 24 places, 17 transitions, 42 flow. Second operand 5 states and 647 transitions. [2021-03-26 10:09:03,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 19 transitions, 58 flow [2021-03-26 10:09:03,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 19 transitions, 54 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:09:03,489 INFO L241 Difference]: Finished difference. Result has 27 places, 15 transitions, 42 flow [2021-03-26 10:09:03,489 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=42, PETRI_PLACES=27, PETRI_TRANSITIONS=15} [2021-03-26 10:09:03,489 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -9 predicate places. [2021-03-26 10:09:03,489 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:09:03,489 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 15 transitions, 42 flow [2021-03-26 10:09:03,490 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 15 transitions, 42 flow [2021-03-26 10:09:03,490 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 23 places, 15 transitions, 42 flow [2021-03-26 10:09:03,493 INFO L129 PetriNetUnfolder]: 0/15 cut-off events. [2021-03-26 10:09:03,493 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:09:03,493 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 15 events. 0/15 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:09:03,493 INFO L142 LiptonReduction]: Number of co-enabled transitions 92 [2021-03-26 10:09:03,508 INFO L154 LiptonReduction]: Checked pairs total: 111 [2021-03-26 10:09:03,508 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:09:03,508 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 19 [2021-03-26 10:09:03,514 INFO L480 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 42 flow [2021-03-26 10:09:03,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:03,514 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:09:03,514 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:09:03,515 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:09:03,515 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:09:03,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:09:03,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1537782469, now seen corresponding path program 1 times [2021-03-26 10:09:03,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:09:03,516 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670059625] [2021-03-26 10:09:03,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:09:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:09:03,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:03,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:09:03,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:03,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:09:03,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:03,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 10:09:03,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:03,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 10:09:03,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:09:03,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670059625] [2021-03-26 10:09:03,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:09:03,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:09:03,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511543761] [2021-03-26 10:09:03,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:09:03,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:09:03,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:09:03,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:09:03,695 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 154 [2021-03-26 10:09:03,696 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 42 flow. Second operand has 5 states, 5 states have (on average 104.0) internal successors, (520), 5 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:03,696 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:09:03,696 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 154 [2021-03-26 10:09:03,696 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:09:03,793 INFO L129 PetriNetUnfolder]: 77/155 cut-off events. [2021-03-26 10:09:03,793 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-03-26 10:09:03,794 INFO L84 FinitePrefix]: Finished finitePrefix Result has 338 conditions, 155 events. 77/155 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 538 event pairs, 19 based on Foata normal form. 2/157 useless extension candidates. Maximal degree in co-relation 328. Up to 122 conditions per place. [2021-03-26 10:09:03,796 INFO L132 encePairwiseOnDemand]: 148/154 looper letters, 15 selfloop transitions, 8 changer transitions 0/28 dead transitions. [2021-03-26 10:09:03,797 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 28 transitions, 114 flow [2021-03-26 10:09:03,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:09:03,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:09:03,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 540 transitions. [2021-03-26 10:09:03,799 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7012987012987013 [2021-03-26 10:09:03,799 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 540 transitions. [2021-03-26 10:09:03,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 540 transitions. [2021-03-26 10:09:03,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:09:03,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 540 transitions. [2021-03-26 10:09:03,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:03,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 154.0) internal successors, (924), 6 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:03,802 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 154.0) internal successors, (924), 6 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:03,802 INFO L185 Difference]: Start difference. First operand has 23 places, 15 transitions, 42 flow. Second operand 5 states and 540 transitions. [2021-03-26 10:09:03,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 28 transitions, 114 flow [2021-03-26 10:09:03,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 28 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:09:03,803 INFO L241 Difference]: Finished difference. Result has 27 places, 22 transitions, 88 flow [2021-03-26 10:09:03,803 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=27, PETRI_TRANSITIONS=22} [2021-03-26 10:09:03,804 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -9 predicate places. [2021-03-26 10:09:03,804 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:09:03,804 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 22 transitions, 88 flow [2021-03-26 10:09:03,804 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 22 transitions, 88 flow [2021-03-26 10:09:03,804 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 27 places, 22 transitions, 88 flow [2021-03-26 10:09:03,809 INFO L129 PetriNetUnfolder]: 5/30 cut-off events. [2021-03-26 10:09:03,809 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-03-26 10:09:03,809 INFO L84 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 30 events. 5/30 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 75 event pairs, 1 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 60. Up to 10 conditions per place. [2021-03-26 10:09:03,810 INFO L142 LiptonReduction]: Number of co-enabled transitions 114 [2021-03-26 10:09:03,814 INFO L154 LiptonReduction]: Checked pairs total: 112 [2021-03-26 10:09:03,814 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:09:03,815 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11 [2021-03-26 10:09:03,815 INFO L480 AbstractCegarLoop]: Abstraction has has 27 places, 22 transitions, 88 flow [2021-03-26 10:09:03,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 104.0) internal successors, (520), 5 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:03,816 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:09:03,816 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:09:03,816 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:09:03,816 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:09:03,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:09:03,817 INFO L82 PathProgramCache]: Analyzing trace with hash 713666632, now seen corresponding path program 1 times [2021-03-26 10:09:03,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:09:03,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643027963] [2021-03-26 10:09:03,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:09:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:09:03,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:03,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:09:03,887 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 10:09:03,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:09:03,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:03,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:09:03,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:09:03,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643027963] [2021-03-26 10:09:03,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:09:03,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:09:03,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033787406] [2021-03-26 10:09:03,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:09:03,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:09:03,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:09:03,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:09:03,899 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 154 [2021-03-26 10:09:03,899 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 22 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:03,899 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:09:03,899 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 154 [2021-03-26 10:09:03,900 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:09:03,925 INFO L129 PetriNetUnfolder]: 11/54 cut-off events. [2021-03-26 10:09:03,926 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-03-26 10:09:03,926 INFO L84 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 54 events. 11/54 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 174 event pairs, 2 based on Foata normal form. 6/59 useless extension candidates. Maximal degree in co-relation 119. Up to 21 conditions per place. [2021-03-26 10:09:03,926 INFO L132 encePairwiseOnDemand]: 149/154 looper letters, 4 selfloop transitions, 5 changer transitions 3/29 dead transitions. [2021-03-26 10:09:03,926 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 29 transitions, 126 flow [2021-03-26 10:09:03,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:09:03,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:09:03,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 659 transitions. [2021-03-26 10:09:03,929 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8558441558441559 [2021-03-26 10:09:03,929 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 659 transitions. [2021-03-26 10:09:03,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 659 transitions. [2021-03-26 10:09:03,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:09:03,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 659 transitions. [2021-03-26 10:09:03,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:03,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 154.0) internal successors, (924), 6 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:03,933 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 154.0) internal successors, (924), 6 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:03,933 INFO L185 Difference]: Start difference. First operand has 27 places, 22 transitions, 88 flow. Second operand 5 states and 659 transitions. [2021-03-26 10:09:03,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 29 transitions, 126 flow [2021-03-26 10:09:03,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 121 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 10:09:03,941 INFO L241 Difference]: Finished difference. Result has 33 places, 26 transitions, 120 flow [2021-03-26 10:09:03,941 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=120, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2021-03-26 10:09:03,942 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2021-03-26 10:09:03,942 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:09:03,942 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 26 transitions, 120 flow [2021-03-26 10:09:03,942 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 26 transitions, 120 flow [2021-03-26 10:09:03,942 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 26 transitions, 120 flow [2021-03-26 10:09:03,950 INFO L129 PetriNetUnfolder]: 9/48 cut-off events. [2021-03-26 10:09:03,950 INFO L130 PetriNetUnfolder]: For 20/22 co-relation queries the response was YES. [2021-03-26 10:09:03,951 INFO L84 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 48 events. 9/48 cut-off events. For 20/22 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 147 event pairs, 4 based on Foata normal form. 2/49 useless extension candidates. Maximal degree in co-relation 117. Up to 16 conditions per place. [2021-03-26 10:09:03,951 INFO L142 LiptonReduction]: Number of co-enabled transitions 112 [2021-03-26 10:09:03,953 INFO L154 LiptonReduction]: Checked pairs total: 62 [2021-03-26 10:09:03,953 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:09:03,953 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11 [2021-03-26 10:09:03,956 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 120 flow [2021-03-26 10:09:03,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:03,957 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:09:03,957 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:09:03,957 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:09:03,957 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:09:03,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:09:03,958 INFO L82 PathProgramCache]: Analyzing trace with hash -392618837, now seen corresponding path program 1 times [2021-03-26 10:09:03,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:09:03,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439851687] [2021-03-26 10:09:03,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:09:04,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:09:04,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:04,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:09:04,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:04,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:09:04,050 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 10:09:04,051 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:09:04,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:04,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:09:04,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:09:04,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439851687] [2021-03-26 10:09:04,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:09:04,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:09:04,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423955169] [2021-03-26 10:09:04,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:09:04,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:09:04,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:09:04,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:09:04,063 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 154 [2021-03-26 10:09:04,064 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:04,064 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:09:04,064 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 154 [2021-03-26 10:09:04,064 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:09:04,102 INFO L129 PetriNetUnfolder]: 6/41 cut-off events. [2021-03-26 10:09:04,102 INFO L130 PetriNetUnfolder]: For 39/54 co-relation queries the response was YES. [2021-03-26 10:09:04,102 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 41 events. 6/41 cut-off events. For 39/54 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 101 event pairs, 0 based on Foata normal form. 20/61 useless extension candidates. Maximal degree in co-relation 113. Up to 14 conditions per place. [2021-03-26 10:09:04,102 INFO L132 encePairwiseOnDemand]: 149/154 looper letters, 2 selfloop transitions, 8 changer transitions 2/29 dead transitions. [2021-03-26 10:09:04,102 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 29 transitions, 158 flow [2021-03-26 10:09:04,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:09:04,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:09:04,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 917 transitions. [2021-03-26 10:09:04,105 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8506493506493507 [2021-03-26 10:09:04,105 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 917 transitions. [2021-03-26 10:09:04,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 917 transitions. [2021-03-26 10:09:04,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:09:04,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 917 transitions. [2021-03-26 10:09:04,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.0) internal successors, (917), 7 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:04,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 154.0) internal successors, (1232), 8 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:04,110 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 154.0) internal successors, (1232), 8 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:04,111 INFO L185 Difference]: Start difference. First operand has 33 places, 26 transitions, 120 flow. Second operand 7 states and 917 transitions. [2021-03-26 10:09:04,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 29 transitions, 158 flow [2021-03-26 10:09:04,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 29 transitions, 152 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-26 10:09:04,112 INFO L241 Difference]: Finished difference. Result has 41 places, 27 transitions, 147 flow [2021-03-26 10:09:04,113 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=147, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2021-03-26 10:09:04,113 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2021-03-26 10:09:04,113 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:09:04,113 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 27 transitions, 147 flow [2021-03-26 10:09:04,113 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 27 transitions, 147 flow [2021-03-26 10:09:04,113 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 27 transitions, 147 flow [2021-03-26 10:09:04,118 INFO L129 PetriNetUnfolder]: 5/35 cut-off events. [2021-03-26 10:09:04,118 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-03-26 10:09:04,118 INFO L84 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 35 events. 5/35 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 92 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 98. Up to 12 conditions per place. [2021-03-26 10:09:04,119 INFO L142 LiptonReduction]: Number of co-enabled transitions 86 [2021-03-26 10:09:04,400 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-26 10:09:04,534 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-26 10:09:05,189 WARN L205 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 191 [2021-03-26 10:09:05,446 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2021-03-26 10:09:06,785 WARN L205 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 345 DAG size of output: 269 [2021-03-26 10:09:07,325 WARN L205 SmtUtils]: Spent 536.00 ms on a formula simplification that was a NOOP. DAG size: 251 [2021-03-26 10:09:07,329 INFO L154 LiptonReduction]: Checked pairs total: 150 [2021-03-26 10:09:07,329 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 10:09:07,329 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3216 [2021-03-26 10:09:07,330 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 23 transitions, 127 flow [2021-03-26 10:09:07,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:07,331 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:09:07,331 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:09:07,331 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:09:07,331 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:09:07,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:09:07,331 INFO L82 PathProgramCache]: Analyzing trace with hash 810989267, now seen corresponding path program 1 times [2021-03-26 10:09:07,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:09:07,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758044230] [2021-03-26 10:09:07,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:09:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:09:07,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:07,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:09:07,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:07,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:09:07,379 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:07,380 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:09:07,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:09:07,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758044230] [2021-03-26 10:09:07,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:09:07,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:09:07,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93730324] [2021-03-26 10:09:07,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:09:07,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:09:07,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:09:07,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:09:07,388 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 156 [2021-03-26 10:09:07,389 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 23 transitions, 127 flow. Second operand has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:07,389 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:09:07,389 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 156 [2021-03-26 10:09:07,389 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:09:07,419 INFO L129 PetriNetUnfolder]: 8/43 cut-off events. [2021-03-26 10:09:07,420 INFO L130 PetriNetUnfolder]: For 91/92 co-relation queries the response was YES. [2021-03-26 10:09:07,420 INFO L84 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 43 events. 8/43 cut-off events. For 91/92 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 119 event pairs, 0 based on Foata normal form. 2/45 useless extension candidates. Maximal degree in co-relation 120. Up to 15 conditions per place. [2021-03-26 10:09:07,420 INFO L132 encePairwiseOnDemand]: 153/156 looper letters, 3 selfloop transitions, 1 changer transitions 4/23 dead transitions. [2021-03-26 10:09:07,420 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 23 transitions, 130 flow [2021-03-26 10:09:07,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:09:07,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:09:07,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 510 transitions. [2021-03-26 10:09:07,423 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8173076923076923 [2021-03-26 10:09:07,423 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 510 transitions. [2021-03-26 10:09:07,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 510 transitions. [2021-03-26 10:09:07,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:09:07,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 510 transitions. [2021-03-26 10:09:07,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:07,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 156.0) internal successors, (780), 5 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:07,426 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 156.0) internal successors, (780), 5 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:07,426 INFO L185 Difference]: Start difference. First operand has 38 places, 23 transitions, 127 flow. Second operand 4 states and 510 transitions. [2021-03-26 10:09:07,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 23 transitions, 130 flow [2021-03-26 10:09:07,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 23 transitions, 107 flow, removed 7 selfloop flow, removed 7 redundant places. [2021-03-26 10:09:07,429 INFO L241 Difference]: Finished difference. Result has 32 places, 19 transitions, 88 flow [2021-03-26 10:09:07,429 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=88, PETRI_PLACES=32, PETRI_TRANSITIONS=19} [2021-03-26 10:09:07,430 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -4 predicate places. [2021-03-26 10:09:07,430 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:09:07,430 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 19 transitions, 88 flow [2021-03-26 10:09:07,430 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 19 transitions, 88 flow [2021-03-26 10:09:07,430 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 19 transitions, 88 flow [2021-03-26 10:09:07,434 INFO L129 PetriNetUnfolder]: 3/24 cut-off events. [2021-03-26 10:09:07,434 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2021-03-26 10:09:07,434 INFO L84 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 24 events. 3/24 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 55. Up to 7 conditions per place. [2021-03-26 10:09:07,435 INFO L142 LiptonReduction]: Number of co-enabled transitions 16 [2021-03-26 10:09:07,633 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2021-03-26 10:09:08,033 WARN L205 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 89 [2021-03-26 10:09:08,157 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-03-26 10:09:08,263 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 [2021-03-26 10:09:08,471 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 87 [2021-03-26 10:09:08,828 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 65 [2021-03-26 10:09:09,216 WARN L205 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 91 [2021-03-26 10:09:09,344 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-03-26 10:09:09,542 WARN L205 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-26 10:09:09,915 WARN L205 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 83 [2021-03-26 10:09:10,040 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-03-26 10:09:10,042 INFO L154 LiptonReduction]: Checked pairs total: 9 [2021-03-26 10:09:10,042 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-26 10:09:10,042 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2612 [2021-03-26 10:09:10,043 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 18 transitions, 97 flow [2021-03-26 10:09:10,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:10,043 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:09:10,044 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:09:10,044 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:09:10,044 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:09:10,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:09:10,044 INFO L82 PathProgramCache]: Analyzing trace with hash -989962475, now seen corresponding path program 1 times [2021-03-26 10:09:10,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:09:10,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124161894] [2021-03-26 10:09:10,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:09:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:09:10,087 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:09:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:09:10,144 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:09:10,178 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:09:10,178 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:09:10,178 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:09:10,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:09:10 BasicIcfg [2021-03-26 10:09:10,241 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:09:10,241 INFO L168 Benchmark]: Toolchain (without parser) took 22161.35 ms. Allocated memory was 348.1 MB in the beginning and 604.0 MB in the end (delta: 255.9 MB). Free memory was 311.1 MB in the beginning and 334.2 MB in the end (delta: -23.0 MB). Peak memory consumption was 235.9 MB. Max. memory is 16.0 GB. [2021-03-26 10:09:10,242 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 348.1 MB. Free memory was 329.6 MB in the beginning and 329.6 MB in the end (delta: 76.1 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:09:10,246 INFO L168 Benchmark]: CACSL2BoogieTranslator took 495.88 ms. Allocated memory is still 348.1 MB. Free memory was 311.0 MB in the beginning and 308.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB. [2021-03-26 10:09:10,246 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.60 ms. Allocated memory is still 348.1 MB. Free memory was 308.9 MB in the beginning and 305.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:09:10,246 INFO L168 Benchmark]: Boogie Preprocessor took 39.57 ms. Allocated memory is still 348.1 MB. Free memory was 305.8 MB in the beginning and 303.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:09:10,246 INFO L168 Benchmark]: RCFGBuilder took 1553.68 ms. Allocated memory is still 348.1 MB. Free memory was 303.7 MB in the beginning and 279.8 MB in the end (delta: 23.9 MB). Peak memory consumption was 163.3 MB. Max. memory is 16.0 GB. [2021-03-26 10:09:10,247 INFO L168 Benchmark]: TraceAbstraction took 20000.21 ms. Allocated memory was 348.1 MB in the beginning and 604.0 MB in the end (delta: 255.9 MB). Free memory was 279.8 MB in the beginning and 334.2 MB in the end (delta: -54.4 MB). Peak memory consumption was 201.5 MB. Max. memory is 16.0 GB. [2021-03-26 10:09:10,249 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.50 ms. Allocated memory is still 348.1 MB. Free memory was 329.6 MB in the beginning and 329.6 MB in the end (delta: 76.1 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 495.88 ms. Allocated memory is still 348.1 MB. Free memory was 311.0 MB in the beginning and 308.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 49.60 ms. Allocated memory is still 348.1 MB. Free memory was 308.9 MB in the beginning and 305.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 39.57 ms. Allocated memory is still 348.1 MB. Free memory was 305.8 MB in the beginning and 303.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1553.68 ms. Allocated memory is still 348.1 MB. Free memory was 303.7 MB in the beginning and 279.8 MB in the end (delta: 23.9 MB). Peak memory consumption was 163.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 20000.21 ms. Allocated memory was 348.1 MB in the beginning and 604.0 MB in the end (delta: 255.9 MB). Free memory was 279.8 MB in the beginning and 334.2 MB in the end (delta: -54.4 MB). Peak memory consumption was 201.5 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5551.3ms, 87 PlacesBefore, 36 PlacesAfterwards, 82 TransitionsBefore, 30 TransitionsAfterwards, 1046 CoEnabledTransitionPairs, 5 FixpointIterations, 29 TrivialSequentialCompositions, 25 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 59 TotalNumberOfCompositions, 1861 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 849, positive: 785, positive conditional: 785, positive unconditional: 0, negative: 64, negative conditional: 64, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 849, positive: 785, positive conditional: 0, positive unconditional: 785, negative: 64, negative conditional: 0, negative unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 849, positive: 785, positive conditional: 0, positive unconditional: 785, negative: 64, negative conditional: 0, negative unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 677, positive: 643, positive conditional: 0, positive unconditional: 643, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 677, positive: 641, positive conditional: 0, positive unconditional: 641, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 36, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 693, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 686, negative conditional: 0, negative unconditional: 686, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 849, positive: 142, positive conditional: 0, positive unconditional: 142, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 677, unknown conditional: 0, unknown unconditional: 677] , Statistics on independence cache: Total cache size (in pairs): 677, Positive cache size: 643, Positive conditional cache size: 0, Positive unconditional cache size: 643, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6921.2ms, 34 PlacesBefore, 24 PlacesAfterwards, 27 TransitionsBefore, 17 TransitionsAfterwards, 218 CoEnabledTransitionPairs, 4 FixpointIterations, 5 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 651 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 209, positive: 154, positive conditional: 154, positive unconditional: 0, negative: 55, negative conditional: 55, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 209, positive: 154, positive conditional: 11, positive unconditional: 143, negative: 55, negative conditional: 2, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 209, positive: 154, positive conditional: 11, positive unconditional: 143, negative: 55, negative conditional: 2, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 83, positive: 70, positive conditional: 5, positive unconditional: 65, negative: 13, negative conditional: 2, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 83, positive: 68, positive conditional: 0, positive unconditional: 68, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 13, negative conditional: 2, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 287, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 248, negative conditional: 53, negative unconditional: 195, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 209, positive: 84, positive conditional: 6, positive unconditional: 78, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 83, unknown conditional: 7, unknown unconditional: 76] , Statistics on independence cache: Total cache size (in pairs): 760, Positive cache size: 713, Positive conditional cache size: 5, Positive unconditional cache size: 708, Negative cache size: 47, Negative conditional cache size: 2, Negative unconditional cache size: 45, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.4ms, 27 PlacesBefore, 23 PlacesAfterwards, 15 TransitionsBefore, 15 TransitionsAfterwards, 92 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 111 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 34, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 34, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 764, Positive cache size: 716, Positive conditional cache size: 5, Positive unconditional cache size: 711, Negative cache size: 48, Negative conditional cache size: 2, Negative unconditional cache size: 46, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.3ms, 27 PlacesBefore, 27 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 112 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, positive: 35, positive conditional: 35, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 47, positive: 35, positive conditional: 10, positive unconditional: 25, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 47, positive: 35, positive conditional: 10, positive unconditional: 25, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 2, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, positive: 31, positive conditional: 8, positive unconditional: 23, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 5, unknown conditional: 2, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 769, Positive cache size: 720, Positive conditional cache size: 7, Positive unconditional cache size: 713, Negative cache size: 49, Negative conditional cache size: 2, Negative unconditional cache size: 47, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.2ms, 33 PlacesBefore, 33 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 112 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 62 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, positive: 30, positive conditional: 30, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 37, positive: 30, positive conditional: 20, positive unconditional: 10, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 37, positive: 30, positive conditional: 20, positive unconditional: 10, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 37, positive: 29, positive conditional: 19, positive unconditional: 10, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 770, Positive cache size: 721, Positive conditional cache size: 8, Positive unconditional cache size: 713, Negative cache size: 49, Negative conditional cache size: 2, Negative unconditional cache size: 47, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3216.2ms, 41 PlacesBefore, 38 PlacesAfterwards, 27 TransitionsBefore, 23 TransitionsAfterwards, 86 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 150 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 95, positive: 74, positive conditional: 74, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 95, positive: 74, positive conditional: 58, positive unconditional: 16, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 95, positive: 74, positive conditional: 58, positive unconditional: 16, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 95, positive: 72, positive conditional: 58, positive unconditional: 14, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 772, Positive cache size: 723, Positive conditional cache size: 8, Positive unconditional cache size: 715, Negative cache size: 49, Negative conditional cache size: 2, Negative unconditional cache size: 47, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2612.3ms, 32 PlacesBefore, 30 PlacesAfterwards, 19 TransitionsBefore, 18 TransitionsAfterwards, 16 CoEnabledTransitionPairs, 4 FixpointIterations, 2 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 9 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, positive: 9, positive conditional: 7, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 7, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, positive: 8, positive conditional: 6, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 773, Positive cache size: 724, Positive conditional cache size: 9, Positive unconditional cache size: 715, Negative cache size: 49, Negative conditional cache size: 2, Negative unconditional cache size: 47, Eliminated conditions: 0 - 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; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1099; [L803] FCALL, FORK 0 pthread_create(&t1099, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L804] 0 pthread_t t1100; [L805] FCALL, FORK 0 pthread_create(&t1100, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L760] 2 x$w_buff1 = x$w_buff0 [L761] 2 x$w_buff0 = 2 [L762] 2 x$w_buff1_used = x$w_buff0_used [L763] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L771] 2 y = 1 [L774] 2 __unbuffered_p1_EAX = y [L777] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L740] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L743] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L746] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L746] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L747] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L748] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L749] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L750] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L811] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L811] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L812] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L813] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L814] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L814] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L815] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L815] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 x$flush_delayed = weak$$choice2 [L821] 0 x$mem_tmp = x [L822] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L822] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L823] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L823] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L824] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L824] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L825] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L825] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L826] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L827] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L828] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L830] 0 x = x$flush_delayed ? x$mem_tmp : x [L831] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 83 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 19833.8ms, OverallIterations: 7, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 427.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5647.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 21 SDtfs, 14 SDslu, 10 SDs, 0 SdLazy, 81 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 113.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 87.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=147occurred in iteration=5, InterpolantAutomatonStates: 29, 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: 24.7ms SsaConstructionTime, 288.9ms SatisfiabilityAnalysisTime, 400.2ms InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 63 ConstructedInterpolants, 0 QuantifiedInterpolants, 246 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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...