/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-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 10:57:15,823 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 10:57:15,825 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 10:57:15,852 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 10:57:15,852 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 10:57:15,855 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 10:57:15,858 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 10:57:15,863 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 10:57:15,865 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 10:57:15,869 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 10:57:15,870 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 10:57:15,871 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 10:57:15,872 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 10:57:15,873 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 10:57:15,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 10:57:15,876 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 10:57:15,876 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 10:57:15,877 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 10:57:15,881 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 10:57:15,891 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 10:57:15,892 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 10:57:15,893 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 10:57:15,895 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 10:57:15,896 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 10:57:15,901 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 10:57:15,902 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 10:57:15,902 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 10:57:15,904 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 10:57:15,904 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 10:57:15,904 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 10:57:15,905 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 10:57:15,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 10:57:15,907 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 10:57:15,907 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 10:57:15,908 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 10:57:15,908 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 10:57:15,909 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 10:57:15,909 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 10:57:15,909 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 10:57:15,909 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 10:57:15,910 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 10:57:15,914 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-SemanticLbe.epf [2021-03-11 10:57:15,945 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 10:57:15,945 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 10:57:15,948 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 10:57:15,949 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 10:57:15,949 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 10:57:15,949 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 10:57:15,949 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 10:57:15,949 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 10:57:15,949 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 10:57:15,950 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 10:57:15,950 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 10:57:15,950 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 10:57:15,950 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 10:57:15,951 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 10:57:15,951 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 10:57:15,951 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 10:57:15,951 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 10:57:15,951 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 10:57:15,951 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 10:57:15,951 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 10:57:15,952 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 10:57:15,952 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 10:57:15,952 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 10:57:15,952 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 10:57:15,952 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 10:57:15,952 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 10:57:15,952 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 10:57:15,952 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-03-11 10:57:15,953 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-11 10:57:16,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 10:57:16,244 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 10:57:16,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 10:57:16,247 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 10:57:16,248 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 10:57:16,248 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2021-03-11 10:57:16,307 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ced995c7/c1b36a74862846b9a4555073ef6a4167/FLAGff75657be [2021-03-11 10:57:16,907 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 10:57:16,908 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2021-03-11 10:57:16,924 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ced995c7/c1b36a74862846b9a4555073ef6a4167/FLAGff75657be [2021-03-11 10:57:17,284 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ced995c7/c1b36a74862846b9a4555073ef6a4167 [2021-03-11 10:57:17,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 10:57:17,292 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 10:57:17,295 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 10:57:17,296 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 10:57:17,299 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 10:57:17,299 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 10:57:17" (1/1) ... [2021-03-11 10:57:17,300 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef70b88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:57:17, skipping insertion in model container [2021-03-11 10:57:17,301 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 10:57:17" (1/1) ... [2021-03-11 10:57:17,306 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 10:57:17,355 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 10:57:17,478 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/mix005_tso.oepc.i[949,962] [2021-03-11 10:57:17,664 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 10:57:17,671 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 10:57:17,680 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/mix005_tso.oepc.i[949,962] [2021-03-11 10:57:17,719 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 10:57:17,774 INFO L208 MainTranslator]: Completed translation [2021-03-11 10:57:17,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:57:17 WrapperNode [2021-03-11 10:57:17,774 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 10:57:17,779 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 10:57:17,779 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 10:57:17,779 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 10:57:17,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:57:17" (1/1) ... [2021-03-11 10:57:17,804 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:57:17" (1/1) ... [2021-03-11 10:57:17,830 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 10:57:17,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 10:57:17,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 10:57:17,831 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 10:57:17,837 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:57:17" (1/1) ... [2021-03-11 10:57:17,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:57:17" (1/1) ... [2021-03-11 10:57:17,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:57:17" (1/1) ... [2021-03-11 10:57:17,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:57:17" (1/1) ... [2021-03-11 10:57:17,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:57:17" (1/1) ... [2021-03-11 10:57:17,865 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:57:17" (1/1) ... [2021-03-11 10:57:17,867 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:57:17" (1/1) ... [2021-03-11 10:57:17,871 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 10:57:17,872 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 10:57:17,872 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 10:57:17,872 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 10:57:17,873 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:57:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 10:57:17,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 10:57:17,956 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 10:57:17,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 10:57:17,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 10:57:17,956 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 10:57:17,956 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 10:57:17,956 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 10:57:17,957 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 10:57:17,957 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-11 10:57:17,957 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-11 10:57:17,957 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-11 10:57:17,957 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-11 10:57:17,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 10:57:17,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 10:57:17,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 10:57:17,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 10:57:17,959 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-11 10:57:19,770 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 10:57:19,771 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 10:57:19,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 10:57:19 BoogieIcfgContainer [2021-03-11 10:57:19,773 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 10:57:19,774 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 10:57:19,774 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 10:57:19,776 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 10:57:19,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 10:57:17" (1/3) ... [2021-03-11 10:57:19,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c3af84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 10:57:19, skipping insertion in model container [2021-03-11 10:57:19,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:57:17" (2/3) ... [2021-03-11 10:57:19,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c3af84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 10:57:19, skipping insertion in model container [2021-03-11 10:57:19,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 10:57:19" (3/3) ... [2021-03-11 10:57:19,779 INFO L111 eAbstractionObserver]: Analyzing ICFG mix005_tso.oepc.i [2021-03-11 10:57:19,784 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-03-11 10:57:19,784 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 10:57:19,788 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 10:57:19,788 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 10:57:19,819 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,819 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,819 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,819 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,819 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,820 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,820 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,820 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,820 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,820 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,820 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,820 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,820 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,820 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,822 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,822 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,822 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,822 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,822 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,823 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,823 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,823 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,823 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,824 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,824 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,824 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,824 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,827 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,827 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,827 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,827 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,827 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,828 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,828 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,828 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,828 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,830 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,830 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,830 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,830 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,830 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,830 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,831 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,831 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,831 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,831 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,831 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,831 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,831 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,831 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,832 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,832 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,832 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,832 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,832 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,832 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,832 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,832 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,832 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,833 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,833 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,833 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,833 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,833 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,833 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,833 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,834 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,834 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,834 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,834 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,834 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,836 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,836 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,836 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,836 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,836 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,837 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,837 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,837 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,837 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,837 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,838 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,839 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,839 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,841 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,841 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,842 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,842 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,843 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 10:57:19,844 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 10:57:19,858 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-11 10:57:19,873 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 10:57:19,873 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 10:57:19,873 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 10:57:19,873 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 10:57:19,874 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 10:57:19,874 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 10:57:19,874 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 10:57:19,874 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 10:57:19,884 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 10:57:19,893 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 120 transitions, 260 flow [2021-03-11 10:57:19,895 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 120 transitions, 260 flow [2021-03-11 10:57:19,897 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 131 places, 120 transitions, 260 flow [2021-03-11 10:57:19,941 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2021-03-11 10:57:19,941 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 10:57:19,948 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-11 10:57:19,954 INFO L116 LiptonReduction]: Number of co-enabled transitions 2878 [2021-03-11 10:57:21,205 WARN L205 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 232 DAG size of output: 191 [2021-03-11 10:57:21,475 WARN L205 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-11 10:57:22,740 WARN L205 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 316 DAG size of output: 272 [2021-03-11 10:57:23,274 WARN L205 SmtUtils]: Spent 531.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-11 10:57:24,301 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-11 10:57:24,662 WARN L205 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-11 10:57:24,765 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-11 10:57:25,070 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-11 10:57:25,186 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-11 10:57:27,001 WARN L205 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 192 [2021-03-11 10:57:27,267 WARN L205 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 192 [2021-03-11 10:57:28,377 WARN L205 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 272 DAG size of output: 271 [2021-03-11 10:57:28,911 WARN L205 SmtUtils]: Spent 532.00 ms on a formula simplification that was a NOOP. DAG size: 271 [2021-03-11 10:57:29,185 WARN L205 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 200 [2021-03-11 10:57:29,471 WARN L205 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 200 [2021-03-11 10:57:30,669 WARN L205 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 286 DAG size of output: 284 [2021-03-11 10:57:31,293 WARN L205 SmtUtils]: Spent 622.00 ms on a formula simplification that was a NOOP. DAG size: 283 [2021-03-11 10:57:32,641 WARN L205 SmtUtils]: Spent 542.00 ms on a formula simplification that was a NOOP. DAG size: 210 [2021-03-11 10:57:33,160 WARN L205 SmtUtils]: Spent 517.00 ms on a formula simplification that was a NOOP. DAG size: 208 [2021-03-11 10:57:34,224 WARN L205 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 293 [2021-03-11 10:57:35,229 WARN L205 SmtUtils]: Spent 1.00 s on a formula simplification that was a NOOP. DAG size: 291 [2021-03-11 10:57:35,968 WARN L205 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-11 10:57:36,147 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-11 10:57:36,463 WARN L205 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-11 10:57:36,615 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-11 10:57:36,621 INFO L131 LiptonReduction]: Checked pairs total: 8840 [2021-03-11 10:57:36,622 INFO L133 LiptonReduction]: Total number of compositions: 94 [2021-03-11 10:57:36,637 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 48 places, 35 transitions, 90 flow [2021-03-11 10:57:36,958 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5832 states, 5828 states have (on average 4.043582704186685) internal successors, (23566), 5831 states have internal predecessors, (23566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:36,980 INFO L276 IsEmpty]: Start isEmpty. Operand has 5832 states, 5828 states have (on average 4.043582704186685) internal successors, (23566), 5831 states have internal predecessors, (23566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:36,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-03-11 10:57:36,984 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 10:57:36,985 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-03-11 10:57:36,986 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 10:57:36,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 10:57:36,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1170890927, now seen corresponding path program 1 times [2021-03-11 10:57:36,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 10:57:36,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67208785] [2021-03-11 10:57:36,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 10:57:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 10:57:37,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:37,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 10:57:37,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-03-11 10:57:37,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67208785] [2021-03-11 10:57:37,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 10:57:37,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 10:57:37,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995019111] [2021-03-11 10:57:37,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 10:57:37,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 10:57:37,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 10:57:37,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 10:57:37,284 INFO L87 Difference]: Start difference. First operand has 5832 states, 5828 states have (on average 4.043582704186685) internal successors, (23566), 5831 states have internal predecessors, (23566), 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 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:37,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 10:57:37,408 INFO L93 Difference]: Finished difference Result 4862 states and 19480 transitions. [2021-03-11 10:57:37,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 10:57:37,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2021-03-11 10:57:37,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 10:57:37,451 INFO L225 Difference]: With dead ends: 4862 [2021-03-11 10:57:37,452 INFO L226 Difference]: Without dead ends: 3962 [2021-03-11 10:57:37,453 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 10:57:37,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3962 states. [2021-03-11 10:57:37,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3962 to 3962. [2021-03-11 10:57:37,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3962 states, 3961 states have (on average 3.948497854077253) internal successors, (15640), 3961 states have internal predecessors, (15640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:37,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3962 states to 3962 states and 15640 transitions. [2021-03-11 10:57:37,639 INFO L78 Accepts]: Start accepts. Automaton has 3962 states and 15640 transitions. Word has length 5 [2021-03-11 10:57:37,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 10:57:37,639 INFO L480 AbstractCegarLoop]: Abstraction has 3962 states and 15640 transitions. [2021-03-11 10:57:37,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:37,640 INFO L276 IsEmpty]: Start isEmpty. Operand 3962 states and 15640 transitions. [2021-03-11 10:57:37,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-03-11 10:57:37,642 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 10:57:37,642 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 10:57:37,642 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 10:57:37,642 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 10:57:37,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 10:57:37,643 INFO L82 PathProgramCache]: Analyzing trace with hash -960400140, now seen corresponding path program 1 times [2021-03-11 10:57:37,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 10:57:37,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351907356] [2021-03-11 10:57:37,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 10:57:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 10:57:37,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:37,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 10:57:37,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 10:57:37,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351907356] [2021-03-11 10:57:37,790 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 10:57:37,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 10:57:37,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167888552] [2021-03-11 10:57:37,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 10:57:37,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 10:57:37,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 10:57:37,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 10:57:37,792 INFO L87 Difference]: Start difference. First operand 3962 states and 15640 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:37,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 10:57:37,847 INFO L93 Difference]: Finished difference Result 3662 states and 14310 transitions. [2021-03-11 10:57:37,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 10:57:37,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2021-03-11 10:57:37,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 10:57:37,876 INFO L225 Difference]: With dead ends: 3662 [2021-03-11 10:57:37,876 INFO L226 Difference]: Without dead ends: 3662 [2021-03-11 10:57:37,876 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 10:57:37,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3662 states. [2021-03-11 10:57:38,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3662 to 3662. [2021-03-11 10:57:38,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3662 states, 3661 states have (on average 3.9087680961485933) internal successors, (14310), 3661 states have internal predecessors, (14310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:38,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3662 states to 3662 states and 14310 transitions. [2021-03-11 10:57:38,080 INFO L78 Accepts]: Start accepts. Automaton has 3662 states and 14310 transitions. Word has length 11 [2021-03-11 10:57:38,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 10:57:38,081 INFO L480 AbstractCegarLoop]: Abstraction has 3662 states and 14310 transitions. [2021-03-11 10:57:38,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:38,082 INFO L276 IsEmpty]: Start isEmpty. Operand 3662 states and 14310 transitions. [2021-03-11 10:57:38,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-03-11 10:57:38,088 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 10:57:38,088 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 10:57:38,088 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 10:57:38,089 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 10:57:38,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 10:57:38,089 INFO L82 PathProgramCache]: Analyzing trace with hash 429983026, now seen corresponding path program 1 times [2021-03-11 10:57:38,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 10:57:38,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886751982] [2021-03-11 10:57:38,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 10:57:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 10:57:38,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:38,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 10:57:38,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 10:57:38,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886751982] [2021-03-11 10:57:38,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 10:57:38,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 10:57:38,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227669475] [2021-03-11 10:57:38,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 10:57:38,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 10:57:38,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 10:57:38,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 10:57:38,211 INFO L87 Difference]: Start difference. First operand 3662 states and 14310 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:38,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 10:57:38,255 INFO L93 Difference]: Finished difference Result 3462 states and 13440 transitions. [2021-03-11 10:57:38,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 10:57:38,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 13 [2021-03-11 10:57:38,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 10:57:38,278 INFO L225 Difference]: With dead ends: 3462 [2021-03-11 10:57:38,278 INFO L226 Difference]: Without dead ends: 3462 [2021-03-11 10:57:38,278 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 10:57:38,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3462 states. [2021-03-11 10:57:38,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3462 to 3462. [2021-03-11 10:57:38,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3462 states, 3461 states have (on average 3.8832707310026002) internal successors, (13440), 3461 states have internal predecessors, (13440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:38,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3462 states to 3462 states and 13440 transitions. [2021-03-11 10:57:38,387 INFO L78 Accepts]: Start accepts. Automaton has 3462 states and 13440 transitions. Word has length 13 [2021-03-11 10:57:38,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 10:57:38,388 INFO L480 AbstractCegarLoop]: Abstraction has 3462 states and 13440 transitions. [2021-03-11 10:57:38,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:38,388 INFO L276 IsEmpty]: Start isEmpty. Operand 3462 states and 13440 transitions. [2021-03-11 10:57:38,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-03-11 10:57:38,391 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 10:57:38,391 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 10:57:38,391 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 10:57:38,391 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 10:57:38,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 10:57:38,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1119880757, now seen corresponding path program 1 times [2021-03-11 10:57:38,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 10:57:38,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404004200] [2021-03-11 10:57:38,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 10:57:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 10:57:38,533 INFO L142 QuantifierPusher]: treesize reduction 18, result has 47.1 percent of original size [2021-03-11 10:57:38,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 10:57:38,542 INFO L142 QuantifierPusher]: treesize reduction 18, result has 41.9 percent of original size [2021-03-11 10:57:38,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 10:57:38,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 10:57:38,553 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404004200] [2021-03-11 10:57:38,553 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 10:57:38,553 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 10:57:38,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041097423] [2021-03-11 10:57:38,553 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 10:57:38,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 10:57:38,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 10:57:38,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-11 10:57:38,554 INFO L87 Difference]: Start difference. First operand 3462 states and 13440 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:38,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 10:57:38,623 INFO L93 Difference]: Finished difference Result 3430 states and 13296 transitions. [2021-03-11 10:57:38,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 10:57:38,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2021-03-11 10:57:38,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 10:57:38,661 INFO L225 Difference]: With dead ends: 3430 [2021-03-11 10:57:38,661 INFO L226 Difference]: Without dead ends: 3430 [2021-03-11 10:57:38,662 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.8ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-11 10:57:38,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3430 states. [2021-03-11 10:57:38,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3430 to 3430. [2021-03-11 10:57:38,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3430 states, 3429 states have (on average 3.8775153105861766) internal successors, (13296), 3429 states have internal predecessors, (13296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:38,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3430 states to 3430 states and 13296 transitions. [2021-03-11 10:57:38,765 INFO L78 Accepts]: Start accepts. Automaton has 3430 states and 13296 transitions. Word has length 15 [2021-03-11 10:57:38,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 10:57:38,765 INFO L480 AbstractCegarLoop]: Abstraction has 3430 states and 13296 transitions. [2021-03-11 10:57:38,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:38,765 INFO L276 IsEmpty]: Start isEmpty. Operand 3430 states and 13296 transitions. [2021-03-11 10:57:38,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-03-11 10:57:38,769 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 10:57:38,769 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 10:57:38,770 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 10:57:38,770 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 10:57:38,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 10:57:38,770 INFO L82 PathProgramCache]: Analyzing trace with hash -582629611, now seen corresponding path program 1 times [2021-03-11 10:57:38,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 10:57:38,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592863777] [2021-03-11 10:57:38,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 10:57:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 10:57:38,831 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:38,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-11 10:57:38,847 INFO L142 QuantifierPusher]: treesize reduction 10, result has 84.8 percent of original size [2021-03-11 10:57:38,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 56 [2021-03-11 10:57:38,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:38,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 10:57:38,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 10:57:38,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592863777] [2021-03-11 10:57:38,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 10:57:38,877 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 10:57:38,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202236804] [2021-03-11 10:57:38,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 10:57:38,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 10:57:38,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 10:57:38,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 10:57:38,878 INFO L87 Difference]: Start difference. First operand 3430 states and 13296 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:38,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 10:57:38,969 INFO L93 Difference]: Finished difference Result 3670 states and 14248 transitions. [2021-03-11 10:57:38,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 10:57:38,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2021-03-11 10:57:38,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 10:57:38,985 INFO L225 Difference]: With dead ends: 3670 [2021-03-11 10:57:38,985 INFO L226 Difference]: Without dead ends: 3670 [2021-03-11 10:57:38,985 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 46.5ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-11 10:57:39,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3670 states. [2021-03-11 10:57:39,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3670 to 3670. [2021-03-11 10:57:39,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3670 states, 3669 states have (on average 3.8833469610248024) internal successors, (14248), 3669 states have internal predecessors, (14248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:39,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3670 states to 3670 states and 14248 transitions. [2021-03-11 10:57:39,101 INFO L78 Accepts]: Start accepts. Automaton has 3670 states and 14248 transitions. Word has length 16 [2021-03-11 10:57:39,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 10:57:39,102 INFO L480 AbstractCegarLoop]: Abstraction has 3670 states and 14248 transitions. [2021-03-11 10:57:39,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:39,102 INFO L276 IsEmpty]: Start isEmpty. Operand 3670 states and 14248 transitions. [2021-03-11 10:57:39,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-03-11 10:57:39,108 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 10:57:39,109 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 10:57:39,109 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 10:57:39,109 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 10:57:39,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 10:57:39,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1943201772, now seen corresponding path program 1 times [2021-03-11 10:57:39,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 10:57:39,110 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976144091] [2021-03-11 10:57:39,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 10:57:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 10:57:39,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:39,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 10:57:39,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:39,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 10:57:39,209 INFO L142 QuantifierPusher]: treesize reduction 4, result has 66.7 percent of original size [2021-03-11 10:57:39,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-11 10:57:39,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 10:57:39,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976144091] [2021-03-11 10:57:39,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 10:57:39,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 10:57:39,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414814022] [2021-03-11 10:57:39,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 10:57:39,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 10:57:39,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 10:57:39,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-11 10:57:39,217 INFO L87 Difference]: Start difference. First operand 3670 states and 14248 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:39,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 10:57:39,327 INFO L93 Difference]: Finished difference Result 3702 states and 14370 transitions. [2021-03-11 10:57:39,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 10:57:39,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2021-03-11 10:57:39,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 10:57:39,430 INFO L225 Difference]: With dead ends: 3702 [2021-03-11 10:57:39,430 INFO L226 Difference]: Without dead ends: 3702 [2021-03-11 10:57:39,431 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 25.0ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-03-11 10:57:39,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3702 states. [2021-03-11 10:57:39,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3702 to 3622. [2021-03-11 10:57:39,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3622 states, 3621 states have (on average 3.87959127312897) internal successors, (14048), 3621 states have internal predecessors, (14048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:39,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3622 states to 3622 states and 14048 transitions. [2021-03-11 10:57:39,543 INFO L78 Accepts]: Start accepts. Automaton has 3622 states and 14048 transitions. Word has length 17 [2021-03-11 10:57:39,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 10:57:39,543 INFO L480 AbstractCegarLoop]: Abstraction has 3622 states and 14048 transitions. [2021-03-11 10:57:39,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:39,543 INFO L276 IsEmpty]: Start isEmpty. Operand 3622 states and 14048 transitions. [2021-03-11 10:57:39,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-03-11 10:57:39,549 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 10:57:39,549 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 10:57:39,550 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 10:57:39,550 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 10:57:39,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 10:57:39,550 INFO L82 PathProgramCache]: Analyzing trace with hash 356944242, now seen corresponding path program 1 times [2021-03-11 10:57:39,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 10:57:39,552 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401197832] [2021-03-11 10:57:39,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 10:57:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 10:57:39,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:39,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 10:57:39,652 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-03-11 10:57:39,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-11 10:57:39,671 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-11 10:57:39,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-11 10:57:39,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:39,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 10:57:39,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 10:57:39,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401197832] [2021-03-11 10:57:39,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 10:57:39,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 10:57:39,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913539855] [2021-03-11 10:57:39,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 10:57:39,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 10:57:39,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 10:57:39,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-11 10:57:39,702 INFO L87 Difference]: Start difference. First operand 3622 states and 14048 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:39,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 10:57:39,857 INFO L93 Difference]: Finished difference Result 4530 states and 17454 transitions. [2021-03-11 10:57:39,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 10:57:39,859 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2021-03-11 10:57:39,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 10:57:39,876 INFO L225 Difference]: With dead ends: 4530 [2021-03-11 10:57:39,876 INFO L226 Difference]: Without dead ends: 4530 [2021-03-11 10:57:39,877 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 62.5ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-03-11 10:57:39,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4530 states. [2021-03-11 10:57:39,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4530 to 4474. [2021-03-11 10:57:40,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4474 states, 4473 states have (on average 3.8627319472389896) internal successors, (17278), 4473 states have internal predecessors, (17278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:40,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4474 states to 4474 states and 17278 transitions. [2021-03-11 10:57:40,019 INFO L78 Accepts]: Start accepts. Automaton has 4474 states and 17278 transitions. Word has length 18 [2021-03-11 10:57:40,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 10:57:40,019 INFO L480 AbstractCegarLoop]: Abstraction has 4474 states and 17278 transitions. [2021-03-11 10:57:40,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:40,019 INFO L276 IsEmpty]: Start isEmpty. Operand 4474 states and 17278 transitions. [2021-03-11 10:57:40,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-03-11 10:57:40,026 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 10:57:40,027 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 10:57:40,027 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 10:57:40,027 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 10:57:40,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 10:57:40,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1490800948, now seen corresponding path program 1 times [2021-03-11 10:57:40,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 10:57:40,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251259852] [2021-03-11 10:57:40,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 10:57:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 10:57:40,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:40,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 10:57:40,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:40,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 10:57:40,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:40,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 10:57:40,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 10:57:40,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251259852] [2021-03-11 10:57:40,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 10:57:40,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 10:57:40,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955339650] [2021-03-11 10:57:40,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 10:57:40,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 10:57:40,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 10:57:40,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 10:57:40,097 INFO L87 Difference]: Start difference. First operand 4474 states and 17278 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:40,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 10:57:40,148 INFO L93 Difference]: Finished difference Result 4568 states and 16129 transitions. [2021-03-11 10:57:40,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 10:57:40,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2021-03-11 10:57:40,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 10:57:40,159 INFO L225 Difference]: With dead ends: 4568 [2021-03-11 10:57:40,160 INFO L226 Difference]: Without dead ends: 3332 [2021-03-11 10:57:40,160 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-11 10:57:40,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3332 states. [2021-03-11 10:57:40,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3332 to 3332. [2021-03-11 10:57:40,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3332 states, 3331 states have (on average 3.472830981687181) internal successors, (11568), 3331 states have internal predecessors, (11568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:40,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3332 states to 3332 states and 11568 transitions. [2021-03-11 10:57:40,249 INFO L78 Accepts]: Start accepts. Automaton has 3332 states and 11568 transitions. Word has length 18 [2021-03-11 10:57:40,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 10:57:40,249 INFO L480 AbstractCegarLoop]: Abstraction has 3332 states and 11568 transitions. [2021-03-11 10:57:40,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:40,249 INFO L276 IsEmpty]: Start isEmpty. Operand 3332 states and 11568 transitions. [2021-03-11 10:57:40,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-03-11 10:57:40,255 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 10:57:40,255 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 10:57:40,255 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 10:57:40,255 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 10:57:40,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 10:57:40,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1128979678, now seen corresponding path program 1 times [2021-03-11 10:57:40,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 10:57:40,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757977629] [2021-03-11 10:57:40,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 10:57:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 10:57:40,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:40,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 10:57:40,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:40,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 10:57:40,332 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:40,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 10:57:40,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:40,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 10:57:40,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 10:57:40,340 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757977629] [2021-03-11 10:57:40,340 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 10:57:40,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 10:57:40,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91917480] [2021-03-11 10:57:40,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 10:57:40,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 10:57:40,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 10:57:40,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 10:57:40,341 INFO L87 Difference]: Start difference. First operand 3332 states and 11568 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:40,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 10:57:40,397 INFO L93 Difference]: Finished difference Result 2854 states and 9269 transitions. [2021-03-11 10:57:40,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 10:57:40,397 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2021-03-11 10:57:40,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 10:57:40,403 INFO L225 Difference]: With dead ends: 2854 [2021-03-11 10:57:40,404 INFO L226 Difference]: Without dead ends: 2147 [2021-03-11 10:57:40,404 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 16.2ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 10:57:40,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2147 states. [2021-03-11 10:57:40,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2147 to 1871. [2021-03-11 10:57:40,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1871 states, 1870 states have (on average 3.1411764705882352) internal successors, (5874), 1870 states have internal predecessors, (5874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:40,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 5874 transitions. [2021-03-11 10:57:40,455 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 5874 transitions. Word has length 19 [2021-03-11 10:57:40,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 10:57:40,456 INFO L480 AbstractCegarLoop]: Abstraction has 1871 states and 5874 transitions. [2021-03-11 10:57:40,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:40,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 5874 transitions. [2021-03-11 10:57:40,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-03-11 10:57:40,461 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 10:57:40,461 INFO L519 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] [2021-03-11 10:57:40,461 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 10:57:40,461 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 10:57:40,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 10:57:40,461 INFO L82 PathProgramCache]: Analyzing trace with hash -900962003, now seen corresponding path program 1 times [2021-03-11 10:57:40,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 10:57:40,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766359017] [2021-03-11 10:57:40,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 10:57:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 10:57:40,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:40,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 10:57:40,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:40,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 10:57:40,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:40,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 10:57:40,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:40,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 10:57:40,555 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:40,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 10:57:40,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 10:57:40,557 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766359017] [2021-03-11 10:57:40,557 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 10:57:40,557 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 10:57:40,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785422995] [2021-03-11 10:57:40,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 10:57:40,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 10:57:40,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 10:57:40,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 10:57:40,558 INFO L87 Difference]: Start difference. First operand 1871 states and 5874 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:40,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 10:57:40,612 INFO L93 Difference]: Finished difference Result 1670 states and 5226 transitions. [2021-03-11 10:57:40,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 10:57:40,613 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2021-03-11 10:57:40,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 10:57:40,618 INFO L225 Difference]: With dead ends: 1670 [2021-03-11 10:57:40,618 INFO L226 Difference]: Without dead ends: 1488 [2021-03-11 10:57:40,618 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 20.1ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-03-11 10:57:40,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2021-03-11 10:57:40,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1344. [2021-03-11 10:57:40,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 1343 states have (on average 3.1965748324646315) internal successors, (4293), 1343 states have internal predecessors, (4293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:40,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 4293 transitions. [2021-03-11 10:57:40,645 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 4293 transitions. Word has length 22 [2021-03-11 10:57:40,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 10:57:40,645 INFO L480 AbstractCegarLoop]: Abstraction has 1344 states and 4293 transitions. [2021-03-11 10:57:40,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:40,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 4293 transitions. [2021-03-11 10:57:40,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-03-11 10:57:40,648 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 10:57:40,648 INFO L519 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] [2021-03-11 10:57:40,649 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 10:57:40,649 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 10:57:40,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 10:57:40,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1188608319, now seen corresponding path program 1 times [2021-03-11 10:57:40,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 10:57:40,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765890283] [2021-03-11 10:57:40,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 10:57:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 10:57:40,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:40,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 10:57:40,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:40,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 10:57:40,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:40,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 10:57:40,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:40,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 10:57:40,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:40,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 10:57:40,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:40,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 10:57:40,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 10:57:40,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765890283] [2021-03-11 10:57:40,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 10:57:40,779 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 10:57:40,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465829458] [2021-03-11 10:57:40,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 10:57:40,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 10:57:40,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 10:57:40,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-11 10:57:40,780 INFO L87 Difference]: Start difference. First operand 1344 states and 4293 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:40,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 10:57:40,846 INFO L93 Difference]: Finished difference Result 1311 states and 4225 transitions. [2021-03-11 10:57:40,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-11 10:57:40,847 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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 25 [2021-03-11 10:57:40,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 10:57:40,851 INFO L225 Difference]: With dead ends: 1311 [2021-03-11 10:57:40,851 INFO L226 Difference]: Without dead ends: 1289 [2021-03-11 10:57:40,851 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 27.6ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-03-11 10:57:40,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2021-03-11 10:57:40,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1265. [2021-03-11 10:57:40,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1264 states have (on average 3.261867088607595) internal successors, (4123), 1264 states have internal predecessors, (4123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:40,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 4123 transitions. [2021-03-11 10:57:40,880 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 4123 transitions. Word has length 25 [2021-03-11 10:57:40,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 10:57:40,881 INFO L480 AbstractCegarLoop]: Abstraction has 1265 states and 4123 transitions. [2021-03-11 10:57:40,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:40,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 4123 transitions. [2021-03-11 10:57:40,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-03-11 10:57:40,885 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 10:57:40,885 INFO L519 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] [2021-03-11 10:57:40,885 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-11 10:57:40,885 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 10:57:40,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 10:57:40,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1528883312, now seen corresponding path program 1 times [2021-03-11 10:57:40,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 10:57:40,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605201529] [2021-03-11 10:57:40,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 10:57:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 10:57:40,978 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:40,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 10:57:40,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:40,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 10:57:40,982 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:40,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 10:57:40,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 10:57:40,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605201529] [2021-03-11 10:57:40,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 10:57:40,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 10:57:40,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071817835] [2021-03-11 10:57:40,988 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 10:57:40,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 10:57:40,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 10:57:40,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 10:57:40,988 INFO L87 Difference]: Start difference. First operand 1265 states and 4123 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:41,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 10:57:41,012 INFO L93 Difference]: Finished difference Result 1627 states and 5223 transitions. [2021-03-11 10:57:41,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 10:57:41,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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 29 [2021-03-11 10:57:41,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 10:57:41,015 INFO L225 Difference]: With dead ends: 1627 [2021-03-11 10:57:41,015 INFO L226 Difference]: Without dead ends: 617 [2021-03-11 10:57:41,015 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-11 10:57:41,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2021-03-11 10:57:41,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2021-03-11 10:57:41,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 616 states have (on average 2.9464285714285716) internal successors, (1815), 616 states have internal predecessors, (1815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:41,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 1815 transitions. [2021-03-11 10:57:41,028 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 1815 transitions. Word has length 29 [2021-03-11 10:57:41,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 10:57:41,028 INFO L480 AbstractCegarLoop]: Abstraction has 617 states and 1815 transitions. [2021-03-11 10:57:41,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:41,028 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 1815 transitions. [2021-03-11 10:57:41,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-03-11 10:57:41,031 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 10:57:41,031 INFO L519 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] [2021-03-11 10:57:41,031 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-11 10:57:41,032 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 10:57:41,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 10:57:41,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1440728728, now seen corresponding path program 2 times [2021-03-11 10:57:41,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 10:57:41,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795451335] [2021-03-11 10:57:41,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 10:57:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 10:57:41,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:41,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 10:57:41,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:41,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 10:57:41,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:41,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-11 10:57:41,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:41,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 10:57:41,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:41,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 10:57:41,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:41,211 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 10:57:41,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 10:57:41,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795451335] [2021-03-11 10:57:41,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 10:57:41,212 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 10:57:41,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011416049] [2021-03-11 10:57:41,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 10:57:41,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 10:57:41,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 10:57:41,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-11 10:57:41,213 INFO L87 Difference]: Start difference. First operand 617 states and 1815 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:41,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 10:57:41,283 INFO L93 Difference]: Finished difference Result 835 states and 2429 transitions. [2021-03-11 10:57:41,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 10:57:41,283 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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 29 [2021-03-11 10:57:41,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 10:57:41,285 INFO L225 Difference]: With dead ends: 835 [2021-03-11 10:57:41,286 INFO L226 Difference]: Without dead ends: 713 [2021-03-11 10:57:41,286 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 49.8ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-11 10:57:41,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2021-03-11 10:57:41,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 569. [2021-03-11 10:57:41,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 568 states have (on average 2.8714788732394365) internal successors, (1631), 568 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:41,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 1631 transitions. [2021-03-11 10:57:41,297 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 1631 transitions. Word has length 29 [2021-03-11 10:57:41,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 10:57:41,297 INFO L480 AbstractCegarLoop]: Abstraction has 569 states and 1631 transitions. [2021-03-11 10:57:41,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:41,298 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 1631 transitions. [2021-03-11 10:57:41,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-03-11 10:57:41,301 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 10:57:41,301 INFO L519 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] [2021-03-11 10:57:41,301 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-11 10:57:41,301 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 10:57:41,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 10:57:41,302 INFO L82 PathProgramCache]: Analyzing trace with hash -618592600, now seen corresponding path program 3 times [2021-03-11 10:57:41,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 10:57:41,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600840765] [2021-03-11 10:57:41,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 10:57:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 10:57:41,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:41,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 10:57:41,423 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:41,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-11 10:57:41,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:41,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-11 10:57:41,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:41,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-11 10:57:41,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:41,474 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-11 10:57:41,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:41,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 10:57:41,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 10:57:41,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 10:57:41,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 10:57:41,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600840765] [2021-03-11 10:57:41,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 10:57:41,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 10:57:41,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232822371] [2021-03-11 10:57:41,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-11 10:57:41,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 10:57:41,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-11 10:57:41,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-03-11 10:57:41,528 INFO L87 Difference]: Start difference. First operand 569 states and 1631 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:41,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 10:57:41,720 INFO L93 Difference]: Finished difference Result 771 states and 2160 transitions. [2021-03-11 10:57:41,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 10:57:41,721 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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 29 [2021-03-11 10:57:41,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 10:57:41,723 INFO L225 Difference]: With dead ends: 771 [2021-03-11 10:57:41,723 INFO L226 Difference]: Without dead ends: 535 [2021-03-11 10:57:41,723 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 160.6ms TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2021-03-11 10:57:41,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2021-03-11 10:57:41,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 481. [2021-03-11 10:57:41,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 480 states have (on average 2.8854166666666665) internal successors, (1385), 480 states have internal predecessors, (1385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:41,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 1385 transitions. [2021-03-11 10:57:41,732 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 1385 transitions. Word has length 29 [2021-03-11 10:57:41,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 10:57:41,732 INFO L480 AbstractCegarLoop]: Abstraction has 481 states and 1385 transitions. [2021-03-11 10:57:41,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 10:57:41,732 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 1385 transitions. [2021-03-11 10:57:41,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-03-11 10:57:41,733 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 10:57:41,733 INFO L519 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] [2021-03-11 10:57:41,733 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-11 10:57:41,733 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 10:57:41,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 10:57:41,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1465044376, now seen corresponding path program 4 times [2021-03-11 10:57:41,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 10:57:41,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446013481] [2021-03-11 10:57:41,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 10:57:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 10:57:41,781 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 10:57:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 10:57:41,840 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 10:57:41,876 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 10:57:41,876 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 10:57:41,876 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-11 10:57:41,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 10:57:41 BasicIcfg [2021-03-11 10:57:41,992 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 10:57:41,999 INFO L168 Benchmark]: Toolchain (without parser) took 24704.73 ms. Allocated memory was 358.6 MB in the beginning and 847.2 MB in the end (delta: 488.6 MB). Free memory was 321.2 MB in the beginning and 497.3 MB in the end (delta: -176.2 MB). Peak memory consumption was 312.8 MB. Max. memory is 16.0 GB. [2021-03-11 10:57:42,000 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 358.6 MB. Free memory was 339.7 MB in the beginning and 339.7 MB in the end (delta: 69.2 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 10:57:42,000 INFO L168 Benchmark]: CACSL2BoogieTranslator took 479.39 ms. Allocated memory is still 358.6 MB. Free memory was 320.6 MB in the beginning and 317.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB. [2021-03-11 10:57:42,002 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.95 ms. Allocated memory is still 358.6 MB. Free memory was 317.9 MB in the beginning and 315.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 10:57:42,007 INFO L168 Benchmark]: Boogie Preprocessor took 40.87 ms. Allocated memory is still 358.6 MB. Free memory was 315.3 MB in the beginning and 312.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-11 10:57:42,007 INFO L168 Benchmark]: RCFGBuilder took 1900.56 ms. Allocated memory is still 358.6 MB. Free memory was 312.2 MB in the beginning and 222.9 MB in the end (delta: 89.3 MB). Peak memory consumption was 148.0 MB. Max. memory is 16.0 GB. [2021-03-11 10:57:42,007 INFO L168 Benchmark]: TraceAbstraction took 22218.16 ms. Allocated memory was 358.6 MB in the beginning and 847.2 MB in the end (delta: 488.6 MB). Free memory was 222.9 MB in the beginning and 497.3 MB in the end (delta: -274.5 MB). Peak memory consumption was 213.1 MB. Max. memory is 16.0 GB. [2021-03-11 10:57:42,009 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.12 ms. Allocated memory is still 358.6 MB. Free memory was 339.7 MB in the beginning and 339.7 MB in the end (delta: 69.2 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 479.39 ms. Allocated memory is still 358.6 MB. Free memory was 320.6 MB in the beginning and 317.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 50.95 ms. Allocated memory is still 358.6 MB. Free memory was 317.9 MB in the beginning and 315.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 40.87 ms. Allocated memory is still 358.6 MB. Free memory was 315.3 MB in the beginning and 312.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1900.56 ms. Allocated memory is still 358.6 MB. Free memory was 312.2 MB in the beginning and 222.9 MB in the end (delta: 89.3 MB). Peak memory consumption was 148.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 22218.16 ms. Allocated memory was 358.6 MB in the beginning and 847.2 MB in the end (delta: 488.6 MB). Free memory was 222.9 MB in the beginning and 497.3 MB in the end (delta: -274.5 MB). Peak memory consumption was 213.1 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16726.6ms, 131 PlacesBefore, 48 PlacesAfterwards, 120 TransitionsBefore, 35 TransitionsAfterwards, 2878 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 94 TotalNumberOfCompositions, 8840 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4347, positive: 4095, positive conditional: 0, positive unconditional: 4095, negative: 252, negative conditional: 0, negative unconditional: 252, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2083, positive: 2002, positive conditional: 0, positive unconditional: 2002, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2083, positive: 1985, positive conditional: 0, positive unconditional: 1985, negative: 98, negative conditional: 0, negative unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 98, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1321, positive: 61, positive conditional: 0, positive unconditional: 61, negative: 1261, negative conditional: 0, negative unconditional: 1261, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4347, positive: 2093, positive conditional: 0, positive unconditional: 2093, negative: 171, negative conditional: 0, negative unconditional: 171, unknown: 2083, unknown conditional: 0, unknown unconditional: 2083] , Statistics on independence cache: Total cache size (in pairs): 302, Positive cache size: 272, Positive conditional cache size: 0, Positive unconditional cache size: 272, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t145; [L859] FCALL, FORK 0 pthread_create(&t145, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t146; [L861] FCALL, FORK 0 pthread_create(&t146, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L862] 0 pthread_t t147; [L863] FCALL, FORK 0 pthread_create(&t147, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L864] 0 pthread_t t148; [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L865] FCALL, FORK 0 pthread_create(&t148, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L836] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L836] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L836] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L836] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L837] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L838] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L839] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L840] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L757] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L794] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L813] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L813] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L814] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L814] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L815] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L816] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L816] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L817] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L760] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L760] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L762] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L763] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L764] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L871] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L871] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L871] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L871] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L872] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L873] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L874] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L875] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L882] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L883] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L883] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L883] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L883] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L884] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L884] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L884] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L884] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L885] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L885] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L885] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L885] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L886] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L886] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L886] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L886] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L887] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L887] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L887] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L888] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L888] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L888] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L888] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 22005.4ms, OverallIterations: 15, TraceHistogramMax: 1, EmptinessCheckTime: 84.5ms, AutomataDifference: 1512.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 17084.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 481 SDtfs, 755 SDslu, 829 SDs, 0 SdLazy, 358 SolverSat, 167 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 517.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 454.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=5832occurred in iteration=0, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1187.3ms AutomataMinimizationTime, 14 MinimizatonAttempts, 778 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 55.4ms SsaConstructionTime, 652.6ms SatisfiabilityAnalysisTime, 1111.4ms InterpolantComputationTime, 295 NumberOfCodeBlocks, 295 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 252 ConstructedInterpolants, 0 QuantifiedInterpolants, 2259 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...