/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-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9b7772ad7705253c1305067fc38dc9bc7271fbe3-9b7772a [2021-04-15 01:04:57,895 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-04-15 01:04:57,897 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-04-15 01:04:57,932 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-04-15 01:04:57,933 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-04-15 01:04:57,935 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-04-15 01:04:57,938 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-04-15 01:04:57,943 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-04-15 01:04:57,945 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-04-15 01:04:57,949 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-04-15 01:04:57,950 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-04-15 01:04:57,951 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-04-15 01:04:57,952 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-04-15 01:04:57,953 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-04-15 01:04:57,955 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-04-15 01:04:57,956 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-04-15 01:04:57,958 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-04-15 01:04:57,959 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-04-15 01:04:57,961 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-04-15 01:04:57,969 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-04-15 01:04:57,970 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-04-15 01:04:57,971 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-04-15 01:04:57,972 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-04-15 01:04:57,974 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-04-15 01:04:57,980 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-04-15 01:04:57,980 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-04-15 01:04:57,980 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-04-15 01:04:57,982 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-04-15 01:04:57,982 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-04-15 01:04:58,006 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-04-15 01:04:58,006 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-04-15 01:04:58,007 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-04-15 01:04:58,008 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-04-15 01:04:58,009 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-04-15 01:04:58,010 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-04-15 01:04:58,010 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-04-15 01:04:58,010 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-04-15 01:04:58,011 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-04-15 01:04:58,011 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-04-15 01:04:58,011 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-04-15 01:04:58,012 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-04-15 01:04:58,013 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-FA-NoLbe.epf [2021-04-15 01:04:58,047 INFO L113 SettingsManager]: Loading preferences was successful [2021-04-15 01:04:58,047 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-04-15 01:04:58,048 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-04-15 01:04:58,048 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-04-15 01:04:58,050 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-04-15 01:04:58,051 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-04-15 01:04:58,051 INFO L138 SettingsManager]: * Use SBE=true [2021-04-15 01:04:58,051 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-04-15 01:04:58,051 INFO L138 SettingsManager]: * sizeof long=4 [2021-04-15 01:04:58,051 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-04-15 01:04:58,052 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-04-15 01:04:58,052 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-04-15 01:04:58,052 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-04-15 01:04:58,052 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-04-15 01:04:58,052 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-04-15 01:04:58,053 INFO L138 SettingsManager]: * sizeof long double=12 [2021-04-15 01:04:58,053 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-04-15 01:04:58,053 INFO L138 SettingsManager]: * Use constant arrays=true [2021-04-15 01:04:58,053 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-04-15 01:04:58,053 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-04-15 01:04:58,053 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-04-15 01:04:58,053 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-04-15 01:04:58,053 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-04-15 01:04:58,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-04-15 01:04:58,054 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-04-15 01:04:58,054 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-04-15 01:04:58,054 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-04-15 01:04:58,054 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-04-15 01:04:58,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-04-15 01:04:58,054 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-04-15 01:04:58,054 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-04-15 01:04:58,055 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-04-15 01:04:58,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-04-15 01:04:58,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-04-15 01:04:58,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-04-15 01:04:58,402 INFO L271 PluginConnector]: Initializing CDTParser... [2021-04-15 01:04:58,402 INFO L275 PluginConnector]: CDTParser initialized [2021-04-15 01:04:58,403 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_pso.oepc.i [2021-04-15 01:04:58,458 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e4f3f9e1/0ed32d25a159457aa7e0cc0a51e5e4b8/FLAG319759101 [2021-04-15 01:04:59,351 INFO L306 CDTParser]: Found 1 translation units. [2021-04-15 01:04:59,351 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_pso.oepc.i [2021-04-15 01:04:59,365 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e4f3f9e1/0ed32d25a159457aa7e0cc0a51e5e4b8/FLAG319759101 [2021-04-15 01:04:59,481 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e4f3f9e1/0ed32d25a159457aa7e0cc0a51e5e4b8 [2021-04-15 01:04:59,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-04-15 01:04:59,485 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-04-15 01:04:59,488 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-04-15 01:04:59,488 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-04-15 01:04:59,491 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-04-15 01:04:59,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:04:59" (1/1) ... [2021-04-15 01:04:59,494 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75518b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:59, skipping insertion in model container [2021-04-15 01:04:59,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:04:59" (1/1) ... [2021-04-15 01:04:59,503 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-04-15 01:04:59,554 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-04-15 01:04:59,735 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/safe030_pso.oepc.i[950,963] [2021-04-15 01:04:59,870 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-15 01:04:59,877 INFO L203 MainTranslator]: Completed pre-run [2021-04-15 01:04:59,888 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/safe030_pso.oepc.i[950,963] [2021-04-15 01:04:59,956 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-15 01:05:00,024 INFO L208 MainTranslator]: Completed translation [2021-04-15 01:05:00,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:00 WrapperNode [2021-04-15 01:05:00,025 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-04-15 01:05:00,026 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-04-15 01:05:00,026 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-04-15 01:05:00,026 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-04-15 01:05:00,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:00" (1/1) ... [2021-04-15 01:05:00,061 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:00" (1/1) ... [2021-04-15 01:05:00,099 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-04-15 01:05:00,100 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-04-15 01:05:00,100 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-04-15 01:05:00,101 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-04-15 01:05:00,109 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:00" (1/1) ... [2021-04-15 01:05:00,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:00" (1/1) ... [2021-04-15 01:05:00,123 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:00" (1/1) ... [2021-04-15 01:05:00,124 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:00" (1/1) ... [2021-04-15 01:05:00,137 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:00" (1/1) ... [2021-04-15 01:05:00,140 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:00" (1/1) ... [2021-04-15 01:05:00,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:00" (1/1) ... [2021-04-15 01:05:00,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-04-15 01:05:00,167 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-04-15 01:05:00,168 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-04-15 01:05:00,168 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-04-15 01:05:00,169 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:00" (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-04-15 01:05:00,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-04-15 01:05:00,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-04-15 01:05:00,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-04-15 01:05:00,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-04-15 01:05:00,216 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-04-15 01:05:00,216 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-04-15 01:05:00,216 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-04-15 01:05:00,216 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-04-15 01:05:00,216 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-04-15 01:05:00,217 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-04-15 01:05:00,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-04-15 01:05:00,217 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-04-15 01:05:00,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-04-15 01:05:00,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-04-15 01:05:00,218 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-04-15 01:05:01,934 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-04-15 01:05:01,935 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-04-15 01:05:01,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:05:01 BoogieIcfgContainer [2021-04-15 01:05:01,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-04-15 01:05:01,939 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-04-15 01:05:01,939 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-04-15 01:05:01,942 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-04-15 01:05:01,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:04:59" (1/3) ... [2021-04-15 01:05:01,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7380aca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:05:01, skipping insertion in model container [2021-04-15 01:05:01,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:05:00" (2/3) ... [2021-04-15 01:05:01,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7380aca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:05:01, skipping insertion in model container [2021-04-15 01:05:01,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:05:01" (3/3) ... [2021-04-15 01:05:01,944 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_pso.oepc.i [2021-04-15 01:05:01,953 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-04-15 01:05:01,953 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-04-15 01:05:01,957 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-04-15 01:05:01,957 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-04-15 01:05:01,989 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,989 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,989 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,989 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,989 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,990 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,990 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,990 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,990 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,990 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,990 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,991 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,991 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,991 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,991 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,991 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,991 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,991 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,993 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,993 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,993 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,993 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,994 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,994 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,994 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,995 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,995 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,995 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,995 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,995 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,995 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,996 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,996 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,996 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,997 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,998 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,998 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,998 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,998 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,998 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,999 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,999 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,999 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,999 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,999 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,999 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,999 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,999 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,000 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,000 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,000 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,000 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,000 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,000 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,000 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,001 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,001 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,001 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,001 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,002 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,002 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,002 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,007 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,007 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,007 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,007 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,008 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,008 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,008 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,008 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,008 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,009 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,012 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,014 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,014 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,014 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,014 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,019 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,019 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,019 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,019 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,020 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,021 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,021 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,021 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,021 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,021 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,021 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,022 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,022 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,022 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,022 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,022 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,022 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:02,023 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-04-15 01:05:02,039 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-04-15 01:05:02,063 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-04-15 01:05:02,063 INFO L377 AbstractCegarLoop]: Hoare is true [2021-04-15 01:05:02,063 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-04-15 01:05:02,063 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-04-15 01:05:02,063 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-04-15 01:05:02,063 INFO L381 AbstractCegarLoop]: Difference is false [2021-04-15 01:05:02,064 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-04-15 01:05:02,064 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-04-15 01:05:02,074 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 104 places, 96 transitions, 207 flow [2021-04-15 01:05:02,927 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 15336 states, 15332 states have (on average 3.6506652752413253) internal successors, (55972), 15335 states have internal predecessors, (55972), 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-04-15 01:05:02,964 INFO L276 IsEmpty]: Start isEmpty. Operand has 15336 states, 15332 states have (on average 3.6506652752413253) internal successors, (55972), 15335 states have internal predecessors, (55972), 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-04-15 01:05:02,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-04-15 01:05:02,971 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:02,971 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 01:05:02,972 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:02,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:02,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1089194266, now seen corresponding path program 1 times [2021-04-15 01:05:02,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:02,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164839880] [2021-04-15 01:05:02,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:03,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:05:03,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164839880] [2021-04-15 01:05:03,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:03,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-04-15 01:05:03,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509260684] [2021-04-15 01:05:03,342 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-15 01:05:03,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:03,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-15 01:05:03,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-15 01:05:03,380 INFO L87 Difference]: Start difference. First operand has 15336 states, 15332 states have (on average 3.6506652752413253) internal successors, (55972), 15335 states have internal predecessors, (55972), 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) Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 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-04-15 01:05:03,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:03,671 INFO L93 Difference]: Finished difference Result 13124 states and 46688 transitions. [2021-04-15 01:05:03,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-15 01:05:03,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 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) Word has length 38 [2021-04-15 01:05:03,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:03,748 INFO L225 Difference]: With dead ends: 13124 [2021-04-15 01:05:03,749 INFO L226 Difference]: Without dead ends: 7492 [2021-04-15 01:05:03,750 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-15 01:05:03,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7492 states. [2021-04-15 01:05:04,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7492 to 7492. [2021-04-15 01:05:04,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7492 states, 7491 states have (on average 3.5071419036176747) internal successors, (26272), 7491 states have internal predecessors, (26272), 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-04-15 01:05:04,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7492 states to 7492 states and 26272 transitions. [2021-04-15 01:05:04,207 INFO L78 Accepts]: Start accepts. Automaton has 7492 states and 26272 transitions. Word has length 38 [2021-04-15 01:05:04,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:04,208 INFO L480 AbstractCegarLoop]: Abstraction has 7492 states and 26272 transitions. [2021-04-15 01:05:04,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 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-04-15 01:05:04,208 INFO L276 IsEmpty]: Start isEmpty. Operand 7492 states and 26272 transitions. [2021-04-15 01:05:04,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-04-15 01:05:04,219 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:04,219 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 01:05:04,219 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-04-15 01:05:04,219 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:04,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:04,220 INFO L82 PathProgramCache]: Analyzing trace with hash -948121074, now seen corresponding path program 1 times [2021-04-15 01:05:04,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:04,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463741448] [2021-04-15 01:05:04,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:04,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:05:04,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463741448] [2021-04-15 01:05:04,566 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:04,567 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-15 01:05:04,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505432981] [2021-04-15 01:05:04,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-15 01:05:04,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:04,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-15 01:05:04,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-04-15 01:05:04,570 INFO L87 Difference]: Start difference. First operand 7492 states and 26272 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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-04-15 01:05:04,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:04,765 INFO L93 Difference]: Finished difference Result 9252 states and 32116 transitions. [2021-04-15 01:05:04,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-15 01:05:04,766 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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) Word has length 57 [2021-04-15 01:05:04,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:04,828 INFO L225 Difference]: With dead ends: 9252 [2021-04-15 01:05:04,828 INFO L226 Difference]: Without dead ends: 7204 [2021-04-15 01:05:04,829 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 88.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-04-15 01:05:04,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7204 states. [2021-04-15 01:05:05,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7204 to 7204. [2021-04-15 01:05:05,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7204 states, 7203 states have (on average 3.4924337081771486) internal successors, (25156), 7203 states have internal predecessors, (25156), 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-04-15 01:05:05,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7204 states to 7204 states and 25156 transitions. [2021-04-15 01:05:05,175 INFO L78 Accepts]: Start accepts. Automaton has 7204 states and 25156 transitions. Word has length 57 [2021-04-15 01:05:05,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:05,177 INFO L480 AbstractCegarLoop]: Abstraction has 7204 states and 25156 transitions. [2021-04-15 01:05:05,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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-04-15 01:05:05,177 INFO L276 IsEmpty]: Start isEmpty. Operand 7204 states and 25156 transitions. [2021-04-15 01:05:05,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-04-15 01:05:05,193 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:05,193 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 01:05:05,193 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-04-15 01:05:05,193 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:05,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:05,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1912407697, now seen corresponding path program 1 times [2021-04-15 01:05:05,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:05,194 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181452926] [2021-04-15 01:05:05,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:05,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:05:05,435 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181452926] [2021-04-15 01:05:05,435 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:05,435 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-15 01:05:05,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191464518] [2021-04-15 01:05:05,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-15 01:05:05,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:05,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-15 01:05:05,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-04-15 01:05:05,436 INFO L87 Difference]: Start difference. First operand 7204 states and 25156 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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-04-15 01:05:05,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:05,591 INFO L93 Difference]: Finished difference Result 8844 states and 30580 transitions. [2021-04-15 01:05:05,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-15 01:05:05,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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) Word has length 59 [2021-04-15 01:05:05,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:05,622 INFO L225 Difference]: With dead ends: 8844 [2021-04-15 01:05:05,622 INFO L226 Difference]: Without dead ends: 6988 [2021-04-15 01:05:05,623 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 87.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-04-15 01:05:05,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6988 states. [2021-04-15 01:05:05,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6988 to 6988. [2021-04-15 01:05:05,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6988 states, 6987 states have (on average 3.481894947760126) internal successors, (24328), 6987 states have internal predecessors, (24328), 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-04-15 01:05:05,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6988 states to 6988 states and 24328 transitions. [2021-04-15 01:05:05,928 INFO L78 Accepts]: Start accepts. Automaton has 6988 states and 24328 transitions. Word has length 59 [2021-04-15 01:05:05,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:05,930 INFO L480 AbstractCegarLoop]: Abstraction has 6988 states and 24328 transitions. [2021-04-15 01:05:05,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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-04-15 01:05:05,931 INFO L276 IsEmpty]: Start isEmpty. Operand 6988 states and 24328 transitions. [2021-04-15 01:05:05,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-04-15 01:05:05,941 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:05,942 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 01:05:05,942 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-04-15 01:05:05,942 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:05,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:05,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1635427807, now seen corresponding path program 1 times [2021-04-15 01:05:05,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:05,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478553971] [2021-04-15 01:05:05,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:06,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:06,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:05:06,169 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478553971] [2021-04-15 01:05:06,169 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:06,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-04-15 01:05:06,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72515283] [2021-04-15 01:05:06,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-04-15 01:05:06,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:06,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-04-15 01:05:06,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-04-15 01:05:06,170 INFO L87 Difference]: Start difference. First operand 6988 states and 24328 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 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-04-15 01:05:06,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:06,607 INFO L93 Difference]: Finished difference Result 8612 states and 29742 transitions. [2021-04-15 01:05:06,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-04-15 01:05:06,613 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 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) Word has length 60 [2021-04-15 01:05:06,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:06,640 INFO L225 Difference]: With dead ends: 8612 [2021-04-15 01:05:06,640 INFO L226 Difference]: Without dead ends: 7044 [2021-04-15 01:05:06,641 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 193.2ms TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2021-04-15 01:05:06,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7044 states. [2021-04-15 01:05:06,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7044 to 6796. [2021-04-15 01:05:06,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6796 states, 6795 states have (on average 3.472553348050037) internal successors, (23596), 6795 states have internal predecessors, (23596), 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-04-15 01:05:06,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6796 states to 6796 states and 23596 transitions. [2021-04-15 01:05:06,858 INFO L78 Accepts]: Start accepts. Automaton has 6796 states and 23596 transitions. Word has length 60 [2021-04-15 01:05:06,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:06,859 INFO L480 AbstractCegarLoop]: Abstraction has 6796 states and 23596 transitions. [2021-04-15 01:05:06,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 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-04-15 01:05:06,860 INFO L276 IsEmpty]: Start isEmpty. Operand 6796 states and 23596 transitions. [2021-04-15 01:05:06,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-04-15 01:05:06,874 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:06,874 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 01:05:06,874 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-04-15 01:05:06,874 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:06,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:06,875 INFO L82 PathProgramCache]: Analyzing trace with hash -77969310, now seen corresponding path program 1 times [2021-04-15 01:05:06,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:06,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534576574] [2021-04-15 01:05:06,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:07,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:05:07,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534576574] [2021-04-15 01:05:07,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:07,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-15 01:05:07,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293678122] [2021-04-15 01:05:07,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-15 01:05:07,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:07,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-15 01:05:07,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-04-15 01:05:07,062 INFO L87 Difference]: Start difference. First operand 6796 states and 23596 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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-04-15 01:05:07,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:07,225 INFO L93 Difference]: Finished difference Result 11736 states and 40098 transitions. [2021-04-15 01:05:07,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-15 01:05:07,226 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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) Word has length 62 [2021-04-15 01:05:07,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:07,253 INFO L225 Difference]: With dead ends: 11736 [2021-04-15 01:05:07,253 INFO L226 Difference]: Without dead ends: 7816 [2021-04-15 01:05:07,253 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 87.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-04-15 01:05:07,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7816 states. [2021-04-15 01:05:07,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7816 to 6436. [2021-04-15 01:05:07,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6436 states, 6435 states have (on average 3.4001554001554) internal successors, (21880), 6435 states have internal predecessors, (21880), 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-04-15 01:05:07,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6436 states to 6436 states and 21880 transitions. [2021-04-15 01:05:07,442 INFO L78 Accepts]: Start accepts. Automaton has 6436 states and 21880 transitions. Word has length 62 [2021-04-15 01:05:07,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:07,443 INFO L480 AbstractCegarLoop]: Abstraction has 6436 states and 21880 transitions. [2021-04-15 01:05:07,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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-04-15 01:05:07,443 INFO L276 IsEmpty]: Start isEmpty. Operand 6436 states and 21880 transitions. [2021-04-15 01:05:07,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-04-15 01:05:07,455 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:07,455 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 01:05:07,455 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-04-15 01:05:07,455 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:07,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:07,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1061097053, now seen corresponding path program 1 times [2021-04-15 01:05:07,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:07,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945408028] [2021-04-15 01:05:07,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:07,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:05:07,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945408028] [2021-04-15 01:05:07,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:07,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-15 01:05:07,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726674009] [2021-04-15 01:05:07,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-15 01:05:07,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:07,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-15 01:05:07,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-04-15 01:05:07,618 INFO L87 Difference]: Start difference. First operand 6436 states and 21880 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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-04-15 01:05:07,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:07,764 INFO L93 Difference]: Finished difference Result 11256 states and 37826 transitions. [2021-04-15 01:05:07,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-15 01:05:07,765 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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) Word has length 62 [2021-04-15 01:05:07,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:07,790 INFO L225 Difference]: With dead ends: 11256 [2021-04-15 01:05:07,790 INFO L226 Difference]: Without dead ends: 7456 [2021-04-15 01:05:07,791 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 83.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-04-15 01:05:07,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7456 states. [2021-04-15 01:05:07,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7456 to 6076. [2021-04-15 01:05:07,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6076 states, 6075 states have (on average 3.323127572016461) internal successors, (20188), 6075 states have internal predecessors, (20188), 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-04-15 01:05:07,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6076 states to 6076 states and 20188 transitions. [2021-04-15 01:05:07,954 INFO L78 Accepts]: Start accepts. Automaton has 6076 states and 20188 transitions. Word has length 62 [2021-04-15 01:05:07,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:07,954 INFO L480 AbstractCegarLoop]: Abstraction has 6076 states and 20188 transitions. [2021-04-15 01:05:07,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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-04-15 01:05:07,954 INFO L276 IsEmpty]: Start isEmpty. Operand 6076 states and 20188 transitions. [2021-04-15 01:05:07,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-04-15 01:05:07,965 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:07,965 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 01:05:07,965 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-04-15 01:05:07,965 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:07,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:07,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1005091889, now seen corresponding path program 1 times [2021-04-15 01:05:07,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:07,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670315799] [2021-04-15 01:05:07,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:08,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:05:08,167 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670315799] [2021-04-15 01:05:08,167 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:08,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-04-15 01:05:08,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527816590] [2021-04-15 01:05:08,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-04-15 01:05:08,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:08,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-04-15 01:05:08,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-04-15 01:05:08,171 INFO L87 Difference]: Start difference. First operand 6076 states and 20188 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 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-04-15 01:05:08,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:08,613 INFO L93 Difference]: Finished difference Result 7140 states and 23694 transitions. [2021-04-15 01:05:08,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-04-15 01:05:08,614 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 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) Word has length 62 [2021-04-15 01:05:08,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:08,641 INFO L225 Difference]: With dead ends: 7140 [2021-04-15 01:05:08,641 INFO L226 Difference]: Without dead ends: 6148 [2021-04-15 01:05:08,642 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 264.1ms TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2021-04-15 01:05:08,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6148 states. [2021-04-15 01:05:08,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6148 to 6092. [2021-04-15 01:05:08,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6092 states, 6091 states have (on average 3.3216220653423085) internal successors, (20232), 6091 states have internal predecessors, (20232), 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-04-15 01:05:08,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6092 states to 6092 states and 20232 transitions. [2021-04-15 01:05:08,831 INFO L78 Accepts]: Start accepts. Automaton has 6092 states and 20232 transitions. Word has length 62 [2021-04-15 01:05:08,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:08,832 INFO L480 AbstractCegarLoop]: Abstraction has 6092 states and 20232 transitions. [2021-04-15 01:05:08,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 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-04-15 01:05:08,832 INFO L276 IsEmpty]: Start isEmpty. Operand 6092 states and 20232 transitions. [2021-04-15 01:05:08,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-04-15 01:05:08,844 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:08,845 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 01:05:08,845 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-04-15 01:05:08,845 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:08,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:08,845 INFO L82 PathProgramCache]: Analyzing trace with hash 119598043, now seen corresponding path program 2 times [2021-04-15 01:05:08,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:08,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718468071] [2021-04-15 01:05:08,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:09,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:05:09,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718468071] [2021-04-15 01:05:09,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:09,021 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-04-15 01:05:09,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411911885] [2021-04-15 01:05:09,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-04-15 01:05:09,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:09,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-04-15 01:05:09,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-04-15 01:05:09,022 INFO L87 Difference]: Start difference. First operand 6092 states and 20232 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 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-04-15 01:05:09,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:09,409 INFO L93 Difference]: Finished difference Result 7124 states and 23620 transitions. [2021-04-15 01:05:09,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-04-15 01:05:09,410 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 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) Word has length 62 [2021-04-15 01:05:09,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:09,439 INFO L225 Difference]: With dead ends: 7124 [2021-04-15 01:05:09,439 INFO L226 Difference]: Without dead ends: 6132 [2021-04-15 01:05:09,441 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 208.1ms TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2021-04-15 01:05:09,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6132 states. [2021-04-15 01:05:09,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6132 to 6116. [2021-04-15 01:05:09,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6116 states, 6115 states have (on average 3.323630417007359) internal successors, (20324), 6115 states have internal predecessors, (20324), 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-04-15 01:05:09,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6116 states to 6116 states and 20324 transitions. [2021-04-15 01:05:09,613 INFO L78 Accepts]: Start accepts. Automaton has 6116 states and 20324 transitions. Word has length 62 [2021-04-15 01:05:09,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:09,613 INFO L480 AbstractCegarLoop]: Abstraction has 6116 states and 20324 transitions. [2021-04-15 01:05:09,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 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-04-15 01:05:09,614 INFO L276 IsEmpty]: Start isEmpty. Operand 6116 states and 20324 transitions. [2021-04-15 01:05:09,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-04-15 01:05:09,625 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:09,625 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 01:05:09,625 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-04-15 01:05:09,626 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:09,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:09,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1565955762, now seen corresponding path program 1 times [2021-04-15 01:05:09,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:09,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161895735] [2021-04-15 01:05:09,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:09,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:05:09,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161895735] [2021-04-15 01:05:09,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:09,812 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-04-15 01:05:09,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281847521] [2021-04-15 01:05:09,812 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-04-15 01:05:09,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:09,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-04-15 01:05:09,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-04-15 01:05:09,815 INFO L87 Difference]: Start difference. First operand 6116 states and 20324 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 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-04-15 01:05:10,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:10,083 INFO L93 Difference]: Finished difference Result 7100 states and 23436 transitions. [2021-04-15 01:05:10,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-04-15 01:05:10,084 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 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) Word has length 63 [2021-04-15 01:05:10,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:10,099 INFO L225 Difference]: With dead ends: 7100 [2021-04-15 01:05:10,099 INFO L226 Difference]: Without dead ends: 6204 [2021-04-15 01:05:10,099 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 163.6ms TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-04-15 01:05:10,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6204 states. [2021-04-15 01:05:10,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6204 to 6204. [2021-04-15 01:05:10,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6204 states, 6203 states have (on average 3.3061421892632596) internal successors, (20508), 6203 states have internal predecessors, (20508), 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-04-15 01:05:10,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6204 states to 6204 states and 20508 transitions. [2021-04-15 01:05:10,270 INFO L78 Accepts]: Start accepts. Automaton has 6204 states and 20508 transitions. Word has length 63 [2021-04-15 01:05:10,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:10,271 INFO L480 AbstractCegarLoop]: Abstraction has 6204 states and 20508 transitions. [2021-04-15 01:05:10,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 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-04-15 01:05:10,271 INFO L276 IsEmpty]: Start isEmpty. Operand 6204 states and 20508 transitions. [2021-04-15 01:05:10,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-04-15 01:05:10,285 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:10,285 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 01:05:10,285 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-04-15 01:05:10,285 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:10,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:10,286 INFO L82 PathProgramCache]: Analyzing trace with hash -2029603919, now seen corresponding path program 1 times [2021-04-15 01:05:10,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:10,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24891745] [2021-04-15 01:05:10,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:10,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:05:10,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24891745] [2021-04-15 01:05:10,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:10,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-04-15 01:05:10,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674236566] [2021-04-15 01:05:10,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-04-15 01:05:10,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:10,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-04-15 01:05:10,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-04-15 01:05:10,449 INFO L87 Difference]: Start difference. First operand 6204 states and 20508 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 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-04-15 01:05:10,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:10,803 INFO L93 Difference]: Finished difference Result 7404 states and 24424 transitions. [2021-04-15 01:05:10,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-04-15 01:05:10,804 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 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) Word has length 63 [2021-04-15 01:05:10,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:10,822 INFO L225 Difference]: With dead ends: 7404 [2021-04-15 01:05:10,822 INFO L226 Difference]: Without dead ends: 6508 [2021-04-15 01:05:10,822 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 224.5ms TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2021-04-15 01:05:10,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6508 states. [2021-04-15 01:05:10,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6508 to 6284. [2021-04-15 01:05:10,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6284 states, 6283 states have (on average 3.296514403947159) internal successors, (20712), 6283 states have internal predecessors, (20712), 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-04-15 01:05:10,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6284 states to 6284 states and 20712 transitions. [2021-04-15 01:05:10,995 INFO L78 Accepts]: Start accepts. Automaton has 6284 states and 20712 transitions. Word has length 63 [2021-04-15 01:05:10,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:10,995 INFO L480 AbstractCegarLoop]: Abstraction has 6284 states and 20712 transitions. [2021-04-15 01:05:10,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 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-04-15 01:05:10,996 INFO L276 IsEmpty]: Start isEmpty. Operand 6284 states and 20712 transitions. [2021-04-15 01:05:11,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-04-15 01:05:11,008 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:11,009 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 01:05:11,009 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-04-15 01:05:11,009 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:11,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:11,009 INFO L82 PathProgramCache]: Analyzing trace with hash 949795437, now seen corresponding path program 2 times [2021-04-15 01:05:11,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:11,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218565125] [2021-04-15 01:05:11,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:11,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:05:11,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218565125] [2021-04-15 01:05:11,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:11,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-04-15 01:05:11,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552087770] [2021-04-15 01:05:11,249 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-04-15 01:05:11,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:11,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-04-15 01:05:11,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-04-15 01:05:11,250 INFO L87 Difference]: Start difference. First operand 6284 states and 20712 transitions. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 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-04-15 01:05:11,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:11,619 INFO L93 Difference]: Finished difference Result 6844 states and 22452 transitions. [2021-04-15 01:05:11,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-04-15 01:05:11,619 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 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) Word has length 63 [2021-04-15 01:05:11,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:11,631 INFO L225 Difference]: With dead ends: 6844 [2021-04-15 01:05:11,631 INFO L226 Difference]: Without dead ends: 5948 [2021-04-15 01:05:11,631 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 220.8ms TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2021-04-15 01:05:11,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5948 states. [2021-04-15 01:05:11,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5948 to 5804. [2021-04-15 01:05:11,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5804 states, 5803 states have (on average 3.2851973117353093) internal successors, (19064), 5803 states have internal predecessors, (19064), 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-04-15 01:05:11,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5804 states to 5804 states and 19064 transitions. [2021-04-15 01:05:11,777 INFO L78 Accepts]: Start accepts. Automaton has 5804 states and 19064 transitions. Word has length 63 [2021-04-15 01:05:11,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:11,777 INFO L480 AbstractCegarLoop]: Abstraction has 5804 states and 19064 transitions. [2021-04-15 01:05:11,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 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-04-15 01:05:11,777 INFO L276 IsEmpty]: Start isEmpty. Operand 5804 states and 19064 transitions. [2021-04-15 01:05:11,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-04-15 01:05:11,787 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:11,787 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 01:05:11,788 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-04-15 01:05:11,788 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:11,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:11,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1170948817, now seen corresponding path program 1 times [2021-04-15 01:05:11,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:11,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402620211] [2021-04-15 01:05:11,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:11,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:05:11,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402620211] [2021-04-15 01:05:11,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:11,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-04-15 01:05:11,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726744628] [2021-04-15 01:05:11,981 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-04-15 01:05:11,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:11,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-04-15 01:05:11,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-04-15 01:05:11,982 INFO L87 Difference]: Start difference. First operand 5804 states and 19064 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 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-04-15 01:05:12,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:12,398 INFO L93 Difference]: Finished difference Result 7684 states and 25136 transitions. [2021-04-15 01:05:12,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-04-15 01:05:12,399 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 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) Word has length 64 [2021-04-15 01:05:12,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:12,410 INFO L225 Difference]: With dead ends: 7684 [2021-04-15 01:05:12,410 INFO L226 Difference]: Without dead ends: 6164 [2021-04-15 01:05:12,411 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 295.0ms TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2021-04-15 01:05:12,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6164 states. [2021-04-15 01:05:12,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6164 to 5972. [2021-04-15 01:05:12,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5972 states, 5971 states have (on average 3.2476972031485514) internal successors, (19392), 5971 states have internal predecessors, (19392), 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-04-15 01:05:12,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5972 states to 5972 states and 19392 transitions. [2021-04-15 01:05:12,572 INFO L78 Accepts]: Start accepts. Automaton has 5972 states and 19392 transitions. Word has length 64 [2021-04-15 01:05:12,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:12,572 INFO L480 AbstractCegarLoop]: Abstraction has 5972 states and 19392 transitions. [2021-04-15 01:05:12,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 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-04-15 01:05:12,575 INFO L276 IsEmpty]: Start isEmpty. Operand 5972 states and 19392 transitions. [2021-04-15 01:05:12,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-04-15 01:05:12,586 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:12,586 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 01:05:12,587 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-04-15 01:05:12,587 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:12,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:12,587 INFO L82 PathProgramCache]: Analyzing trace with hash -447617809, now seen corresponding path program 1 times [2021-04-15 01:05:12,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:12,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587610686] [2021-04-15 01:05:12,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:12,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:05:12,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587610686] [2021-04-15 01:05:12,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:12,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-15 01:05:12,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827791231] [2021-04-15 01:05:12,708 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-15 01:05:12,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:12,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-15 01:05:12,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-04-15 01:05:12,708 INFO L87 Difference]: Start difference. First operand 5972 states and 19392 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-04-15 01:05:12,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:12,828 INFO L93 Difference]: Finished difference Result 7228 states and 22897 transitions. [2021-04-15 01:05:12,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-15 01:05:12,829 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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) Word has length 65 [2021-04-15 01:05:12,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:12,839 INFO L225 Difference]: With dead ends: 7228 [2021-04-15 01:05:12,839 INFO L226 Difference]: Without dead ends: 5036 [2021-04-15 01:05:12,839 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 79.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-04-15 01:05:12,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5036 states. [2021-04-15 01:05:12,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5036 to 5036. [2021-04-15 01:05:12,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5036 states, 5035 states have (on average 3.1602780536246278) internal successors, (15912), 5035 states have internal predecessors, (15912), 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-04-15 01:05:12,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5036 states to 5036 states and 15912 transitions. [2021-04-15 01:05:12,957 INFO L78 Accepts]: Start accepts. Automaton has 5036 states and 15912 transitions. Word has length 65 [2021-04-15 01:05:12,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:12,958 INFO L480 AbstractCegarLoop]: Abstraction has 5036 states and 15912 transitions. [2021-04-15 01:05:12,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-04-15 01:05:12,958 INFO L276 IsEmpty]: Start isEmpty. Operand 5036 states and 15912 transitions. [2021-04-15 01:05:12,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-04-15 01:05:12,970 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:12,970 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 01:05:12,970 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-04-15 01:05:12,970 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:12,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:12,971 INFO L82 PathProgramCache]: Analyzing trace with hash -126297308, now seen corresponding path program 1 times [2021-04-15 01:05:12,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:12,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879903004] [2021-04-15 01:05:12,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:13,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:05:13,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879903004] [2021-04-15 01:05:13,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:13,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-04-15 01:05:13,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863230433] [2021-04-15 01:05:13,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-04-15 01:05:13,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:13,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-04-15 01:05:13,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-04-15 01:05:13,062 INFO L87 Difference]: Start difference. First operand 5036 states and 15912 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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-04-15 01:05:13,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:13,186 INFO L93 Difference]: Finished difference Result 4646 states and 14185 transitions. [2021-04-15 01:05:13,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-04-15 01:05:13,186 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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) Word has length 66 [2021-04-15 01:05:13,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:13,190 INFO L225 Difference]: With dead ends: 4646 [2021-04-15 01:05:13,190 INFO L226 Difference]: Without dead ends: 2982 [2021-04-15 01:05:13,191 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 88.2ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-04-15 01:05:13,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2021-04-15 01:05:13,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 2846. [2021-04-15 01:05:13,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2846 states, 2845 states have (on average 3.0038664323374342) internal successors, (8546), 2845 states have internal predecessors, (8546), 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-04-15 01:05:13,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2846 states to 2846 states and 8546 transitions. [2021-04-15 01:05:13,251 INFO L78 Accepts]: Start accepts. Automaton has 2846 states and 8546 transitions. Word has length 66 [2021-04-15 01:05:13,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:13,252 INFO L480 AbstractCegarLoop]: Abstraction has 2846 states and 8546 transitions. [2021-04-15 01:05:13,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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-04-15 01:05:13,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2846 states and 8546 transitions. [2021-04-15 01:05:13,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-04-15 01:05:13,257 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:13,258 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 01:05:13,259 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-04-15 01:05:13,259 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:13,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:13,259 INFO L82 PathProgramCache]: Analyzing trace with hash -35521137, now seen corresponding path program 1 times [2021-04-15 01:05:13,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:13,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63244006] [2021-04-15 01:05:13,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:13,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:05:13,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63244006] [2021-04-15 01:05:13,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:13,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-04-15 01:05:13,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3165508] [2021-04-15 01:05:13,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-04-15 01:05:13,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:13,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-04-15 01:05:13,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-04-15 01:05:13,394 INFO L87 Difference]: Start difference. First operand 2846 states and 8546 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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-04-15 01:05:13,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:13,530 INFO L93 Difference]: Finished difference Result 2216 states and 6419 transitions. [2021-04-15 01:05:13,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-04-15 01:05:13,531 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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) Word has length 69 [2021-04-15 01:05:13,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:13,533 INFO L225 Difference]: With dead ends: 2216 [2021-04-15 01:05:13,533 INFO L226 Difference]: Without dead ends: 1092 [2021-04-15 01:05:13,535 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 111.6ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-04-15 01:05:13,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2021-04-15 01:05:13,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 1060. [2021-04-15 01:05:13,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 1059 states have (on average 2.8083097261567516) internal successors, (2974), 1059 states have internal predecessors, (2974), 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-04-15 01:05:13,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 2974 transitions. [2021-04-15 01:05:13,552 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 2974 transitions. Word has length 69 [2021-04-15 01:05:13,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:13,552 INFO L480 AbstractCegarLoop]: Abstraction has 1060 states and 2974 transitions. [2021-04-15 01:05:13,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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-04-15 01:05:13,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 2974 transitions. [2021-04-15 01:05:13,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-04-15 01:05:13,554 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:13,554 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 01:05:13,554 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-04-15 01:05:13,555 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:13,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:13,555 INFO L82 PathProgramCache]: Analyzing trace with hash -175803705, now seen corresponding path program 1 times [2021-04-15 01:05:13,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:13,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404126136] [2021-04-15 01:05:13,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:13,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:13,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:05:13,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404126136] [2021-04-15 01:05:13,788 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:13,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-04-15 01:05:13,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990857650] [2021-04-15 01:05:13,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-04-15 01:05:13,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:13,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-04-15 01:05:13,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-04-15 01:05:13,790 INFO L87 Difference]: Start difference. First operand 1060 states and 2974 transitions. Second operand has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 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-04-15 01:05:13,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:13,994 INFO L93 Difference]: Finished difference Result 1570 states and 4476 transitions. [2021-04-15 01:05:13,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-04-15 01:05:13,995 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 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) Word has length 72 [2021-04-15 01:05:13,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:13,996 INFO L225 Difference]: With dead ends: 1570 [2021-04-15 01:05:13,997 INFO L226 Difference]: Without dead ends: 980 [2021-04-15 01:05:13,997 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 186.8ms TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-04-15 01:05:13,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2021-04-15 01:05:14,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 900. [2021-04-15 01:05:14,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 899 states have (on average 2.720800889877642) internal successors, (2446), 899 states have internal predecessors, (2446), 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-04-15 01:05:14,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 2446 transitions. [2021-04-15 01:05:14,012 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 2446 transitions. Word has length 72 [2021-04-15 01:05:14,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:14,012 INFO L480 AbstractCegarLoop]: Abstraction has 900 states and 2446 transitions. [2021-04-15 01:05:14,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 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-04-15 01:05:14,012 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 2446 transitions. [2021-04-15 01:05:14,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-04-15 01:05:14,014 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:14,014 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 01:05:14,014 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-04-15 01:05:14,014 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:14,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:14,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1543561815, now seen corresponding path program 2 times [2021-04-15 01:05:14,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:14,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558355000] [2021-04-15 01:05:14,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:14,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:14,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:05:14,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558355000] [2021-04-15 01:05:14,327 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:14,327 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-04-15 01:05:14,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300521263] [2021-04-15 01:05:14,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-04-15 01:05:14,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:14,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-04-15 01:05:14,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2021-04-15 01:05:14,328 INFO L87 Difference]: Start difference. First operand 900 states and 2446 transitions. Second operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 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-04-15 01:05:14,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:14,547 INFO L93 Difference]: Finished difference Result 1370 states and 3826 transitions. [2021-04-15 01:05:14,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-04-15 01:05:14,548 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 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) Word has length 72 [2021-04-15 01:05:14,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:14,549 INFO L225 Difference]: With dead ends: 1370 [2021-04-15 01:05:14,549 INFO L226 Difference]: Without dead ends: 748 [2021-04-15 01:05:14,550 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 232.3ms TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2021-04-15 01:05:14,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2021-04-15 01:05:14,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 748. [2021-04-15 01:05:14,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 747 states have (on average 2.7228915662650603) internal successors, (2034), 747 states have internal predecessors, (2034), 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-04-15 01:05:14,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 2034 transitions. [2021-04-15 01:05:14,560 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 2034 transitions. Word has length 72 [2021-04-15 01:05:14,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:14,560 INFO L480 AbstractCegarLoop]: Abstraction has 748 states and 2034 transitions. [2021-04-15 01:05:14,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 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-04-15 01:05:14,560 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 2034 transitions. [2021-04-15 01:05:14,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-04-15 01:05:14,562 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:14,562 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 01:05:14,562 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-04-15 01:05:14,562 INFO L428 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:14,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:14,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1090344665, now seen corresponding path program 3 times [2021-04-15 01:05:14,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:14,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621369221] [2021-04-15 01:05:14,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-15 01:05:14,597 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-15 01:05:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-15 01:05:14,634 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-15 01:05:14,664 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-04-15 01:05:14,665 INFO L652 BasicCegarLoop]: Counterexample might be feasible [2021-04-15 01:05:14,665 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-04-15 01:05:14,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 01:05:14 BasicIcfg [2021-04-15 01:05:14,788 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-04-15 01:05:14,789 INFO L168 Benchmark]: Toolchain (without parser) took 15304.17 ms. Allocated memory was 333.4 MB in the beginning and 2.9 GB in the end (delta: 2.6 GB). Free memory was 296.6 MB in the beginning and 1.1 GB in the end (delta: -762.8 MB). Peak memory consumption was 1.9 GB. Max. memory is 16.0 GB. [2021-04-15 01:05:14,789 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 333.4 MB. Free memory was 315.0 MB in the beginning and 314.9 MB in the end (delta: 70.1 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-04-15 01:05:14,790 INFO L168 Benchmark]: CACSL2BoogieTranslator took 537.21 ms. Allocated memory is still 333.4 MB. Free memory was 296.4 MB in the beginning and 292.0 MB in the end (delta: 4.3 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.0 GB. [2021-04-15 01:05:14,790 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.69 ms. Allocated memory is still 333.4 MB. Free memory was 292.0 MB in the beginning and 288.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-04-15 01:05:14,790 INFO L168 Benchmark]: Boogie Preprocessor took 53.82 ms. Allocated memory is still 333.4 MB. Free memory was 288.9 MB in the beginning and 286.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-04-15 01:05:14,790 INFO L168 Benchmark]: RCFGBuilder took 1770.45 ms. Allocated memory is still 333.4 MB. Free memory was 286.8 MB in the beginning and 233.6 MB in the end (delta: 53.2 MB). Peak memory consumption was 150.7 MB. Max. memory is 16.0 GB. [2021-04-15 01:05:14,790 INFO L168 Benchmark]: TraceAbstraction took 12849.23 ms. Allocated memory was 333.4 MB in the beginning and 2.9 GB in the end (delta: 2.6 GB). Free memory was 233.6 MB in the beginning and 1.1 GB in the end (delta: -825.8 MB). Peak memory consumption was 1.8 GB. Max. memory is 16.0 GB. [2021-04-15 01:05:14,795 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.15 ms. Allocated memory is still 333.4 MB. Free memory was 315.0 MB in the beginning and 314.9 MB in the end (delta: 70.1 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 537.21 ms. Allocated memory is still 333.4 MB. Free memory was 296.4 MB in the beginning and 292.0 MB in the end (delta: 4.3 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 73.69 ms. Allocated memory is still 333.4 MB. Free memory was 292.0 MB in the beginning and 288.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 53.82 ms. Allocated memory is still 333.4 MB. Free memory was 288.9 MB in the beginning and 286.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1770.45 ms. Allocated memory is still 333.4 MB. Free memory was 286.8 MB in the beginning and 233.6 MB in the end (delta: 53.2 MB). Peak memory consumption was 150.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 12849.23 ms. Allocated memory was 333.4 MB in the beginning and 2.9 GB in the end (delta: 2.6 GB). Free memory was 233.6 MB in the beginning and 1.1 GB in the end (delta: -825.8 MB). Peak memory consumption was 1.8 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L711] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L713] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L717] 0 int z = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L718] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L719] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L720] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L721] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L722] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L723] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L724] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L725] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L726] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L727] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L728] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L729] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L730] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L731] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L732] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L733] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L816] 0 pthread_t t2495; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] FCALL, FORK 0 pthread_create(&t2495, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 pthread_t t2496; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] FCALL, FORK 0 pthread_create(&t2496, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2497; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] FCALL, FORK 0 pthread_create(&t2497, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] 3 y = 2 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z = 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L794] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L794] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L796] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L798] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L829] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L831] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 95 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12604.3ms, OverallIterations: 18, TraceHistogramMax: 1, EmptinessCheckTime: 208.0ms, AutomataDifference: 4884.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 863.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2108 SDtfs, 3366 SDslu, 8260 SDs, 0 SdLazy, 1315 SolverSat, 315 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1480.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 251 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 2622.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=15336occurred in iteration=0, InterpolantAutomatonStates: 191, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2894.8ms AutomataMinimizationTime, 17 MinimizatonAttempts, 3888 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 62.2ms SsaConstructionTime, 940.8ms SatisfiabilityAnalysisTime, 2334.8ms InterpolantComputationTime, 1131 NumberOfCodeBlocks, 1131 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1042 ConstructedInterpolants, 0 QuantifiedInterpolants, 5916 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...