/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 20:13:31,864 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 20:13:31,866 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 20:13:31,896 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 20:13:31,896 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 20:13:31,899 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 20:13:31,901 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 20:13:31,905 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 20:13:31,907 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 20:13:31,910 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 20:13:31,911 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 20:13:31,912 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 20:13:31,912 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 20:13:31,913 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 20:13:31,914 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 20:13:31,915 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 20:13:31,917 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 20:13:31,917 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 20:13:31,919 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 20:13:31,925 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 20:13:31,926 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 20:13:31,927 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 20:13:31,928 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 20:13:31,929 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 20:13:31,934 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 20:13:31,934 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 20:13:31,934 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 20:13:31,935 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 20:13:31,935 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 20:13:31,936 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 20:13:31,936 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 20:13:31,937 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 20:13:31,938 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 20:13:31,938 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 20:13:31,939 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 20:13:31,939 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 20:13:31,939 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 20:13:31,939 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 20:13:31,940 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 20:13:31,940 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 20:13:31,940 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 20:13:31,941 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2021-03-11 20:13:31,968 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 20:13:31,968 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 20:13:31,971 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 20:13:31,971 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 20:13:31,971 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 20:13:31,971 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 20:13:31,971 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 20:13:31,971 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 20:13:31,971 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 20:13:31,972 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 20:13:31,972 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 20:13:31,972 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 20:13:31,972 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 20:13:31,972 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 20:13:31,973 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 20:13:31,973 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 20:13:31,973 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 20:13:31,973 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 20:13:31,973 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 20:13:31,973 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 20:13:31,973 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 20:13:31,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 20:13:31,974 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 20:13:31,974 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 20:13:31,974 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 20:13:31,974 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 20:13:31,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 20:13:31,974 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-11 20:13:31,974 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-11 20:13:32,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 20:13:32,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 20:13:32,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 20:13:32,219 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 20:13:32,220 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 20:13:32,220 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2021-03-11 20:13:32,257 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8267063d/11246224d50c4ba8bc296ac82ab82386/FLAGd28803d7d [2021-03-11 20:13:32,722 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 20:13:32,723 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2021-03-11 20:13:32,737 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8267063d/11246224d50c4ba8bc296ac82ab82386/FLAGd28803d7d [2021-03-11 20:13:32,753 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8267063d/11246224d50c4ba8bc296ac82ab82386 [2021-03-11 20:13:32,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 20:13:32,759 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 20:13:32,761 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 20:13:32,761 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 20:13:32,766 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 20:13:32,766 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:13:32" (1/1) ... [2021-03-11 20:13:32,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1350385f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:13:32, skipping insertion in model container [2021-03-11 20:13:32,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:13:32" (1/1) ... [2021-03-11 20:13:32,771 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 20:13:32,815 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 20:13:32,958 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/mix052_tso.oepc.i[949,962] [2021-03-11 20:13:33,150 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:13:33,157 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 20:13:33,166 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/mix052_tso.oepc.i[949,962] [2021-03-11 20:13:33,213 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:13:33,266 INFO L208 MainTranslator]: Completed translation [2021-03-11 20:13:33,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:13:33 WrapperNode [2021-03-11 20:13:33,267 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 20:13:33,268 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 20:13:33,268 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 20:13:33,269 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 20:13:33,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:13:33" (1/1) ... [2021-03-11 20:13:33,301 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:13:33" (1/1) ... [2021-03-11 20:13:33,333 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 20:13:33,334 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 20:13:33,334 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 20:13:33,334 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 20:13:33,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:13:33" (1/1) ... [2021-03-11 20:13:33,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:13:33" (1/1) ... [2021-03-11 20:13:33,353 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:13:33" (1/1) ... [2021-03-11 20:13:33,354 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:13:33" (1/1) ... [2021-03-11 20:13:33,359 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:13:33" (1/1) ... [2021-03-11 20:13:33,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:13:33" (1/1) ... [2021-03-11 20:13:33,371 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:13:33" (1/1) ... [2021-03-11 20:13:33,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 20:13:33,380 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 20:13:33,380 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 20:13:33,380 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 20:13:33,381 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:13:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 20:13:33,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 20:13:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 20:13:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 20:13:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 20:13:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 20:13:33,431 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 20:13:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 20:13:33,431 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 20:13:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-11 20:13:33,431 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-11 20:13:33,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 20:13:33,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 20:13:33,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 20:13:33,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 20:13:33,433 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-11 20:13:34,855 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 20:13:34,855 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 20:13:34,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:13:34 BoogieIcfgContainer [2021-03-11 20:13:34,857 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 20:13:34,858 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 20:13:34,858 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 20:13:34,860 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 20:13:34,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 08:13:32" (1/3) ... [2021-03-11 20:13:34,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb9ac86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:13:34, skipping insertion in model container [2021-03-11 20:13:34,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:13:33" (2/3) ... [2021-03-11 20:13:34,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb9ac86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:13:34, skipping insertion in model container [2021-03-11 20:13:34,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:13:34" (3/3) ... [2021-03-11 20:13:34,862 INFO L111 eAbstractionObserver]: Analyzing ICFG mix052_tso.oepc.i [2021-03-11 20:13:34,866 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 20:13:34,869 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 20:13:34,870 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 20:13:34,894 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,894 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,894 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,895 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,895 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,895 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,899 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,899 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,899 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,899 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,899 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,900 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,900 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,900 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,900 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,900 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,901 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,902 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,902 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,902 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,902 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,902 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,902 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,902 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,902 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,903 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,903 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,903 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,903 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,903 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,903 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,903 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,903 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,904 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,904 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,904 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,904 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,904 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,904 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,904 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,904 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,904 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,904 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,904 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,907 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,907 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,907 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,907 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,907 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,907 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,907 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,907 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,908 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,908 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,908 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,908 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,909 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,909 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,909 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,909 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,910 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,910 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,910 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,910 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,910 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,910 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,911 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,911 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,911 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,911 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,911 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,911 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,912 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,912 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,912 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,912 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:34,913 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 20:13:34,924 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-11 20:13:34,937 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 20:13:34,937 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-11 20:13:34,937 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 20:13:34,937 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 20:13:34,937 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 20:13:34,937 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 20:13:34,937 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 20:13:34,937 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 20:13:34,944 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 98 transitions, 211 flow [2021-03-11 20:13:34,978 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-03-11 20:13:34,978 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:13:34,980 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-11 20:13:34,981 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 98 transitions, 211 flow [2021-03-11 20:13:34,984 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 95 transitions, 199 flow [2021-03-11 20:13:34,987 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 20:13:34,993 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 95 transitions, 199 flow [2021-03-11 20:13:34,996 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 95 transitions, 199 flow [2021-03-11 20:13:34,997 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 199 flow [2021-03-11 20:13:35,020 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-03-11 20:13:35,020 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:13:35,021 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-11 20:13:35,023 INFO L116 LiptonReduction]: Number of co-enabled transitions 1686 [2021-03-11 20:13:36,921 WARN L205 SmtUtils]: Spent 876.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2021-03-11 20:13:37,161 WARN L205 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2021-03-11 20:13:38,410 WARN L205 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2021-03-11 20:13:38,938 WARN L205 SmtUtils]: Spent 525.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-11 20:13:39,734 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-03-11 20:13:40,099 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 90 [2021-03-11 20:13:40,248 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-03-11 20:13:41,453 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-11 20:13:41,613 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-11 20:13:41,749 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-11 20:13:41,890 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-11 20:13:42,157 WARN L205 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 112 [2021-03-11 20:13:42,274 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-11 20:13:42,521 WARN L205 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 112 [2021-03-11 20:13:42,653 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-11 20:13:42,658 INFO L131 LiptonReduction]: Checked pairs total: 4770 [2021-03-11 20:13:42,659 INFO L133 LiptonReduction]: Total number of compositions: 82 [2021-03-11 20:13:42,660 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7675 [2021-03-11 20:13:42,665 INFO L129 PetriNetUnfolder]: 0/7 cut-off events. [2021-03-11 20:13:42,665 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:13:42,665 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:13:42,665 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2021-03-11 20:13:42,666 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:13:42,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:13:42,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1019582403, now seen corresponding path program 1 times [2021-03-11 20:13:42,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:13:42,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280384624] [2021-03-11 20:13:42,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:13:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:13:42,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:42,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:13:42,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:13:42,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280384624] [2021-03-11 20:13:42,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:13:42,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:13:42,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419090569] [2021-03-11 20:13:42,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:13:42,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:13:42,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:13:42,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:13:42,878 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 180 [2021-03-11 20:13:42,880 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:42,880 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:13:42,880 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 180 [2021-03-11 20:13:42,881 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:13:42,929 INFO L129 PetriNetUnfolder]: 49/131 cut-off events. [2021-03-11 20:13:42,929 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:13:42,930 INFO L84 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 131 events. 49/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 615 event pairs, 9 based on Foata normal form. 11/134 useless extension candidates. Maximal degree in co-relation 217. Up to 65 conditions per place. [2021-03-11 20:13:42,931 INFO L132 encePairwiseOnDemand]: 176/180 looper letters, 9 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2021-03-11 20:13:42,931 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 27 transitions, 85 flow [2021-03-11 20:13:42,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:13:42,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:13:42,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 461 transitions. [2021-03-11 20:13:42,940 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8537037037037037 [2021-03-11 20:13:42,941 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 461 transitions. [2021-03-11 20:13:42,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 461 transitions. [2021-03-11 20:13:42,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:13:42,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 461 transitions. [2021-03-11 20:13:42,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:42,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:42,951 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:42,952 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 461 transitions. [2021-03-11 20:13:42,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 27 transitions, 85 flow [2021-03-11 20:13:42,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 27 transitions, 82 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-11 20:13:42,955 INFO L241 Difference]: Finished difference. Result has 32 places, 23 transitions, 56 flow [2021-03-11 20:13:42,956 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2021-03-11 20:13:42,957 INFO L335 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2021-03-11 20:13:42,957 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2021-03-11 20:13:42,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:42,957 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:13:42,957 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:13:42,958 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 20:13:42,958 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:13:42,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:13:42,958 INFO L82 PathProgramCache]: Analyzing trace with hash 970876751, now seen corresponding path program 1 times [2021-03-11 20:13:42,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:13:42,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072061206] [2021-03-11 20:13:42,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:13:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:13:43,121 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-11 20:13:43,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-11 20:13:43,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:43,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:13:43,151 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:43,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:13:43,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:13:43,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072061206] [2021-03-11 20:13:43,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:13:43,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:13:43,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597844871] [2021-03-11 20:13:43,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:13:43,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:13:43,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:13:43,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:13:43,163 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 180 [2021-03-11 20:13:43,164 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:43,164 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:13:43,164 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 180 [2021-03-11 20:13:43,164 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:13:43,363 INFO L129 PetriNetUnfolder]: 180/355 cut-off events. [2021-03-11 20:13:43,363 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-03-11 20:13:43,364 INFO L84 FinitePrefix]: Finished finitePrefix Result has 704 conditions, 355 events. 180/355 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 1837 event pairs, 101 based on Foata normal form. 0/333 useless extension candidates. Maximal degree in co-relation 695. Up to 210 conditions per place. [2021-03-11 20:13:43,365 INFO L132 encePairwiseOnDemand]: 173/180 looper letters, 10 selfloop transitions, 7 changer transitions 17/47 dead transitions. [2021-03-11 20:13:43,365 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 47 transitions, 178 flow [2021-03-11 20:13:43,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:13:43,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:13:43,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 919 transitions. [2021-03-11 20:13:43,371 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7293650793650793 [2021-03-11 20:13:43,371 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 919 transitions. [2021-03-11 20:13:43,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 919 transitions. [2021-03-11 20:13:43,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:13:43,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 919 transitions. [2021-03-11 20:13:43,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.28571428571428) internal successors, (919), 7 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:43,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 180.0) internal successors, (1440), 8 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:43,377 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 180.0) internal successors, (1440), 8 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:43,377 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 7 states and 919 transitions. [2021-03-11 20:13:43,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 47 transitions, 178 flow [2021-03-11 20:13:43,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 47 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:13:43,379 INFO L241 Difference]: Finished difference. Result has 41 places, 28 transitions, 106 flow [2021-03-11 20:13:43,379 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=106, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2021-03-11 20:13:43,379 INFO L335 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2021-03-11 20:13:43,379 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 106 flow [2021-03-11 20:13:43,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:43,380 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:13:43,380 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:13:43,380 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 20:13:43,380 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:13:43,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:13:43,380 INFO L82 PathProgramCache]: Analyzing trace with hash 962210165, now seen corresponding path program 1 times [2021-03-11 20:13:43,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:13:43,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211865320] [2021-03-11 20:13:43,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:13:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:13:43,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:43,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:13:43,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:43,496 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 20:13:43,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:43,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 20:13:43,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:43,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:13:43,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:13:43,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211865320] [2021-03-11 20:13:43,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:13:43,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:13:43,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114201666] [2021-03-11 20:13:43,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:13:43,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:13:43,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:13:43,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:13:43,528 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 180 [2021-03-11 20:13:43,528 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 106 flow. Second operand has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:43,528 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:13:43,528 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 180 [2021-03-11 20:13:43,529 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:13:43,697 INFO L129 PetriNetUnfolder]: 114/253 cut-off events. [2021-03-11 20:13:43,697 INFO L130 PetriNetUnfolder]: For 308/332 co-relation queries the response was YES. [2021-03-11 20:13:43,698 INFO L84 FinitePrefix]: Finished finitePrefix Result has 717 conditions, 253 events. 114/253 cut-off events. For 308/332 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1245 event pairs, 16 based on Foata normal form. 25/274 useless extension candidates. Maximal degree in co-relation 703. Up to 109 conditions per place. [2021-03-11 20:13:43,699 INFO L132 encePairwiseOnDemand]: 172/180 looper letters, 15 selfloop transitions, 13 changer transitions 18/59 dead transitions. [2021-03-11 20:13:43,699 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 59 transitions, 320 flow [2021-03-11 20:13:43,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 20:13:43,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-11 20:13:43,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1160 transitions. [2021-03-11 20:13:43,702 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7160493827160493 [2021-03-11 20:13:43,702 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1160 transitions. [2021-03-11 20:13:43,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1160 transitions. [2021-03-11 20:13:43,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:13:43,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1160 transitions. [2021-03-11 20:13:43,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 128.88888888888889) internal successors, (1160), 9 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:43,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 180.0) internal successors, (1800), 10 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:43,707 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 180.0) internal successors, (1800), 10 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:43,707 INFO L185 Difference]: Start difference. First operand has 41 places, 28 transitions, 106 flow. Second operand 9 states and 1160 transitions. [2021-03-11 20:13:43,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 59 transitions, 320 flow [2021-03-11 20:13:43,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 59 transitions, 310 flow, removed 5 selfloop flow, removed 1 redundant places. [2021-03-11 20:13:43,709 INFO L241 Difference]: Finished difference. Result has 51 places, 35 transitions, 212 flow [2021-03-11 20:13:43,709 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=212, PETRI_PLACES=51, PETRI_TRANSITIONS=35} [2021-03-11 20:13:43,709 INFO L335 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2021-03-11 20:13:43,709 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 35 transitions, 212 flow [2021-03-11 20:13:43,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:43,710 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:13:43,710 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:13:43,710 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 20:13:43,710 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:13:43,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:13:43,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1864768013, now seen corresponding path program 1 times [2021-03-11 20:13:43,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:13:43,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702612116] [2021-03-11 20:13:43,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:13:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:13:43,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:43,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:13:43,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:43,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:13:43,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:43,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:13:43,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:13:43,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702612116] [2021-03-11 20:13:43,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:13:43,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:13:43,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441156175] [2021-03-11 20:13:43,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:13:43,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:13:43,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:13:43,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:13:43,812 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 180 [2021-03-11 20:13:43,813 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 35 transitions, 212 flow. Second operand has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:43,813 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:13:43,813 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 180 [2021-03-11 20:13:43,813 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:13:43,858 INFO L129 PetriNetUnfolder]: 117/286 cut-off events. [2021-03-11 20:13:43,859 INFO L130 PetriNetUnfolder]: For 807/847 co-relation queries the response was YES. [2021-03-11 20:13:43,860 INFO L84 FinitePrefix]: Finished finitePrefix Result has 985 conditions, 286 events. 117/286 cut-off events. For 807/847 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1590 event pairs, 45 based on Foata normal form. 28/296 useless extension candidates. Maximal degree in co-relation 963. Up to 119 conditions per place. [2021-03-11 20:13:43,861 INFO L132 encePairwiseOnDemand]: 174/180 looper letters, 8 selfloop transitions, 8 changer transitions 0/45 dead transitions. [2021-03-11 20:13:43,861 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 45 transitions, 264 flow [2021-03-11 20:13:43,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:13:43,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:13:43,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 743 transitions. [2021-03-11 20:13:43,863 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8255555555555556 [2021-03-11 20:13:43,863 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 743 transitions. [2021-03-11 20:13:43,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 743 transitions. [2021-03-11 20:13:43,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:13:43,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 743 transitions. [2021-03-11 20:13:43,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 148.6) internal successors, (743), 5 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:43,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:43,868 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:43,868 INFO L185 Difference]: Start difference. First operand has 51 places, 35 transitions, 212 flow. Second operand 5 states and 743 transitions. [2021-03-11 20:13:43,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 45 transitions, 264 flow [2021-03-11 20:13:43,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 45 transitions, 238 flow, removed 10 selfloop flow, removed 4 redundant places. [2021-03-11 20:13:43,873 INFO L241 Difference]: Finished difference. Result has 50 places, 42 transitions, 246 flow [2021-03-11 20:13:43,873 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=246, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2021-03-11 20:13:43,873 INFO L335 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2021-03-11 20:13:43,873 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 246 flow [2021-03-11 20:13:43,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:43,873 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:13:43,873 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:13:43,874 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 20:13:43,874 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:13:43,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:13:43,874 INFO L82 PathProgramCache]: Analyzing trace with hash 2108833316, now seen corresponding path program 1 times [2021-03-11 20:13:43,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:13:43,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118517096] [2021-03-11 20:13:43,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:13:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:13:43,950 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:43,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:13:43,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:43,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:13:43,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:43,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:13:43,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:43,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:13:43,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:13:43,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118517096] [2021-03-11 20:13:43,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:13:43,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:13:43,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219028365] [2021-03-11 20:13:43,964 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:13:43,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:13:43,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:13:43,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:13:43,968 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 180 [2021-03-11 20:13:43,968 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 246 flow. Second operand has 5 states, 5 states have (on average 145.8) internal successors, (729), 5 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:43,968 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:13:43,968 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 180 [2021-03-11 20:13:43,969 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:13:44,028 INFO L129 PetriNetUnfolder]: 61/195 cut-off events. [2021-03-11 20:13:44,028 INFO L130 PetriNetUnfolder]: For 407/642 co-relation queries the response was YES. [2021-03-11 20:13:44,029 INFO L84 FinitePrefix]: Finished finitePrefix Result has 736 conditions, 195 events. 61/195 cut-off events. For 407/642 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1058 event pairs, 5 based on Foata normal form. 94/278 useless extension candidates. Maximal degree in co-relation 713. Up to 95 conditions per place. [2021-03-11 20:13:44,030 INFO L132 encePairwiseOnDemand]: 174/180 looper letters, 5 selfloop transitions, 15 changer transitions 3/52 dead transitions. [2021-03-11 20:13:44,030 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 52 transitions, 350 flow [2021-03-11 20:13:44,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:13:44,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:13:44,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1040 transitions. [2021-03-11 20:13:44,032 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8253968253968254 [2021-03-11 20:13:44,032 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1040 transitions. [2021-03-11 20:13:44,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1040 transitions. [2021-03-11 20:13:44,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:13:44,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1040 transitions. [2021-03-11 20:13:44,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 148.57142857142858) internal successors, (1040), 7 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:44,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 180.0) internal successors, (1440), 8 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:44,035 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 180.0) internal successors, (1440), 8 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:44,036 INFO L185 Difference]: Start difference. First operand has 50 places, 42 transitions, 246 flow. Second operand 7 states and 1040 transitions. [2021-03-11 20:13:44,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 52 transitions, 350 flow [2021-03-11 20:13:44,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 52 transitions, 340 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-03-11 20:13:44,039 INFO L241 Difference]: Finished difference. Result has 57 places, 49 transitions, 335 flow [2021-03-11 20:13:44,039 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=335, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2021-03-11 20:13:44,039 INFO L335 CegarLoopForPetriNet]: 34 programPoint places, 23 predicate places. [2021-03-11 20:13:44,039 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 335 flow [2021-03-11 20:13:44,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 145.8) internal successors, (729), 5 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:44,039 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:13:44,039 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:13:44,039 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 20:13:44,040 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:13:44,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:13:44,040 INFO L82 PathProgramCache]: Analyzing trace with hash 527434294, now seen corresponding path program 1 times [2021-03-11 20:13:44,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:13:44,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352221735] [2021-03-11 20:13:44,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:13:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:13:44,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:44,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:13:44,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:44,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:13:44,115 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:44,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:13:44,119 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:44,120 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:13:44,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:44,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:13:44,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:13:44,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352221735] [2021-03-11 20:13:44,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:13:44,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 20:13:44,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181217618] [2021-03-11 20:13:44,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:13:44,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:13:44,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:13:44,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:13:44,127 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 180 [2021-03-11 20:13:44,128 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 335 flow. Second operand has 6 states, 6 states have (on average 145.83333333333334) internal successors, (875), 6 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:44,128 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:13:44,128 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 180 [2021-03-11 20:13:44,128 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:13:44,192 INFO L129 PetriNetUnfolder]: 45/159 cut-off events. [2021-03-11 20:13:44,193 INFO L130 PetriNetUnfolder]: For 775/1252 co-relation queries the response was YES. [2021-03-11 20:13:44,193 INFO L84 FinitePrefix]: Finished finitePrefix Result has 724 conditions, 159 events. 45/159 cut-off events. For 775/1252 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 838 event pairs, 1 based on Foata normal form. 94/242 useless extension candidates. Maximal degree in co-relation 698. Up to 86 conditions per place. [2021-03-11 20:13:44,194 INFO L132 encePairwiseOnDemand]: 174/180 looper letters, 2 selfloop transitions, 19 changer transitions 3/53 dead transitions. [2021-03-11 20:13:44,194 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 53 transitions, 413 flow [2021-03-11 20:13:44,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 20:13:44,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-11 20:13:44,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1331 transitions. [2021-03-11 20:13:44,197 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.821604938271605 [2021-03-11 20:13:44,197 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1331 transitions. [2021-03-11 20:13:44,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1331 transitions. [2021-03-11 20:13:44,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:13:44,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1331 transitions. [2021-03-11 20:13:44,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 147.88888888888889) internal successors, (1331), 9 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:44,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 180.0) internal successors, (1800), 10 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:44,202 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 180.0) internal successors, (1800), 10 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:44,202 INFO L185 Difference]: Start difference. First operand has 57 places, 49 transitions, 335 flow. Second operand 9 states and 1331 transitions. [2021-03-11 20:13:44,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 53 transitions, 413 flow [2021-03-11 20:13:44,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 53 transitions, 366 flow, removed 19 selfloop flow, removed 3 redundant places. [2021-03-11 20:13:44,205 INFO L241 Difference]: Finished difference. Result has 65 places, 50 transitions, 349 flow [2021-03-11 20:13:44,205 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=349, PETRI_PLACES=65, PETRI_TRANSITIONS=50} [2021-03-11 20:13:44,205 INFO L335 CegarLoopForPetriNet]: 34 programPoint places, 31 predicate places. [2021-03-11 20:13:44,205 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 50 transitions, 349 flow [2021-03-11 20:13:44,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 145.83333333333334) internal successors, (875), 6 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:44,206 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:13:44,206 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:13:44,206 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 20:13:44,206 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:13:44,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:13:44,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1990881176, now seen corresponding path program 1 times [2021-03-11 20:13:44,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:13:44,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539156763] [2021-03-11 20:13:44,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:13:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:13:44,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:44,278 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:13:44,278 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:44,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:13:44,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:44,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:13:44,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:44,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:13:44,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:13:44,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539156763] [2021-03-11 20:13:44,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:13:44,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:13:44,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741732948] [2021-03-11 20:13:44,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:13:44,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:13:44,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:13:44,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:13:44,292 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 180 [2021-03-11 20:13:44,293 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 50 transitions, 349 flow. Second operand has 5 states, 5 states have (on average 141.0) internal successors, (705), 5 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:44,293 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:13:44,293 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 180 [2021-03-11 20:13:44,293 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:13:44,341 INFO L129 PetriNetUnfolder]: 74/260 cut-off events. [2021-03-11 20:13:44,341 INFO L130 PetriNetUnfolder]: For 803/890 co-relation queries the response was YES. [2021-03-11 20:13:44,342 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1034 conditions, 260 events. 74/260 cut-off events. For 803/890 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1628 event pairs, 1 based on Foata normal form. 2/241 useless extension candidates. Maximal degree in co-relation 1005. Up to 65 conditions per place. [2021-03-11 20:13:44,343 INFO L132 encePairwiseOnDemand]: 176/180 looper letters, 4 selfloop transitions, 2 changer transitions 4/52 dead transitions. [2021-03-11 20:13:44,343 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 52 transitions, 367 flow [2021-03-11 20:13:44,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:13:44,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:13:44,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 708 transitions. [2021-03-11 20:13:44,344 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7866666666666666 [2021-03-11 20:13:44,344 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 708 transitions. [2021-03-11 20:13:44,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 708 transitions. [2021-03-11 20:13:44,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:13:44,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 708 transitions. [2021-03-11 20:13:44,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.6) internal successors, (708), 5 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:44,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:44,348 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:44,348 INFO L185 Difference]: Start difference. First operand has 65 places, 50 transitions, 349 flow. Second operand 5 states and 708 transitions. [2021-03-11 20:13:44,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 52 transitions, 367 flow [2021-03-11 20:13:44,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 52 transitions, 301 flow, removed 16 selfloop flow, removed 9 redundant places. [2021-03-11 20:13:44,355 INFO L241 Difference]: Finished difference. Result has 62 places, 48 transitions, 279 flow [2021-03-11 20:13:44,355 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=279, PETRI_PLACES=62, PETRI_TRANSITIONS=48} [2021-03-11 20:13:44,355 INFO L335 CegarLoopForPetriNet]: 34 programPoint places, 28 predicate places. [2021-03-11 20:13:44,355 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 48 transitions, 279 flow [2021-03-11 20:13:44,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 141.0) internal successors, (705), 5 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:44,356 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:13:44,356 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:13:44,356 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 20:13:44,356 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:13:44,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:13:44,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1003809362, now seen corresponding path program 2 times [2021-03-11 20:13:44,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:13:44,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664169864] [2021-03-11 20:13:44,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:13:44,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:13:44,438 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:44,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:13:44,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:44,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:13:44,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:44,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 20:13:44,464 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:44,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:13:44,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:44,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:13:44,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:44,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:13:44,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:13:44,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664169864] [2021-03-11 20:13:44,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:13:44,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 20:13:44,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114368884] [2021-03-11 20:13:44,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-11 20:13:44,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:13:44,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-11 20:13:44,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-11 20:13:44,484 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 180 [2021-03-11 20:13:44,485 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 48 transitions, 279 flow. Second operand has 8 states, 8 states have (on average 116.375) internal successors, (931), 8 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:44,485 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:13:44,485 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 180 [2021-03-11 20:13:44,485 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:13:44,687 INFO L129 PetriNetUnfolder]: 171/546 cut-off events. [2021-03-11 20:13:44,687 INFO L130 PetriNetUnfolder]: For 1529/1692 co-relation queries the response was YES. [2021-03-11 20:13:44,689 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1935 conditions, 546 events. 171/546 cut-off events. For 1529/1692 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4096 event pairs, 3 based on Foata normal form. 80/593 useless extension candidates. Maximal degree in co-relation 1913. Up to 135 conditions per place. [2021-03-11 20:13:44,690 INFO L132 encePairwiseOnDemand]: 172/180 looper letters, 18 selfloop transitions, 3 changer transitions 32/79 dead transitions. [2021-03-11 20:13:44,690 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 79 transitions, 573 flow [2021-03-11 20:13:44,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-11 20:13:44,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-11 20:13:44,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1185 transitions. [2021-03-11 20:13:44,692 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6583333333333333 [2021-03-11 20:13:44,692 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1185 transitions. [2021-03-11 20:13:44,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1185 transitions. [2021-03-11 20:13:44,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:13:44,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1185 transitions. [2021-03-11 20:13:44,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 118.5) internal successors, (1185), 10 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:44,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 180.0) internal successors, (1980), 11 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:44,698 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 180.0) internal successors, (1980), 11 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:44,698 INFO L185 Difference]: Start difference. First operand has 62 places, 48 transitions, 279 flow. Second operand 10 states and 1185 transitions. [2021-03-11 20:13:44,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 79 transitions, 573 flow [2021-03-11 20:13:44,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 79 transitions, 570 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-11 20:13:44,705 INFO L241 Difference]: Finished difference. Result has 74 places, 43 transitions, 262 flow [2021-03-11 20:13:44,705 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=262, PETRI_PLACES=74, PETRI_TRANSITIONS=43} [2021-03-11 20:13:44,705 INFO L335 CegarLoopForPetriNet]: 34 programPoint places, 40 predicate places. [2021-03-11 20:13:44,705 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 43 transitions, 262 flow [2021-03-11 20:13:44,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 116.375) internal successors, (931), 8 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:44,706 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:13:44,706 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:13:44,706 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 20:13:44,706 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:13:44,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:13:44,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1371437546, now seen corresponding path program 3 times [2021-03-11 20:13:44,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:13:44,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847306638] [2021-03-11 20:13:44,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:13:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:13:44,739 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:13:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:13:44,772 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:13:44,803 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 20:13:44,804 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 20:13:44,804 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 20:13:44,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 08:13:44 BasicIcfg [2021-03-11 20:13:44,871 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 20:13:44,872 INFO L168 Benchmark]: Toolchain (without parser) took 12115.05 ms. Allocated memory was 394.3 MB in the beginning and 627.0 MB in the end (delta: 232.8 MB). Free memory was 357.3 MB in the beginning and 547.0 MB in the end (delta: -189.7 MB). Peak memory consumption was 45.0 MB. Max. memory is 16.0 GB. [2021-03-11 20:13:44,872 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 394.3 MB. Free memory was 375.7 MB in the beginning and 375.6 MB in the end (delta: 70.9 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 20:13:44,874 INFO L168 Benchmark]: CACSL2BoogieTranslator took 506.33 ms. Allocated memory is still 394.3 MB. Free memory was 356.7 MB in the beginning and 354.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. [2021-03-11 20:13:44,874 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.33 ms. Allocated memory is still 394.3 MB. Free memory was 354.1 MB in the beginning and 349.9 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-11 20:13:44,875 INFO L168 Benchmark]: Boogie Preprocessor took 45.83 ms. Allocated memory is still 394.3 MB. Free memory was 349.9 MB in the beginning and 347.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:13:44,875 INFO L168 Benchmark]: RCFGBuilder took 1476.67 ms. Allocated memory is still 394.3 MB. Free memory was 347.8 MB in the beginning and 344.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 210.7 MB. Max. memory is 16.0 GB. [2021-03-11 20:13:44,875 INFO L168 Benchmark]: TraceAbstraction took 10013.02 ms. Allocated memory was 394.3 MB in the beginning and 627.0 MB in the end (delta: 232.8 MB). Free memory was 344.7 MB in the beginning and 547.0 MB in the end (delta: -202.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 16.0 GB. [2021-03-11 20:13:44,880 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09 ms. Allocated memory is still 394.3 MB. Free memory was 375.7 MB in the beginning and 375.6 MB in the end (delta: 70.9 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 506.33 ms. Allocated memory is still 394.3 MB. Free memory was 356.7 MB in the beginning and 354.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 65.33 ms. Allocated memory is still 394.3 MB. Free memory was 354.1 MB in the beginning and 349.9 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 45.83 ms. Allocated memory is still 394.3 MB. Free memory was 349.9 MB in the beginning and 347.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1476.67 ms. Allocated memory is still 394.3 MB. Free memory was 347.8 MB in the beginning and 344.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 210.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 10013.02 ms. Allocated memory was 394.3 MB in the beginning and 627.0 MB in the end (delta: 232.8 MB). Free memory was 344.7 MB in the beginning and 547.0 MB in the end (delta: -202.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7662.4ms, 103 PlacesBefore, 34 PlacesAfterwards, 95 TransitionsBefore, 25 TransitionsAfterwards, 1686 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 82 TotalNumberOfCompositions, 4770 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2179, positive: 2010, positive conditional: 0, positive unconditional: 2010, negative: 169, negative conditional: 0, negative unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1154, positive: 1109, positive conditional: 0, positive unconditional: 1109, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1154, positive: 1080, positive conditional: 0, positive unconditional: 1080, negative: 74, negative conditional: 0, negative unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 74, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 735, positive: 69, positive conditional: 0, positive unconditional: 69, negative: 665, negative conditional: 0, negative unconditional: 665, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2179, positive: 901, positive conditional: 0, positive unconditional: 901, negative: 124, negative conditional: 0, negative unconditional: 124, unknown: 1154, unknown conditional: 0, unknown unconditional: 1154] , Statistics on independence cache: Total cache size (in pairs): 141, Positive cache size: 124, Positive conditional cache size: 0, Positive unconditional cache size: 124, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t1403; [L821] FCALL, FORK 0 pthread_create(&t1403, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] 0 pthread_t t1404; [L823] FCALL, FORK 0 pthread_create(&t1404, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L775] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L824] 0 pthread_t t1405; [L825] FCALL, FORK 0 pthread_create(&t1405, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L792] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] 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) [L749] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L749] 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) [L749] 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) [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L751] 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 [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L753] 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 [L778] 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) [L778] 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) [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] 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 [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 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 [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L798] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L798] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L800] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L801] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L802] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L802] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L831] 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) [L831] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L831] 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) [L831] 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) [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L833] 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 [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L834] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L835] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L835] 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 [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 x$flush_delayed = weak$$choice2 [L841] 0 x$mem_tmp = x [L842] 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) [L842] 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) [L843] 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)) [L843] 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)) [L844] 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)) [L844] 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)) [L845] 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)) [L845] 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)) [L846] 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)) [L846] 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)) [L847] 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)) [L847] 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)) [L848] 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)) [L848] 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)) [L849] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) [L850] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L850] 0 x = x$flush_delayed ? x$mem_tmp : x [L851] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 97 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 9870.1ms, OverallIterations: 9, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 983.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7725.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 37 SDtfs, 59 SDslu, 53 SDs, 0 SdLazy, 247 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 259.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 334.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=349occurred in iteration=6, InterpolantAutomatonStates: 55, 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: 27.3ms SsaConstructionTime, 393.9ms SatisfiabilityAnalysisTime, 523.6ms InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 686 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...