/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix047_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-04 23:58:27,869 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-04 23:58:27,871 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-04 23:58:27,909 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-04 23:58:27,910 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-04 23:58:27,913 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-04 23:58:27,915 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-04 23:58:27,920 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-04 23:58:27,921 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-04 23:58:27,926 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-04 23:58:27,927 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-04 23:58:27,928 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-04 23:58:27,928 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-04 23:58:27,930 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-04 23:58:27,931 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-04 23:58:27,932 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-04 23:58:27,934 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-04 23:58:27,935 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-04 23:58:27,937 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-04 23:58:27,942 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-04 23:58:27,943 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-04 23:58:27,944 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-04 23:58:27,945 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-04 23:58:27,947 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-04 23:58:27,953 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-04 23:58:27,953 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-04 23:58:27,953 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-04 23:58:27,955 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-04 23:58:27,955 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-04 23:58:27,956 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-04 23:58:27,956 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-04 23:58:27,957 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-04 23:58:27,958 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-04 23:58:27,959 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-04 23:58:27,959 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-04 23:58:27,960 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-04 23:58:27,960 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-04 23:58:27,960 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-04 23:58:27,961 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-04 23:58:27,961 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-04 23:58:27,962 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-04 23:58:27,963 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-06-04 23:58:27,997 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-04 23:58:27,997 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-04 23:58:27,998 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-04 23:58:27,998 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-04 23:58:28,000 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-04 23:58:28,001 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-04 23:58:28,001 INFO L138 SettingsManager]: * Use SBE=true [2021-06-04 23:58:28,001 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-04 23:58:28,001 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-04 23:58:28,001 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-04 23:58:28,002 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-04 23:58:28,002 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-04 23:58:28,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-04 23:58:28,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-04 23:58:28,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-04 23:58:28,003 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-04 23:58:28,003 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-04 23:58:28,003 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-04 23:58:28,003 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-04 23:58:28,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-04 23:58:28,004 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-04 23:58:28,004 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-04 23:58:28,004 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-04 23:58:28,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-04 23:58:28,004 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-04 23:58:28,005 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-04 23:58:28,005 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-04 23:58:28,005 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-04 23:58:28,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-04 23:58:28,005 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-04 23:58:28,005 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-04 23:58:28,005 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-06-04 23:58:28,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-04 23:58:28,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-04 23:58:28,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-04 23:58:28,330 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-04 23:58:28,330 INFO L275 PluginConnector]: CDTParser initialized [2021-06-04 23:58:28,331 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_power.opt.i [2021-06-04 23:58:28,392 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13b6a10f2/86e029443b7c4924ba332a65f1b7a534/FLAG5c08e71e2 [2021-06-04 23:58:28,918 INFO L306 CDTParser]: Found 1 translation units. [2021-06-04 23:58:28,918 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.opt.i [2021-06-04 23:58:28,938 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13b6a10f2/86e029443b7c4924ba332a65f1b7a534/FLAG5c08e71e2 [2021-06-04 23:58:29,241 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13b6a10f2/86e029443b7c4924ba332a65f1b7a534 [2021-06-04 23:58:29,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-04 23:58:29,244 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-04 23:58:29,245 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-04 23:58:29,245 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-04 23:58:29,250 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-04 23:58:29,251 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 11:58:29" (1/1) ... [2021-06-04 23:58:29,251 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c09f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:58:29, skipping insertion in model container [2021-06-04 23:58:29,252 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 11:58:29" (1/1) ... [2021-06-04 23:58:29,261 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-04 23:58:29,321 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-04 23:58:29,430 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.opt.i[950,963] [2021-06-04 23:58:29,635 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-04 23:58:29,641 INFO L203 MainTranslator]: Completed pre-run [2021-06-04 23:58:29,653 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.opt.i[950,963] [2021-06-04 23:58:29,727 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-04 23:58:29,789 INFO L208 MainTranslator]: Completed translation [2021-06-04 23:58:29,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:58:29 WrapperNode [2021-06-04 23:58:29,790 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-04 23:58:29,790 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-04 23:58:29,791 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-04 23:58:29,791 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-04 23:58:29,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:58:29" (1/1) ... [2021-06-04 23:58:29,817 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:58:29" (1/1) ... [2021-06-04 23:58:29,859 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-04 23:58:29,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-04 23:58:29,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-04 23:58:29,860 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-04 23:58:29,867 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:58:29" (1/1) ... [2021-06-04 23:58:29,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:58:29" (1/1) ... [2021-06-04 23:58:29,883 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:58:29" (1/1) ... [2021-06-04 23:58:29,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:58:29" (1/1) ... [2021-06-04 23:58:29,899 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:58:29" (1/1) ... [2021-06-04 23:58:29,902 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:58:29" (1/1) ... [2021-06-04 23:58:29,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:58:29" (1/1) ... [2021-06-04 23:58:29,921 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-04 23:58:29,922 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-04 23:58:29,922 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-04 23:58:29,922 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-04 23:58:29,923 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:58:29" (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-06-04 23:58:29,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-04 23:58:29,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-04 23:58:29,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-04 23:58:29,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-04 23:58:29,986 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-04 23:58:29,988 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-04 23:58:29,988 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-04 23:58:29,988 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-04 23:58:29,988 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-04 23:58:29,988 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-04 23:58:29,989 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-06-04 23:58:29,989 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-06-04 23:58:29,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-04 23:58:29,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-04 23:58:29,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-04 23:58:29,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-04 23:58:29,991 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-04 23:58:32,035 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-04 23:58:32,035 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-04 23:58:32,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 11:58:32 BoogieIcfgContainer [2021-06-04 23:58:32,037 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-04 23:58:32,039 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-04 23:58:32,039 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-04 23:58:32,041 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-04 23:58:32,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 11:58:29" (1/3) ... [2021-06-04 23:58:32,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54790264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 11:58:32, skipping insertion in model container [2021-06-04 23:58:32,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:58:29" (2/3) ... [2021-06-04 23:58:32,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54790264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 11:58:32, skipping insertion in model container [2021-06-04 23:58:32,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 11:58:32" (3/3) ... [2021-06-04 23:58:32,044 INFO L111 eAbstractionObserver]: Analyzing ICFG mix047_power.opt.i [2021-06-04 23:58:32,050 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-04 23:58:32,050 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-04 23:58:32,050 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-04 23:58:32,051 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-04 23:58:32,081 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,081 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,081 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,081 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,081 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,082 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,082 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,082 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,082 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,082 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,082 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,082 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,083 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,083 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,083 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,083 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,084 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,084 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,085 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,085 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,085 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,085 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,088 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,088 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,088 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,088 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,088 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,088 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,088 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,088 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,089 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,089 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,089 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,089 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,089 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,089 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,089 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,089 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,090 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,090 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,090 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,090 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,090 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,090 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,090 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,090 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,091 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,091 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,091 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,091 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,091 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,091 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,091 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,092 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,092 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,092 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,092 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,092 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,095 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,095 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,097 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,098 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,098 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,098 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,099 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,099 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,099 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,099 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,100 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,100 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,100 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,100 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,100 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,100 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,100 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,100 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,102 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,102 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:58:32,103 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-04 23:58:32,123 INFO L255 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-06-04 23:58:32,139 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-04 23:58:32,139 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-04 23:58:32,140 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-04 23:58:32,140 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-04 23:58:32,140 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-04 23:58:32,140 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-04 23:58:32,140 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-04 23:58:32,140 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-04 23:58:32,150 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 139 places, 128 transitions, 276 flow [2021-06-04 23:58:58,869 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 128228 states, 128224 states have (on average 4.5057087596705765) internal successors, (577740), 128227 states have internal predecessors, (577740), 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-06-04 23:58:59,030 INFO L276 IsEmpty]: Start isEmpty. Operand has 128228 states, 128224 states have (on average 4.5057087596705765) internal successors, (577740), 128227 states have internal predecessors, (577740), 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-06-04 23:58:59,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-06-04 23:58:59,057 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:58:59,058 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 23:58:59,059 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:58:59,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:58:59,064 INFO L82 PathProgramCache]: Analyzing trace with hash 469574097, now seen corresponding path program 1 times [2021-06-04 23:58:59,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:58:59,072 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20959279] [2021-06-04 23:58:59,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:58:59,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:58:59,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:58:59,364 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:58:59,364 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20959279] [2021-06-04 23:58:59,365 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20959279] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:58:59,366 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:58:59,366 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-04 23:58:59,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810771895] [2021-06-04 23:58:59,370 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-04 23:58:59,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:58:59,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-04 23:58:59,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-04 23:58:59,610 INFO L87 Difference]: Start difference. First operand has 128228 states, 128224 states have (on average 4.5057087596705765) internal successors, (577740), 128227 states have internal predecessors, (577740), 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 33.5) internal successors, (67), 3 states have internal predecessors, (67), 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-06-04 23:59:01,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:59:01,555 INFO L93 Difference]: Finished difference Result 112940 states and 499739 transitions. [2021-06-04 23:59:01,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-04 23:59:01,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 33.5) internal successors, (67), 3 states have internal predecessors, (67), 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 67 [2021-06-04 23:59:01,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:59:02,408 INFO L225 Difference]: With dead ends: 112940 [2021-06-04 23:59:02,408 INFO L226 Difference]: Without dead ends: 61980 [2021-06-04 23:59:02,411 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-04 23:59:02,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61980 states. [2021-06-04 23:59:05,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61980 to 61980. [2021-06-04 23:59:05,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61980 states, 61979 states have (on average 4.371884025234354) internal successors, (270965), 61979 states have internal predecessors, (270965), 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-06-04 23:59:05,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61980 states to 61980 states and 270965 transitions. [2021-06-04 23:59:05,930 INFO L78 Accepts]: Start accepts. Automaton has 61980 states and 270965 transitions. Word has length 67 [2021-06-04 23:59:05,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:59:05,932 INFO L482 AbstractCegarLoop]: Abstraction has 61980 states and 270965 transitions. [2021-06-04 23:59:05,932 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 33.5) internal successors, (67), 3 states have internal predecessors, (67), 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-06-04 23:59:05,932 INFO L276 IsEmpty]: Start isEmpty. Operand 61980 states and 270965 transitions. [2021-06-04 23:59:06,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-06-04 23:59:06,012 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:59:06,012 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 23:59:06,012 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-04 23:59:06,012 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:59:06,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:59:06,017 INFO L82 PathProgramCache]: Analyzing trace with hash -988087535, now seen corresponding path program 1 times [2021-06-04 23:59:06,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:59:06,018 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110532521] [2021-06-04 23:59:06,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:59:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:59:06,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:59:06,306 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:59:06,306 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110532521] [2021-06-04 23:59:06,306 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110532521] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:59:06,307 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:59:06,307 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-04 23:59:06,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473341050] [2021-06-04 23:59:06,309 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-04 23:59:06,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:59:06,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-04 23:59:06,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-04 23:59:06,311 INFO L87 Difference]: Start difference. First operand 61980 states and 270965 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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-06-04 23:59:07,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:59:07,212 INFO L93 Difference]: Finished difference Result 74780 states and 324165 transitions. [2021-06-04 23:59:07,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-04 23:59:07,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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 79 [2021-06-04 23:59:07,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:59:07,661 INFO L225 Difference]: With dead ends: 74780 [2021-06-04 23:59:07,661 INFO L226 Difference]: Without dead ends: 59100 [2021-06-04 23:59:07,662 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 143.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-04 23:59:08,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59100 states. [2021-06-04 23:59:09,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59100 to 59100. [2021-06-04 23:59:09,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59100 states, 59099 states have (on average 4.35223946259666) internal successors, (257213), 59099 states have internal predecessors, (257213), 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-06-04 23:59:10,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59100 states to 59100 states and 257213 transitions. [2021-06-04 23:59:10,378 INFO L78 Accepts]: Start accepts. Automaton has 59100 states and 257213 transitions. Word has length 79 [2021-06-04 23:59:10,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:59:10,379 INFO L482 AbstractCegarLoop]: Abstraction has 59100 states and 257213 transitions. [2021-06-04 23:59:10,379 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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-06-04 23:59:10,379 INFO L276 IsEmpty]: Start isEmpty. Operand 59100 states and 257213 transitions. [2021-06-04 23:59:10,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-06-04 23:59:10,431 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:59:10,432 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 23:59:10,432 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-04 23:59:10,432 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:59:10,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:59:10,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1562976368, now seen corresponding path program 1 times [2021-06-04 23:59:10,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:59:10,433 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63611276] [2021-06-04 23:59:10,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:59:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:59:10,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:59:10,562 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:59:10,563 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63611276] [2021-06-04 23:59:10,563 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63611276] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:59:10,563 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:59:10,563 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-04 23:59:10,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342876420] [2021-06-04 23:59:10,566 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-04 23:59:10,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:59:10,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-04 23:59:10,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-04 23:59:10,570 INFO L87 Difference]: Start difference. First operand 59100 states and 257213 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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-06-04 23:59:11,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:59:11,387 INFO L93 Difference]: Finished difference Result 64604 states and 278813 transitions. [2021-06-04 23:59:11,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-04 23:59:11,388 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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 81 [2021-06-04 23:59:11,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:59:11,580 INFO L225 Difference]: With dead ends: 64604 [2021-06-04 23:59:11,580 INFO L226 Difference]: Without dead ends: 50844 [2021-06-04 23:59:11,581 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 85.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-04 23:59:11,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50844 states. [2021-06-04 23:59:13,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50844 to 50844. [2021-06-04 23:59:13,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50844 states, 50843 states have (on average 4.320221072714041) internal successors, (219653), 50843 states have internal predecessors, (219653), 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-06-04 23:59:13,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50844 states to 50844 states and 219653 transitions. [2021-06-04 23:59:13,554 INFO L78 Accepts]: Start accepts. Automaton has 50844 states and 219653 transitions. Word has length 81 [2021-06-04 23:59:13,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:59:13,554 INFO L482 AbstractCegarLoop]: Abstraction has 50844 states and 219653 transitions. [2021-06-04 23:59:13,554 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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-06-04 23:59:13,554 INFO L276 IsEmpty]: Start isEmpty. Operand 50844 states and 219653 transitions. [2021-06-04 23:59:13,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-06-04 23:59:13,626 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:59:13,626 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 23:59:13,626 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-04 23:59:13,626 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:59:13,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:59:13,627 INFO L82 PathProgramCache]: Analyzing trace with hash 507070607, now seen corresponding path program 1 times [2021-06-04 23:59:13,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:59:13,627 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314907930] [2021-06-04 23:59:13,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:59:13,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:59:13,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:59:13,769 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:59:13,769 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314907930] [2021-06-04 23:59:13,769 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314907930] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:59:13,769 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:59:13,770 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-04 23:59:13,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53257321] [2021-06-04 23:59:13,770 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-04 23:59:13,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:59:13,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-04 23:59:13,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-04 23:59:13,771 INFO L87 Difference]: Start difference. First operand 50844 states and 219653 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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-06-04 23:59:14,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:59:14,599 INFO L93 Difference]: Finished difference Result 58020 states and 248949 transitions. [2021-06-04 23:59:14,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-04 23:59:14,599 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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 85 [2021-06-04 23:59:14,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:59:14,808 INFO L225 Difference]: With dead ends: 58020 [2021-06-04 23:59:14,808 INFO L226 Difference]: Without dead ends: 49764 [2021-06-04 23:59:14,809 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 87.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-04 23:59:15,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49764 states. [2021-06-04 23:59:15,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49764 to 49764. [2021-06-04 23:59:16,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49764 states, 49763 states have (on average 4.313425637521854) internal successors, (214649), 49763 states have internal predecessors, (214649), 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-06-04 23:59:16,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49764 states to 49764 states and 214649 transitions. [2021-06-04 23:59:16,574 INFO L78 Accepts]: Start accepts. Automaton has 49764 states and 214649 transitions. Word has length 85 [2021-06-04 23:59:16,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:59:16,589 INFO L482 AbstractCegarLoop]: Abstraction has 49764 states and 214649 transitions. [2021-06-04 23:59:16,589 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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-06-04 23:59:16,589 INFO L276 IsEmpty]: Start isEmpty. Operand 49764 states and 214649 transitions. [2021-06-04 23:59:16,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-04 23:59:16,724 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:59:16,724 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 23:59:16,725 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-04 23:59:16,725 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:59:16,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:59:16,725 INFO L82 PathProgramCache]: Analyzing trace with hash -841553371, now seen corresponding path program 1 times [2021-06-04 23:59:16,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:59:16,726 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594361202] [2021-06-04 23:59:16,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:59:16,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:59:16,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:59:16,830 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:59:16,830 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594361202] [2021-06-04 23:59:16,830 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594361202] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:59:16,830 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:59:16,830 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-04 23:59:16,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500119500] [2021-06-04 23:59:16,831 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-04 23:59:16,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:59:16,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-04 23:59:16,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-04 23:59:16,832 INFO L87 Difference]: Start difference. First operand 49764 states and 214649 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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-06-04 23:59:17,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:59:17,428 INFO L93 Difference]: Finished difference Result 79500 states and 337955 transitions. [2021-06-04 23:59:17,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-04 23:59:17,429 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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 86 [2021-06-04 23:59:17,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:59:17,630 INFO L225 Difference]: With dead ends: 79500 [2021-06-04 23:59:17,630 INFO L226 Difference]: Without dead ends: 53796 [2021-06-04 23:59:17,630 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 79.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-04 23:59:18,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53796 states. [2021-06-04 23:59:19,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53796 to 47748. [2021-06-04 23:59:19,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47748 states, 47747 states have (on average 4.222736507005676) internal successors, (201623), 47747 states have internal predecessors, (201623), 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-06-04 23:59:19,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47748 states to 47748 states and 201623 transitions. [2021-06-04 23:59:19,776 INFO L78 Accepts]: Start accepts. Automaton has 47748 states and 201623 transitions. Word has length 86 [2021-06-04 23:59:19,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:59:19,776 INFO L482 AbstractCegarLoop]: Abstraction has 47748 states and 201623 transitions. [2021-06-04 23:59:19,776 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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-06-04 23:59:19,776 INFO L276 IsEmpty]: Start isEmpty. Operand 47748 states and 201623 transitions. [2021-06-04 23:59:19,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-06-04 23:59:19,850 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:59:19,850 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 23:59:19,850 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-04 23:59:19,850 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:59:19,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:59:19,851 INFO L82 PathProgramCache]: Analyzing trace with hash 2022519278, now seen corresponding path program 1 times [2021-06-04 23:59:19,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:59:19,851 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070195301] [2021-06-04 23:59:19,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:59:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:59:20,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:59:20,036 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:59:20,036 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070195301] [2021-06-04 23:59:20,037 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070195301] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:59:20,037 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:59:20,037 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-04 23:59:20,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357470255] [2021-06-04 23:59:20,037 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-04 23:59:20,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:59:20,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-04 23:59:20,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-04 23:59:20,038 INFO L87 Difference]: Start difference. First operand 47748 states and 201623 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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-06-04 23:59:21,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:59:21,084 INFO L93 Difference]: Finished difference Result 56292 states and 237151 transitions. [2021-06-04 23:59:21,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-04 23:59:21,084 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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 87 [2021-06-04 23:59:21,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:59:21,278 INFO L225 Difference]: With dead ends: 56292 [2021-06-04 23:59:21,279 INFO L226 Difference]: Without dead ends: 50100 [2021-06-04 23:59:21,279 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 279.3ms TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2021-06-04 23:59:21,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50100 states. [2021-06-04 23:59:22,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50100 to 50100. [2021-06-04 23:59:22,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50100 states, 50099 states have (on average 4.224575340825166) internal successors, (211647), 50099 states have internal predecessors, (211647), 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-06-04 23:59:22,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50100 states to 50100 states and 211647 transitions. [2021-06-04 23:59:22,906 INFO L78 Accepts]: Start accepts. Automaton has 50100 states and 211647 transitions. Word has length 87 [2021-06-04 23:59:22,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:59:22,906 INFO L482 AbstractCegarLoop]: Abstraction has 50100 states and 211647 transitions. [2021-06-04 23:59:22,906 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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-06-04 23:59:22,907 INFO L276 IsEmpty]: Start isEmpty. Operand 50100 states and 211647 transitions. [2021-06-04 23:59:22,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-06-04 23:59:22,987 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:59:22,987 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 23:59:22,987 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-04 23:59:22,987 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:59:22,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:59:22,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1321544502, now seen corresponding path program 2 times [2021-06-04 23:59:22,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:59:22,988 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063377528] [2021-06-04 23:59:22,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:59:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:59:23,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:59:23,191 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:59:23,191 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063377528] [2021-06-04 23:59:23,191 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063377528] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:59:23,191 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:59:23,191 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-04 23:59:23,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321020319] [2021-06-04 23:59:23,192 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-04 23:59:23,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:59:23,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-04 23:59:23,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-04 23:59:23,193 INFO L87 Difference]: Start difference. First operand 50100 states and 211647 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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-06-04 23:59:24,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:59:24,174 INFO L93 Difference]: Finished difference Result 55776 states and 234653 transitions. [2021-06-04 23:59:24,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-04 23:59:24,174 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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 87 [2021-06-04 23:59:24,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:59:24,370 INFO L225 Difference]: With dead ends: 55776 [2021-06-04 23:59:24,370 INFO L226 Difference]: Without dead ends: 49584 [2021-06-04 23:59:24,370 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 122.7ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-06-04 23:59:24,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49584 states. [2021-06-04 23:59:25,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49584 to 49584. [2021-06-04 23:59:25,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49584 states, 49583 states have (on average 4.219893915253212) internal successors, (209235), 49583 states have internal predecessors, (209235), 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-06-04 23:59:25,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49584 states to 49584 states and 209235 transitions. [2021-06-04 23:59:25,922 INFO L78 Accepts]: Start accepts. Automaton has 49584 states and 209235 transitions. Word has length 87 [2021-06-04 23:59:25,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:59:25,923 INFO L482 AbstractCegarLoop]: Abstraction has 49584 states and 209235 transitions. [2021-06-04 23:59:25,923 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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-06-04 23:59:25,923 INFO L276 IsEmpty]: Start isEmpty. Operand 49584 states and 209235 transitions. [2021-06-04 23:59:25,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-06-04 23:59:25,994 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:59:25,994 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 23:59:25,994 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-04 23:59:25,994 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:59:25,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:59:25,995 INFO L82 PathProgramCache]: Analyzing trace with hash 55619806, now seen corresponding path program 1 times [2021-06-04 23:59:25,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:59:25,995 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567481579] [2021-06-04 23:59:25,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:59:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:59:26,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:59:26,203 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:59:26,203 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567481579] [2021-06-04 23:59:26,204 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567481579] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:59:26,204 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:59:26,204 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-04 23:59:26,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385217376] [2021-06-04 23:59:26,204 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-04 23:59:26,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:59:26,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-04 23:59:26,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-04 23:59:26,205 INFO L87 Difference]: Start difference. First operand 49584 states and 209235 transitions. Second operand has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 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-06-04 23:59:27,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:59:27,214 INFO L93 Difference]: Finished difference Result 55038 states and 231309 transitions. [2021-06-04 23:59:27,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-04 23:59:27,217 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 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 88 [2021-06-04 23:59:27,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:59:27,402 INFO L225 Difference]: With dead ends: 55038 [2021-06-04 23:59:27,403 INFO L226 Difference]: Without dead ends: 49878 [2021-06-04 23:59:27,403 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 188.6ms TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-06-04 23:59:27,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49878 states. [2021-06-04 23:59:28,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49878 to 48114. [2021-06-04 23:59:28,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48114 states, 48113 states have (on average 4.207116579718579) internal successors, (202417), 48113 states have internal predecessors, (202417), 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-06-04 23:59:28,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48114 states to 48114 states and 202417 transitions. [2021-06-04 23:59:28,869 INFO L78 Accepts]: Start accepts. Automaton has 48114 states and 202417 transitions. Word has length 88 [2021-06-04 23:59:28,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:59:28,870 INFO L482 AbstractCegarLoop]: Abstraction has 48114 states and 202417 transitions. [2021-06-04 23:59:28,870 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 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-06-04 23:59:28,870 INFO L276 IsEmpty]: Start isEmpty. Operand 48114 states and 202417 transitions. [2021-06-04 23:59:28,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-06-04 23:59:28,943 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:59:28,943 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 23:59:28,944 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-04 23:59:28,944 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:59:28,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:59:28,944 INFO L82 PathProgramCache]: Analyzing trace with hash -645354970, now seen corresponding path program 2 times [2021-06-04 23:59:28,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:59:28,944 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535819659] [2021-06-04 23:59:28,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:59:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:59:29,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:59:29,150 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:59:29,150 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535819659] [2021-06-04 23:59:29,150 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535819659] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:59:29,150 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:59:29,150 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-04 23:59:29,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867147401] [2021-06-04 23:59:29,151 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-04 23:59:29,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:59:29,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-04 23:59:29,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-06-04 23:59:29,152 INFO L87 Difference]: Start difference. First operand 48114 states and 202417 transitions. Second operand has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 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-06-04 23:59:29,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:59:29,805 INFO L93 Difference]: Finished difference Result 55234 states and 232009 transitions. [2021-06-04 23:59:29,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-04 23:59:29,806 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 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 88 [2021-06-04 23:59:29,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:59:30,491 INFO L225 Difference]: With dead ends: 55234 [2021-06-04 23:59:30,491 INFO L226 Difference]: Without dead ends: 50074 [2021-06-04 23:59:30,492 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 264.5ms TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2021-06-04 23:59:30,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50074 states. [2021-06-04 23:59:31,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50074 to 48016. [2021-06-04 23:59:31,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48016 states, 48015 states have (on average 4.208414037280017) internal successors, (202067), 48015 states have internal predecessors, (202067), 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-06-04 23:59:31,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48016 states to 48016 states and 202067 transitions. [2021-06-04 23:59:31,964 INFO L78 Accepts]: Start accepts. Automaton has 48016 states and 202067 transitions. Word has length 88 [2021-06-04 23:59:31,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:59:31,964 INFO L482 AbstractCegarLoop]: Abstraction has 48016 states and 202067 transitions. [2021-06-04 23:59:31,964 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 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-06-04 23:59:31,964 INFO L276 IsEmpty]: Start isEmpty. Operand 48016 states and 202067 transitions. [2021-06-04 23:59:32,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-06-04 23:59:32,041 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:59:32,041 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 23:59:32,041 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-04 23:59:32,041 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:59:32,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:59:32,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1483110932, now seen corresponding path program 3 times [2021-06-04 23:59:32,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:59:32,042 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706202999] [2021-06-04 23:59:32,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:59:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:59:32,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:59:32,249 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:59:32,249 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706202999] [2021-06-04 23:59:32,249 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706202999] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:59:32,249 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:59:32,249 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-04 23:59:32,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889164540] [2021-06-04 23:59:32,250 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-04 23:59:32,250 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:59:32,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-04 23:59:32,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-06-04 23:59:32,250 INFO L87 Difference]: Start difference. First operand 48016 states and 202067 transitions. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 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-06-04 23:59:32,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:59:32,931 INFO L93 Difference]: Finished difference Result 64576 states and 271340 transitions. [2021-06-04 23:59:32,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-04 23:59:32,932 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 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 88 [2021-06-04 23:59:32,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:59:33,593 INFO L225 Difference]: With dead ends: 64576 [2021-06-04 23:59:33,593 INFO L226 Difference]: Without dead ends: 57352 [2021-06-04 23:59:33,596 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 334.6ms TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2021-06-04 23:59:33,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57352 states. [2021-06-04 23:59:34,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57352 to 55536. [2021-06-04 23:59:35,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55536 states, 55535 states have (on average 4.212370577113532) internal successors, (233934), 55535 states have internal predecessors, (233934), 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-06-04 23:59:35,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55536 states to 55536 states and 233934 transitions. [2021-06-04 23:59:35,279 INFO L78 Accepts]: Start accepts. Automaton has 55536 states and 233934 transitions. Word has length 88 [2021-06-04 23:59:35,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:59:35,279 INFO L482 AbstractCegarLoop]: Abstraction has 55536 states and 233934 transitions. [2021-06-04 23:59:35,279 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 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-06-04 23:59:35,279 INFO L276 IsEmpty]: Start isEmpty. Operand 55536 states and 233934 transitions. [2021-06-04 23:59:35,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-04 23:59:35,377 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:59:35,377 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 23:59:35,377 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-04 23:59:35,377 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:59:35,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:59:35,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1936525839, now seen corresponding path program 1 times [2021-06-04 23:59:35,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:59:35,378 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399485792] [2021-06-04 23:59:35,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:59:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:59:35,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:59:35,617 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:59:35,617 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399485792] [2021-06-04 23:59:35,617 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399485792] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:59:35,619 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:59:35,619 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-04 23:59:35,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838289979] [2021-06-04 23:59:35,619 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-04 23:59:35,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:59:35,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-04 23:59:35,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-06-04 23:59:35,621 INFO L87 Difference]: Start difference. First operand 55536 states and 233934 transitions. Second operand has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 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-06-04 23:59:36,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:59:36,700 INFO L93 Difference]: Finished difference Result 68582 states and 288748 transitions. [2021-06-04 23:59:36,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-04 23:59:36,717 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 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 89 [2021-06-04 23:59:36,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:59:36,988 INFO L225 Difference]: With dead ends: 68582 [2021-06-04 23:59:36,988 INFO L226 Difference]: Without dead ends: 64454 [2021-06-04 23:59:36,989 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 192.4ms TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2021-06-04 23:59:37,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64454 states. [2021-06-04 23:59:38,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64454 to 57398. [2021-06-04 23:59:38,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57398 states, 57397 states have (on average 4.218896458003032) internal successors, (242152), 57397 states have internal predecessors, (242152), 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-06-04 23:59:38,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57398 states to 57398 states and 242152 transitions. [2021-06-04 23:59:38,675 INFO L78 Accepts]: Start accepts. Automaton has 57398 states and 242152 transitions. Word has length 89 [2021-06-04 23:59:38,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:59:38,675 INFO L482 AbstractCegarLoop]: Abstraction has 57398 states and 242152 transitions. [2021-06-04 23:59:38,675 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 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-06-04 23:59:38,675 INFO L276 IsEmpty]: Start isEmpty. Operand 57398 states and 242152 transitions. [2021-06-04 23:59:38,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-04 23:59:38,766 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:59:38,766 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 23:59:38,766 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-04 23:59:38,767 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:59:38,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:59:38,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1168685019, now seen corresponding path program 2 times [2021-06-04 23:59:38,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:59:38,767 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453473777] [2021-06-04 23:59:38,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:59:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:59:38,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:59:38,985 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:59:38,985 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453473777] [2021-06-04 23:59:38,985 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453473777] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:59:38,985 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:59:38,985 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-04 23:59:38,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060616691] [2021-06-04 23:59:38,986 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-04 23:59:38,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:59:38,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-04 23:59:38,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-06-04 23:59:38,986 INFO L87 Difference]: Start difference. First operand 57398 states and 242152 transitions. Second operand has 13 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 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-06-04 23:59:39,963 WARN L205 SmtUtils]: Spent 456.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2021-06-04 23:59:40,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:59:40,127 INFO L93 Difference]: Finished difference Result 62506 states and 262344 transitions. [2021-06-04 23:59:40,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-04 23:59:40,128 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 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 89 [2021-06-04 23:59:40,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:59:40,346 INFO L225 Difference]: With dead ends: 62506 [2021-06-04 23:59:40,346 INFO L226 Difference]: Without dead ends: 58378 [2021-06-04 23:59:40,346 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 760.3ms TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2021-06-04 23:59:40,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58378 states. [2021-06-04 23:59:41,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58378 to 57300. [2021-06-04 23:59:41,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57300 states, 57299 states have (on average 4.220003839508543) internal successors, (241802), 57299 states have internal predecessors, (241802), 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-06-04 23:59:42,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57300 states to 57300 states and 241802 transitions. [2021-06-04 23:59:42,040 INFO L78 Accepts]: Start accepts. Automaton has 57300 states and 241802 transitions. Word has length 89 [2021-06-04 23:59:42,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:59:42,040 INFO L482 AbstractCegarLoop]: Abstraction has 57300 states and 241802 transitions. [2021-06-04 23:59:42,040 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 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-06-04 23:59:42,041 INFO L276 IsEmpty]: Start isEmpty. Operand 57300 states and 241802 transitions. [2021-06-04 23:59:42,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-04 23:59:42,127 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:59:42,127 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 23:59:42,127 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-04 23:59:42,127 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:59:42,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:59:42,128 INFO L82 PathProgramCache]: Analyzing trace with hash -371300851, now seen corresponding path program 3 times [2021-06-04 23:59:42,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:59:42,128 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998285332] [2021-06-04 23:59:42,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:59:42,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:59:42,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:59:42,351 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:59:42,351 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998285332] [2021-06-04 23:59:42,351 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998285332] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:59:42,351 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:59:42,351 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-04 23:59:42,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071483235] [2021-06-04 23:59:42,352 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-04 23:59:42,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:59:42,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-04 23:59:42,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-06-04 23:59:42,353 INFO L87 Difference]: Start difference. First operand 57300 states and 241802 transitions. Second operand has 13 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 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-06-04 23:59:43,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:59:43,711 INFO L93 Difference]: Finished difference Result 74332 states and 309928 transitions. [2021-06-04 23:59:43,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-04 23:59:43,711 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 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 89 [2021-06-04 23:59:43,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:59:43,920 INFO L225 Difference]: With dead ends: 74332 [2021-06-04 23:59:43,921 INFO L226 Difference]: Without dead ends: 58632 [2021-06-04 23:59:43,921 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 271.7ms TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2021-06-04 23:59:44,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58632 states. [2021-06-04 23:59:45,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58632 to 44652. [2021-06-04 23:59:45,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44652 states, 44651 states have (on average 4.163467783476294) internal successors, (185903), 44651 states have internal predecessors, (185903), 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-06-04 23:59:45,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44652 states to 44652 states and 185903 transitions. [2021-06-04 23:59:45,488 INFO L78 Accepts]: Start accepts. Automaton has 44652 states and 185903 transitions. Word has length 89 [2021-06-04 23:59:45,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:59:45,489 INFO L482 AbstractCegarLoop]: Abstraction has 44652 states and 185903 transitions. [2021-06-04 23:59:45,489 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 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-06-04 23:59:45,489 INFO L276 IsEmpty]: Start isEmpty. Operand 44652 states and 185903 transitions. [2021-06-04 23:59:45,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-04 23:59:45,568 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:59:45,568 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 23:59:45,568 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-04 23:59:45,568 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:59:45,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:59:45,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1627137647, now seen corresponding path program 1 times [2021-06-04 23:59:45,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:59:45,569 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821967265] [2021-06-04 23:59:45,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:59:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:59:45,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:59:45,646 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:59:45,646 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821967265] [2021-06-04 23:59:45,646 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821967265] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:59:45,646 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:59:45,646 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-04 23:59:45,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086692778] [2021-06-04 23:59:45,647 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-04 23:59:45,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:59:45,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-04 23:59:45,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-04 23:59:45,647 INFO L87 Difference]: Start difference. First operand 44652 states and 185903 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 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-06-04 23:59:46,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:59:46,008 INFO L93 Difference]: Finished difference Result 56792 states and 233371 transitions. [2021-06-04 23:59:46,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-04 23:59:46,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 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 89 [2021-06-04 23:59:46,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:59:46,115 INFO L225 Difference]: With dead ends: 56792 [2021-06-04 23:59:46,115 INFO L226 Difference]: Without dead ends: 41112 [2021-06-04 23:59:46,115 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 62.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-04 23:59:46,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41112 states. [2021-06-04 23:59:47,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41112 to 41112. [2021-06-04 23:59:47,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41112 states, 41111 states have (on average 4.106030016297342) internal successors, (168803), 41111 states have internal predecessors, (168803), 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-06-04 23:59:47,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41112 states to 41112 states and 168803 transitions. [2021-06-04 23:59:47,662 INFO L78 Accepts]: Start accepts. Automaton has 41112 states and 168803 transitions. Word has length 89 [2021-06-04 23:59:47,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:59:47,662 INFO L482 AbstractCegarLoop]: Abstraction has 41112 states and 168803 transitions. [2021-06-04 23:59:47,662 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 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-06-04 23:59:47,662 INFO L276 IsEmpty]: Start isEmpty. Operand 41112 states and 168803 transitions. [2021-06-04 23:59:47,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-06-04 23:59:47,726 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:59:47,726 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 23:59:47,726 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-04 23:59:47,726 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:59:47,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:59:47,726 INFO L82 PathProgramCache]: Analyzing trace with hash -966078751, now seen corresponding path program 1 times [2021-06-04 23:59:47,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:59:47,727 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321682444] [2021-06-04 23:59:47,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:59:47,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:59:48,196 WARN L205 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2021-06-04 23:59:48,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:59:48,222 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:59:48,222 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321682444] [2021-06-04 23:59:48,222 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321682444] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:59:48,222 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:59:48,222 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-04 23:59:48,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91044473] [2021-06-04 23:59:48,223 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-04 23:59:48,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:59:48,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-04 23:59:48,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-04 23:59:48,224 INFO L87 Difference]: Start difference. First operand 41112 states and 168803 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 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-06-04 23:59:48,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:59:48,643 INFO L93 Difference]: Finished difference Result 44904 states and 180493 transitions. [2021-06-04 23:59:48,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-04 23:59:48,644 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 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 90 [2021-06-04 23:59:48,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:59:48,737 INFO L225 Difference]: With dead ends: 44904 [2021-06-04 23:59:48,737 INFO L226 Difference]: Without dead ends: 31464 [2021-06-04 23:59:48,737 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 502.0ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-06-04 23:59:48,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31464 states. [2021-06-04 23:59:49,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31464 to 31464. [2021-06-04 23:59:49,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31464 states, 31463 states have (on average 3.9827416330292724) internal successors, (125309), 31463 states have internal predecessors, (125309), 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-06-04 23:59:49,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31464 states to 31464 states and 125309 transitions. [2021-06-04 23:59:49,407 INFO L78 Accepts]: Start accepts. Automaton has 31464 states and 125309 transitions. Word has length 90 [2021-06-04 23:59:49,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:59:49,408 INFO L482 AbstractCegarLoop]: Abstraction has 31464 states and 125309 transitions. [2021-06-04 23:59:49,408 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 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-06-04 23:59:49,408 INFO L276 IsEmpty]: Start isEmpty. Operand 31464 states and 125309 transitions. [2021-06-04 23:59:49,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-06-04 23:59:49,742 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:59:49,742 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 23:59:49,742 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-04 23:59:49,742 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:59:49,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:59:49,742 INFO L82 PathProgramCache]: Analyzing trace with hash -763895198, now seen corresponding path program 1 times [2021-06-04 23:59:49,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:59:49,743 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513984610] [2021-06-04 23:59:49,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:59:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:59:49,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:59:49,827 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:59:49,827 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513984610] [2021-06-04 23:59:49,827 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513984610] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:59:49,827 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:59:49,827 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-04 23:59:49,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546780205] [2021-06-04 23:59:49,828 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-04 23:59:49,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:59:49,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-04 23:59:49,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-04 23:59:49,828 INFO L87 Difference]: Start difference. First operand 31464 states and 125309 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 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-06-04 23:59:50,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:59:50,139 INFO L93 Difference]: Finished difference Result 44088 states and 175056 transitions. [2021-06-04 23:59:50,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-04 23:59:50,139 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 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 92 [2021-06-04 23:59:50,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:59:50,191 INFO L225 Difference]: With dead ends: 44088 [2021-06-04 23:59:50,191 INFO L226 Difference]: Without dead ends: 21244 [2021-06-04 23:59:50,191 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 65.7ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-04 23:59:50,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21244 states. [2021-06-04 23:59:50,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21244 to 21244. [2021-06-04 23:59:50,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21244 states, 21243 states have (on average 3.921244645294921) internal successors, (83299), 21243 states have internal predecessors, (83299), 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-06-04 23:59:50,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21244 states to 21244 states and 83299 transitions. [2021-06-04 23:59:50,610 INFO L78 Accepts]: Start accepts. Automaton has 21244 states and 83299 transitions. Word has length 92 [2021-06-04 23:59:50,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:59:50,610 INFO L482 AbstractCegarLoop]: Abstraction has 21244 states and 83299 transitions. [2021-06-04 23:59:50,610 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 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-06-04 23:59:50,610 INFO L276 IsEmpty]: Start isEmpty. Operand 21244 states and 83299 transitions. [2021-06-04 23:59:50,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-06-04 23:59:50,640 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:59:50,640 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 23:59:50,640 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-04 23:59:50,640 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:59:50,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:59:50,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1572982882, now seen corresponding path program 2 times [2021-06-04 23:59:50,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:59:50,641 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852633991] [2021-06-04 23:59:50,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:59:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:59:50,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:59:50,718 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:59:50,718 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852633991] [2021-06-04 23:59:50,718 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852633991] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:59:50,718 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:59:50,718 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-04 23:59:50,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88767229] [2021-06-04 23:59:50,719 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-04 23:59:50,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:59:50,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-04 23:59:50,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-04 23:59:50,720 INFO L87 Difference]: Start difference. First operand 21244 states and 83299 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 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-06-04 23:59:51,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:59:51,217 INFO L93 Difference]: Finished difference Result 32320 states and 125621 transitions. [2021-06-04 23:59:51,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-04 23:59:51,217 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 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 92 [2021-06-04 23:59:51,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:59:51,291 INFO L225 Difference]: With dead ends: 32320 [2021-06-04 23:59:51,292 INFO L226 Difference]: Without dead ends: 22288 [2021-06-04 23:59:51,292 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 69.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-04 23:59:51,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22288 states. [2021-06-04 23:59:51,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22288 to 20344. [2021-06-04 23:59:51,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20344 states, 20343 states have (on average 3.846974389224795) internal successors, (78259), 20343 states have internal predecessors, (78259), 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-06-04 23:59:51,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20344 states to 20344 states and 78259 transitions. [2021-06-04 23:59:51,780 INFO L78 Accepts]: Start accepts. Automaton has 20344 states and 78259 transitions. Word has length 92 [2021-06-04 23:59:51,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:59:51,780 INFO L482 AbstractCegarLoop]: Abstraction has 20344 states and 78259 transitions. [2021-06-04 23:59:51,780 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 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-06-04 23:59:51,780 INFO L276 IsEmpty]: Start isEmpty. Operand 20344 states and 78259 transitions. [2021-06-04 23:59:51,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-06-04 23:59:51,808 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:59:51,808 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 23:59:51,808 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-04 23:59:51,808 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:59:51,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:59:51,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1065422082, now seen corresponding path program 1 times [2021-06-04 23:59:51,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:59:51,809 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138770058] [2021-06-04 23:59:51,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:59:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:59:51,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:59:51,891 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:59:51,891 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138770058] [2021-06-04 23:59:51,891 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138770058] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:59:51,891 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:59:51,891 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-04 23:59:51,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795897568] [2021-06-04 23:59:51,891 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-04 23:59:51,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:59:51,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-04 23:59:51,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-04 23:59:51,892 INFO L87 Difference]: Start difference. First operand 20344 states and 78259 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-06-04 23:59:52,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:59:52,118 INFO L93 Difference]: Finished difference Result 18742 states and 70327 transitions. [2021-06-04 23:59:52,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-04 23:59:52,119 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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 92 [2021-06-04 23:59:52,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:59:52,152 INFO L225 Difference]: With dead ends: 18742 [2021-06-04 23:59:52,153 INFO L226 Difference]: Without dead ends: 12268 [2021-06-04 23:59:52,153 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 98.4ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-06-04 23:59:52,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12268 states. [2021-06-04 23:59:52,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12268 to 12268. [2021-06-04 23:59:52,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12268 states, 12267 states have (on average 3.7046547648161736) internal successors, (45445), 12267 states have internal predecessors, (45445), 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-06-04 23:59:52,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12268 states to 12268 states and 45445 transitions. [2021-06-04 23:59:52,412 INFO L78 Accepts]: Start accepts. Automaton has 12268 states and 45445 transitions. Word has length 92 [2021-06-04 23:59:52,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:59:52,412 INFO L482 AbstractCegarLoop]: Abstraction has 12268 states and 45445 transitions. [2021-06-04 23:59:52,412 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-06-04 23:59:52,412 INFO L276 IsEmpty]: Start isEmpty. Operand 12268 states and 45445 transitions. [2021-06-04 23:59:52,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-04 23:59:52,429 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:59:52,429 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 23:59:52,429 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-04 23:59:52,429 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:59:52,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:59:52,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1828217073, now seen corresponding path program 1 times [2021-06-04 23:59:52,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:59:52,430 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816085042] [2021-06-04 23:59:52,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:59:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:59:52,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:59:52,766 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:59:52,766 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816085042] [2021-06-04 23:59:52,766 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816085042] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:59:52,766 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:59:52,766 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-04 23:59:52,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784047771] [2021-06-04 23:59:52,767 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-04 23:59:52,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:59:52,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-04 23:59:52,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-04 23:59:52,768 INFO L87 Difference]: Start difference. First operand 12268 states and 45445 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 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-06-04 23:59:52,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:59:52,966 INFO L93 Difference]: Finished difference Result 10162 states and 36994 transitions. [2021-06-04 23:59:52,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-04 23:59:52,966 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 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 95 [2021-06-04 23:59:52,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:59:52,973 INFO L225 Difference]: With dead ends: 10162 [2021-06-04 23:59:52,973 INFO L226 Difference]: Without dead ends: 2686 [2021-06-04 23:59:52,973 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 119.8ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-06-04 23:59:52,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2686 states. [2021-06-04 23:59:53,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2686 to 2686. [2021-06-04 23:59:53,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2686 states, 2685 states have (on average 3.533333333333333) internal successors, (9487), 2685 states have internal predecessors, (9487), 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-06-04 23:59:53,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2686 states to 2686 states and 9487 transitions. [2021-06-04 23:59:53,008 INFO L78 Accepts]: Start accepts. Automaton has 2686 states and 9487 transitions. Word has length 95 [2021-06-04 23:59:53,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:59:53,008 INFO L482 AbstractCegarLoop]: Abstraction has 2686 states and 9487 transitions. [2021-06-04 23:59:53,009 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 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-06-04 23:59:53,009 INFO L276 IsEmpty]: Start isEmpty. Operand 2686 states and 9487 transitions. [2021-06-04 23:59:53,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-06-04 23:59:53,012 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:59:53,012 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-04 23:59:53,012 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-04 23:59:53,012 INFO L430 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:59:53,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:59:53,012 INFO L82 PathProgramCache]: Analyzing trace with hash -534616835, now seen corresponding path program 1 times [2021-06-04 23:59:53,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:59:53,012 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17639434] [2021-06-04 23:59:53,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:59:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-04 23:59:53,043 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-04 23:59:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-04 23:59:53,072 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-04 23:59:53,125 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-04 23:59:53,126 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-04 23:59:53,126 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-04 23:59:53,128 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-04 23:59:53,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.06 11:59:53 BasicIcfg [2021-06-04 23:59:53,300 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-04 23:59:53,300 INFO L168 Benchmark]: Toolchain (without parser) took 84056.18 ms. Allocated memory was 333.4 MB in the beginning and 15.4 GB in the end (delta: 15.0 GB). Free memory was 295.2 MB in the beginning and 8.6 GB in the end (delta: -8.3 GB). Peak memory consumption was 6.7 GB. Max. memory is 16.0 GB. [2021-06-04 23:59:53,300 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 333.4 MB. Free memory is still 313.7 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-04 23:59:53,300 INFO L168 Benchmark]: CACSL2BoogieTranslator took 544.49 ms. Allocated memory is still 333.4 MB. Free memory was 295.0 MB in the beginning and 293.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB. [2021-06-04 23:59:53,301 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.68 ms. Allocated memory is still 333.4 MB. Free memory was 293.2 MB in the beginning and 290.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-04 23:59:53,301 INFO L168 Benchmark]: Boogie Preprocessor took 61.73 ms. Allocated memory is still 333.4 MB. Free memory was 290.1 MB in the beginning and 287.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-04 23:59:53,301 INFO L168 Benchmark]: RCFGBuilder took 2115.38 ms. Allocated memory is still 333.4 MB. Free memory was 287.5 MB in the beginning and 235.1 MB in the end (delta: 52.4 MB). Peak memory consumption was 137.9 MB. Max. memory is 16.0 GB. [2021-06-04 23:59:53,302 INFO L168 Benchmark]: TraceAbstraction took 81260.89 ms. Allocated memory was 333.4 MB in the beginning and 15.4 GB in the end (delta: 15.0 GB). Free memory was 235.1 MB in the beginning and 8.6 GB in the end (delta: -8.4 GB). Peak memory consumption was 6.6 GB. Max. memory is 16.0 GB. [2021-06-04 23:59:53,305 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 333.4 MB. Free memory is still 313.7 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 544.49 ms. Allocated memory is still 333.4 MB. Free memory was 295.0 MB in the beginning and 293.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 68.68 ms. Allocated memory is still 333.4 MB. Free memory was 293.2 MB in the beginning and 290.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 61.73 ms. Allocated memory is still 333.4 MB. Free memory was 290.1 MB in the beginning and 287.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2115.38 ms. Allocated memory is still 333.4 MB. Free memory was 287.5 MB in the beginning and 235.1 MB in the end (delta: 52.4 MB). Peak memory consumption was 137.9 MB. Max. memory is 16.0 GB. * TraceAbstraction took 81260.89 ms. Allocated memory was 333.4 MB in the beginning and 15.4 GB in the end (delta: 15.0 GB). Free memory was 235.1 MB in the beginning and 8.6 GB in the end (delta: -8.4 GB). Peak memory consumption was 6.6 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0] [L714] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L716] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L718] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L724] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L726] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L727] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L728] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L729] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L730] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L731] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L732] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L733] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0] [L734] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0] [L735] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L736] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L737] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L738] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L739] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L740] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L741] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L742] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L743] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L744] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L844] 0 pthread_t t1253; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t1253, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 pthread_t t1254; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1254, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1255; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1255, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1256; VAL [__unbuffered_cnt=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}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] FCALL, FORK 0 pthread_create(&t1256, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=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}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 2 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L805] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L810] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=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}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 b = 1 VAL [__unbuffered_cnt=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 x = 2 VAL [__unbuffered_cnt=1, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 y = 1 VAL [__unbuffered_cnt=1, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 VAL [__unbuffered_cnt=1, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z = 1 VAL [__unbuffered_cnt=1, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L786] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L786] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L787] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L789] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L790] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L793] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 z$flush_delayed = weak$$choice2 [L867] 0 z$mem_tmp = z [L868] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L868] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L869] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L869] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L869] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L869] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L870] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L870] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L870] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L870] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L871] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L871] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L871] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L871] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L872] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L873] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L873] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L873] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L874] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L874] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L876] 0 z = z$flush_delayed ? z$mem_tmp : z [L877] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=4, __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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 164 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 80989.2ms, OverallIterations: 20, TraceHistogramMax: 1, EmptinessCheckTime: 1730.1ms, AutomataDifference: 20232.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 26729.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3429 SDtfs, 5317 SDslu, 13979 SDs, 0 SdLazy, 1358 SolverSat, 286 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1256.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 271 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 3736.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=128228occurred in iteration=0, InterpolantAutomatonStates: 206, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 28268.6ms AutomataMinimizationTime, 19 MinimizatonAttempts, 35744 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 69.4ms SsaConstructionTime, 589.2ms SatisfiabilityAnalysisTime, 3015.1ms InterpolantComputationTime, 1752 NumberOfCodeBlocks, 1752 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1634 ConstructedInterpolants, 0 QuantifiedInterpolants, 8374 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...