/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/mix056_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9b7772ad7705253c1305067fc38dc9bc7271fbe3-9b7772a [2021-04-15 00:53:06,205 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-04-15 00:53:06,207 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-04-15 00:53:06,232 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-04-15 00:53:06,232 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-04-15 00:53:06,233 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-04-15 00:53:06,235 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-04-15 00:53:06,236 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-04-15 00:53:06,238 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-04-15 00:53:06,239 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-04-15 00:53:06,240 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-04-15 00:53:06,241 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-04-15 00:53:06,241 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-04-15 00:53:06,242 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-04-15 00:53:06,243 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-04-15 00:53:06,244 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-04-15 00:53:06,245 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-04-15 00:53:06,246 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-04-15 00:53:06,247 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-04-15 00:53:06,249 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-04-15 00:53:06,250 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-04-15 00:53:06,251 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-04-15 00:53:06,252 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-04-15 00:53:06,253 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-04-15 00:53:06,255 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-04-15 00:53:06,255 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-04-15 00:53:06,256 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-04-15 00:53:06,256 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-04-15 00:53:06,257 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-04-15 00:53:06,258 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-04-15 00:53:06,258 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-04-15 00:53:06,258 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-04-15 00:53:06,259 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-04-15 00:53:06,260 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-04-15 00:53:06,261 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-04-15 00:53:06,261 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-04-15 00:53:06,262 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-04-15 00:53:06,262 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-04-15 00:53:06,262 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-04-15 00:53:06,263 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-04-15 00:53:06,264 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-04-15 00:53:06,265 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-04-15 00:53:06,284 INFO L113 SettingsManager]: Loading preferences was successful [2021-04-15 00:53:06,285 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-04-15 00:53:06,285 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-04-15 00:53:06,285 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-04-15 00:53:06,287 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-04-15 00:53:06,287 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-04-15 00:53:06,287 INFO L138 SettingsManager]: * Use SBE=true [2021-04-15 00:53:06,287 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-04-15 00:53:06,288 INFO L138 SettingsManager]: * sizeof long=4 [2021-04-15 00:53:06,288 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-04-15 00:53:06,288 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-04-15 00:53:06,288 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-04-15 00:53:06,289 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-04-15 00:53:06,289 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-04-15 00:53:06,289 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-04-15 00:53:06,289 INFO L138 SettingsManager]: * sizeof long double=12 [2021-04-15 00:53:06,289 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-04-15 00:53:06,290 INFO L138 SettingsManager]: * Use constant arrays=true [2021-04-15 00:53:06,290 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-04-15 00:53:06,290 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-04-15 00:53:06,290 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-04-15 00:53:06,291 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-04-15 00:53:06,291 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-04-15 00:53:06,291 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-04-15 00:53:06,291 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-04-15 00:53:06,291 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-04-15 00:53:06,292 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-04-15 00:53:06,292 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-04-15 00:53:06,292 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-04-15 00:53:06,292 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-04-15 00:53:06,292 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-04-15 00:53:06,292 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-04-15 00:53:06,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-04-15 00:53:06,578 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-04-15 00:53:06,580 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-04-15 00:53:06,581 INFO L271 PluginConnector]: Initializing CDTParser... [2021-04-15 00:53:06,583 INFO L275 PluginConnector]: CDTParser initialized [2021-04-15 00:53:06,584 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_tso.oepc.i [2021-04-15 00:53:06,645 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13aaa0653/610373feb6f841bfac19c24f1d51f9a0/FLAG9d1bd10dc [2021-04-15 00:53:07,129 INFO L306 CDTParser]: Found 1 translation units. [2021-04-15 00:53:07,130 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_tso.oepc.i [2021-04-15 00:53:07,143 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13aaa0653/610373feb6f841bfac19c24f1d51f9a0/FLAG9d1bd10dc [2021-04-15 00:53:07,155 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13aaa0653/610373feb6f841bfac19c24f1d51f9a0 [2021-04-15 00:53:07,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-04-15 00:53:07,158 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-04-15 00:53:07,160 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-04-15 00:53:07,160 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-04-15 00:53:07,167 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-04-15 00:53:07,168 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:53:07" (1/1) ... [2021-04-15 00:53:07,168 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e88e5e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:53:07, skipping insertion in model container [2021-04-15 00:53:07,168 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:53:07" (1/1) ... [2021-04-15 00:53:07,175 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-04-15 00:53:07,227 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-04-15 00:53:07,381 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_tso.oepc.i[949,962] [2021-04-15 00:53:07,554 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-15 00:53:07,563 INFO L203 MainTranslator]: Completed pre-run [2021-04-15 00:53:07,574 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_tso.oepc.i[949,962] [2021-04-15 00:53:07,643 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-15 00:53:07,711 INFO L208 MainTranslator]: Completed translation [2021-04-15 00:53:07,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:53:07 WrapperNode [2021-04-15 00:53:07,711 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-04-15 00:53:07,713 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-04-15 00:53:07,713 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-04-15 00:53:07,713 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-04-15 00:53:07,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:53:07" (1/1) ... [2021-04-15 00:53:07,732 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:53:07" (1/1) ... [2021-04-15 00:53:07,755 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-04-15 00:53:07,756 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-04-15 00:53:07,756 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-04-15 00:53:07,756 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-04-15 00:53:07,763 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:53:07" (1/1) ... [2021-04-15 00:53:07,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:53:07" (1/1) ... [2021-04-15 00:53:07,767 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:53:07" (1/1) ... [2021-04-15 00:53:07,767 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:53:07" (1/1) ... [2021-04-15 00:53:07,774 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:53:07" (1/1) ... [2021-04-15 00:53:07,777 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:53:07" (1/1) ... [2021-04-15 00:53:07,780 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:53:07" (1/1) ... [2021-04-15 00:53:07,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-04-15 00:53:07,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-04-15 00:53:07,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-04-15 00:53:07,786 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-04-15 00:53:07,786 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:53:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-04-15 00:53:07,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-04-15 00:53:07,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-04-15 00:53:07,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-04-15 00:53:07,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-04-15 00:53:07,869 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-04-15 00:53:07,870 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-04-15 00:53:07,871 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-04-15 00:53:07,871 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-04-15 00:53:07,871 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-04-15 00:53:07,871 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-04-15 00:53:07,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-04-15 00:53:07,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-04-15 00:53:07,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-04-15 00:53:07,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-04-15 00:53:07,873 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-04-15 00:53:09,410 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-04-15 00:53:09,410 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-04-15 00:53:09,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:53:09 BoogieIcfgContainer [2021-04-15 00:53:09,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-04-15 00:53:09,414 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-04-15 00:53:09,414 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-04-15 00:53:09,416 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-04-15 00:53:09,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:53:07" (1/3) ... [2021-04-15 00:53:09,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b2cb24d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:53:09, skipping insertion in model container [2021-04-15 00:53:09,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:53:07" (2/3) ... [2021-04-15 00:53:09,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b2cb24d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:53:09, skipping insertion in model container [2021-04-15 00:53:09,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:53:09" (3/3) ... [2021-04-15 00:53:09,418 INFO L111 eAbstractionObserver]: Analyzing ICFG mix056_tso.oepc.i [2021-04-15 00:53:09,424 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-04-15 00:53:09,424 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-04-15 00:53:09,428 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-04-15 00:53:09,428 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-04-15 00:53:09,454 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,455 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,455 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,455 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,455 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,455 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,455 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,456 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,457 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,457 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,457 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,458 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,461 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,461 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,461 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,461 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,461 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,462 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,462 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,462 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,462 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,462 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,462 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,462 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,463 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,463 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,463 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,463 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,463 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,463 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,463 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,464 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,464 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,464 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,464 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,464 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,464 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,468 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,468 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,469 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,470 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,470 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,470 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,470 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,470 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,470 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,472 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,472 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,472 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,472 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,473 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,473 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,473 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:53:09,475 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-04-15 00:53:09,490 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-04-15 00:53:09,506 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-04-15 00:53:09,506 INFO L377 AbstractCegarLoop]: Hoare is true [2021-04-15 00:53:09,506 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-04-15 00:53:09,506 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-04-15 00:53:09,506 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-04-15 00:53:09,506 INFO L381 AbstractCegarLoop]: Difference is false [2021-04-15 00:53:09,506 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-04-15 00:53:09,507 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-04-15 00:53:09,515 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 104 places, 96 transitions, 207 flow [2021-04-15 00:53:10,177 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 13393 states, 13389 states have (on average 3.6339532452012846) internal successors, (48655), 13392 states have internal predecessors, (48655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:10,218 INFO L276 IsEmpty]: Start isEmpty. Operand has 13393 states, 13389 states have (on average 3.6339532452012846) internal successors, (48655), 13392 states have internal predecessors, (48655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:10,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-04-15 00:53:10,226 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:53:10,227 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:53:10,284 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:53:10,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:53:10,290 INFO L82 PathProgramCache]: Analyzing trace with hash -992983575, now seen corresponding path program 1 times [2021-04-15 00:53:10,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:53:10,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617378437] [2021-04-15 00:53:10,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:53:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:53:10,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:53:10,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617378437] [2021-04-15 00:53:10,537 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:53:10,537 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-04-15 00:53:10,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145714580] [2021-04-15 00:53:10,541 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-15 00:53:10,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:53:10,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-15 00:53:10,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-15 00:53:10,580 INFO L87 Difference]: Start difference. First operand has 13393 states, 13389 states have (on average 3.6339532452012846) internal successors, (48655), 13392 states have internal predecessors, (48655), 0 states have call successors, (0), 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 23.5) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:10,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:53:10,823 INFO L93 Difference]: Finished difference Result 11489 states and 40653 transitions. [2021-04-15 00:53:10,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-15 00:53:10,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2021-04-15 00:53:10,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:53:10,902 INFO L225 Difference]: With dead ends: 11489 [2021-04-15 00:53:10,903 INFO L226 Difference]: Without dead ends: 6561 [2021-04-15 00:53:10,904 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-15 00:53:10,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6561 states. [2021-04-15 00:53:11,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6561 to 6561. [2021-04-15 00:53:11,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6561 states, 6560 states have (on average 3.4873475609756097) internal successors, (22877), 6560 states have internal predecessors, (22877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:11,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6561 states to 6561 states and 22877 transitions. [2021-04-15 00:53:11,369 INFO L78 Accepts]: Start accepts. Automaton has 6561 states and 22877 transitions. Word has length 47 [2021-04-15 00:53:11,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:53:11,371 INFO L480 AbstractCegarLoop]: Abstraction has 6561 states and 22877 transitions. [2021-04-15 00:53:11,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:11,371 INFO L276 IsEmpty]: Start isEmpty. Operand 6561 states and 22877 transitions. [2021-04-15 00:53:11,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-04-15 00:53:11,386 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:53:11,386 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:53:11,386 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-04-15 00:53:11,386 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:53:11,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:53:11,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1513857761, now seen corresponding path program 1 times [2021-04-15 00:53:11,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:53:11,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802725846] [2021-04-15 00:53:11,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:53:11,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:53:11,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:53:11,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802725846] [2021-04-15 00:53:11,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:53:11,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-15 00:53:11,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983610236] [2021-04-15 00:53:11,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-15 00:53:11,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:53:11,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-15 00:53:11,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-04-15 00:53:11,695 INFO L87 Difference]: Start difference. First operand 6561 states and 22877 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:11,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:53:11,916 INFO L93 Difference]: Finished difference Result 8065 states and 27825 transitions. [2021-04-15 00:53:11,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-15 00:53:11,917 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2021-04-15 00:53:11,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:53:11,956 INFO L225 Difference]: With dead ends: 8065 [2021-04-15 00:53:11,957 INFO L226 Difference]: Without dead ends: 6273 [2021-04-15 00:53:11,958 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 96.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-04-15 00:53:11,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6273 states. [2021-04-15 00:53:12,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6273 to 6273. [2021-04-15 00:53:12,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6273 states, 6272 states have (on average 3.469547193877551) internal successors, (21761), 6272 states have internal predecessors, (21761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:12,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6273 states to 6273 states and 21761 transitions. [2021-04-15 00:53:12,248 INFO L78 Accepts]: Start accepts. Automaton has 6273 states and 21761 transitions. Word has length 58 [2021-04-15 00:53:12,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:53:12,248 INFO L480 AbstractCegarLoop]: Abstraction has 6273 states and 21761 transitions. [2021-04-15 00:53:12,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:12,249 INFO L276 IsEmpty]: Start isEmpty. Operand 6273 states and 21761 transitions. [2021-04-15 00:53:12,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-04-15 00:53:12,261 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:53:12,261 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:53:12,261 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-04-15 00:53:12,262 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:53:12,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:53:12,262 INFO L82 PathProgramCache]: Analyzing trace with hash -101588192, now seen corresponding path program 1 times [2021-04-15 00:53:12,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:53:12,263 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379023784] [2021-04-15 00:53:12,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:53:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:53:12,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:53:12,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379023784] [2021-04-15 00:53:12,533 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:53:12,567 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-04-15 00:53:12,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990611155] [2021-04-15 00:53:12,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-04-15 00:53:12,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:53:12,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-04-15 00:53:12,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-04-15 00:53:12,569 INFO L87 Difference]: Start difference. First operand 6273 states and 21761 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:12,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:53:12,917 INFO L93 Difference]: Finished difference Result 7513 states and 25773 transitions. [2021-04-15 00:53:12,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-04-15 00:53:12,917 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-04-15 00:53:12,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:53:12,961 INFO L225 Difference]: With dead ends: 7513 [2021-04-15 00:53:12,961 INFO L226 Difference]: Without dead ends: 5913 [2021-04-15 00:53:12,962 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 228.8ms TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2021-04-15 00:53:12,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5913 states. [2021-04-15 00:53:13,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5913 to 5913. [2021-04-15 00:53:13,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5913 states, 5912 states have (on average 3.449424898511502) internal successors, (20393), 5912 states have internal predecessors, (20393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:13,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5913 states to 5913 states and 20393 transitions. [2021-04-15 00:53:13,210 INFO L78 Accepts]: Start accepts. Automaton has 5913 states and 20393 transitions. Word has length 60 [2021-04-15 00:53:13,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:53:13,210 INFO L480 AbstractCegarLoop]: Abstraction has 5913 states and 20393 transitions. [2021-04-15 00:53:13,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:13,211 INFO L276 IsEmpty]: Start isEmpty. Operand 5913 states and 20393 transitions. [2021-04-15 00:53:13,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-04-15 00:53:13,223 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:53:13,223 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:53:13,224 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-04-15 00:53:13,224 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:53:13,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:53:13,230 INFO L82 PathProgramCache]: Analyzing trace with hash 315686046, now seen corresponding path program 1 times [2021-04-15 00:53:13,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:53:13,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401525968] [2021-04-15 00:53:13,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:53:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:53:13,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:53:13,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401525968] [2021-04-15 00:53:13,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:53:13,483 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-04-15 00:53:13,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835716108] [2021-04-15 00:53:13,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-04-15 00:53:13,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:53:13,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-04-15 00:53:13,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-04-15 00:53:13,484 INFO L87 Difference]: Start difference. First operand 5913 states and 20393 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:13,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:53:13,788 INFO L93 Difference]: Finished difference Result 6613 states and 22603 transitions. [2021-04-15 00:53:13,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-04-15 00:53:13,789 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2021-04-15 00:53:13,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:53:13,812 INFO L225 Difference]: With dead ends: 6613 [2021-04-15 00:53:13,812 INFO L226 Difference]: Without dead ends: 5493 [2021-04-15 00:53:13,813 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 186.8ms TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2021-04-15 00:53:13,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5493 states. [2021-04-15 00:53:14,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5493 to 5493. [2021-04-15 00:53:14,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5493 states, 5492 states have (on average 3.4335396941005096) internal successors, (18857), 5492 states have internal predecessors, (18857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:14,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5493 states to 5493 states and 18857 transitions. [2021-04-15 00:53:14,036 INFO L78 Accepts]: Start accepts. Automaton has 5493 states and 18857 transitions. Word has length 61 [2021-04-15 00:53:14,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:53:14,036 INFO L480 AbstractCegarLoop]: Abstraction has 5493 states and 18857 transitions. [2021-04-15 00:53:14,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:14,037 INFO L276 IsEmpty]: Start isEmpty. Operand 5493 states and 18857 transitions. [2021-04-15 00:53:14,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-04-15 00:53:14,047 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:53:14,048 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:53:14,048 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-04-15 00:53:14,048 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:53:14,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:53:14,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1549191164, now seen corresponding path program 1 times [2021-04-15 00:53:14,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:53:14,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127113570] [2021-04-15 00:53:14,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:53:14,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:53:14,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:53:14,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127113570] [2021-04-15 00:53:14,296 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:53:14,296 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-04-15 00:53:14,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757874291] [2021-04-15 00:53:14,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-04-15 00:53:14,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:53:14,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-04-15 00:53:14,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-04-15 00:53:14,298 INFO L87 Difference]: Start difference. First operand 5493 states and 18857 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:14,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:53:14,581 INFO L93 Difference]: Finished difference Result 6865 states and 23491 transitions. [2021-04-15 00:53:14,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-04-15 00:53:14,581 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-04-15 00:53:14,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:53:14,602 INFO L225 Difference]: With dead ends: 6865 [2021-04-15 00:53:14,602 INFO L226 Difference]: Without dead ends: 6025 [2021-04-15 00:53:14,603 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 161.4ms TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-04-15 00:53:14,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6025 states. [2021-04-15 00:53:14,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6025 to 5619. [2021-04-15 00:53:14,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5619 states, 5618 states have (on average 3.438056247775009) internal successors, (19315), 5618 states have internal predecessors, (19315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:14,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5619 states to 5619 states and 19315 transitions. [2021-04-15 00:53:14,852 INFO L78 Accepts]: Start accepts. Automaton has 5619 states and 19315 transitions. Word has length 63 [2021-04-15 00:53:14,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:53:14,853 INFO L480 AbstractCegarLoop]: Abstraction has 5619 states and 19315 transitions. [2021-04-15 00:53:14,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:14,854 INFO L276 IsEmpty]: Start isEmpty. Operand 5619 states and 19315 transitions. [2021-04-15 00:53:14,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-04-15 00:53:14,866 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:53:14,866 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:53:14,866 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-04-15 00:53:14,866 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:53:14,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:53:14,867 INFO L82 PathProgramCache]: Analyzing trace with hash -557549988, now seen corresponding path program 2 times [2021-04-15 00:53:14,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:53:14,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680850229] [2021-04-15 00:53:14,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:53:14,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:53:15,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:53:15,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680850229] [2021-04-15 00:53:15,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:53:15,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-04-15 00:53:15,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780192790] [2021-04-15 00:53:15,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-04-15 00:53:15,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:53:15,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-04-15 00:53:15,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-04-15 00:53:15,127 INFO L87 Difference]: Start difference. First operand 5619 states and 19315 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:15,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:53:15,407 INFO L93 Difference]: Finished difference Result 7145 states and 24459 transitions. [2021-04-15 00:53:15,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-04-15 00:53:15,408 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-04-15 00:53:15,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:53:15,427 INFO L225 Difference]: With dead ends: 7145 [2021-04-15 00:53:15,427 INFO L226 Difference]: Without dead ends: 6081 [2021-04-15 00:53:15,427 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 207.0ms TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-04-15 00:53:15,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6081 states. [2021-04-15 00:53:15,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6081 to 6053. [2021-04-15 00:53:15,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6053 states, 6052 states have (on average 3.442663582286847) internal successors, (20835), 6052 states have internal predecessors, (20835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:15,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6053 states to 6053 states and 20835 transitions. [2021-04-15 00:53:15,623 INFO L78 Accepts]: Start accepts. Automaton has 6053 states and 20835 transitions. Word has length 63 [2021-04-15 00:53:15,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:53:15,623 INFO L480 AbstractCegarLoop]: Abstraction has 6053 states and 20835 transitions. [2021-04-15 00:53:15,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:15,623 INFO L276 IsEmpty]: Start isEmpty. Operand 6053 states and 20835 transitions. [2021-04-15 00:53:15,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-04-15 00:53:15,634 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:53:15,634 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:53:15,634 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-04-15 00:53:15,634 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:53:15,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:53:15,635 INFO L82 PathProgramCache]: Analyzing trace with hash 223319956, now seen corresponding path program 3 times [2021-04-15 00:53:15,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:53:15,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303045314] [2021-04-15 00:53:15,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:53:15,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:53:15,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:53:15,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303045314] [2021-04-15 00:53:15,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:53:15,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-04-15 00:53:15,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398223701] [2021-04-15 00:53:15,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-04-15 00:53:15,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:53:15,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-04-15 00:53:15,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-04-15 00:53:15,812 INFO L87 Difference]: Start difference. First operand 6053 states and 20835 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:16,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:53:16,013 INFO L93 Difference]: Finished difference Result 7313 states and 25009 transitions. [2021-04-15 00:53:16,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-04-15 00:53:16,013 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-04-15 00:53:16,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:53:16,031 INFO L225 Difference]: With dead ends: 7313 [2021-04-15 00:53:16,031 INFO L226 Difference]: Without dead ends: 6361 [2021-04-15 00:53:16,031 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 141.4ms TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2021-04-15 00:53:16,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6361 states. [2021-04-15 00:53:16,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6361 to 6081. [2021-04-15 00:53:16,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6081 states, 6080 states have (on average 3.4330592105263156) internal successors, (20873), 6080 states have internal predecessors, (20873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:16,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6081 states to 6081 states and 20873 transitions. [2021-04-15 00:53:16,171 INFO L78 Accepts]: Start accepts. Automaton has 6081 states and 20873 transitions. Word has length 63 [2021-04-15 00:53:16,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:53:16,172 INFO L480 AbstractCegarLoop]: Abstraction has 6081 states and 20873 transitions. [2021-04-15 00:53:16,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:16,172 INFO L276 IsEmpty]: Start isEmpty. Operand 6081 states and 20873 transitions. [2021-04-15 00:53:16,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-04-15 00:53:16,183 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:53:16,183 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:53:16,183 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-04-15 00:53:16,183 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:53:16,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:53:16,184 INFO L82 PathProgramCache]: Analyzing trace with hash -554251047, now seen corresponding path program 1 times [2021-04-15 00:53:16,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:53:16,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051616860] [2021-04-15 00:53:16,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:53:16,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:53:16,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:53:16,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051616860] [2021-04-15 00:53:16,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:53:16,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-04-15 00:53:16,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131803809] [2021-04-15 00:53:16,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-04-15 00:53:16,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:53:16,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-04-15 00:53:16,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-04-15 00:53:16,498 INFO L87 Difference]: Start difference. First operand 6081 states and 20873 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:16,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:53:16,787 INFO L93 Difference]: Finished difference Result 7537 states and 25782 transitions. [2021-04-15 00:53:16,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-04-15 00:53:16,787 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-04-15 00:53:16,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:53:16,805 INFO L225 Difference]: With dead ends: 7537 [2021-04-15 00:53:16,805 INFO L226 Difference]: Without dead ends: 6865 [2021-04-15 00:53:16,806 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 205.7ms TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2021-04-15 00:53:16,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6865 states. [2021-04-15 00:53:16,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6865 to 6207. [2021-04-15 00:53:16,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6207 states, 6206 states have (on average 3.4371575894295843) internal successors, (21331), 6206 states have internal predecessors, (21331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:16,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6207 states to 6207 states and 21331 transitions. [2021-04-15 00:53:16,991 INFO L78 Accepts]: Start accepts. Automaton has 6207 states and 21331 transitions. Word has length 64 [2021-04-15 00:53:16,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:53:16,992 INFO L480 AbstractCegarLoop]: Abstraction has 6207 states and 21331 transitions. [2021-04-15 00:53:16,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:16,992 INFO L276 IsEmpty]: Start isEmpty. Operand 6207 states and 21331 transitions. [2021-04-15 00:53:17,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-04-15 00:53:17,005 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:53:17,005 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:53:17,005 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-04-15 00:53:17,005 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:53:17,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:53:17,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1438717319, now seen corresponding path program 2 times [2021-04-15 00:53:17,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:53:17,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427248016] [2021-04-15 00:53:17,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:53:17,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:53:17,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:53:17,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427248016] [2021-04-15 00:53:17,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:53:17,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-04-15 00:53:17,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224619409] [2021-04-15 00:53:17,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-04-15 00:53:17,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:53:17,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-04-15 00:53:17,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-04-15 00:53:17,372 INFO L87 Difference]: Start difference. First operand 6207 states and 21331 transitions. Second operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:17,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:53:17,630 INFO L93 Difference]: Finished difference Result 7019 states and 23903 transitions. [2021-04-15 00:53:17,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-04-15 00:53:17,631 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-04-15 00:53:17,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:53:17,647 INFO L225 Difference]: With dead ends: 7019 [2021-04-15 00:53:17,647 INFO L226 Difference]: Without dead ends: 6347 [2021-04-15 00:53:17,648 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 291.2ms TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2021-04-15 00:53:17,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6347 states. [2021-04-15 00:53:17,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6347 to 6193. [2021-04-15 00:53:17,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6193 states, 6192 states have (on average 3.438468992248062) internal successors, (21291), 6192 states have internal predecessors, (21291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:17,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6193 states to 6193 states and 21291 transitions. [2021-04-15 00:53:17,811 INFO L78 Accepts]: Start accepts. Automaton has 6193 states and 21291 transitions. Word has length 64 [2021-04-15 00:53:17,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:53:17,811 INFO L480 AbstractCegarLoop]: Abstraction has 6193 states and 21291 transitions. [2021-04-15 00:53:17,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:17,811 INFO L276 IsEmpty]: Start isEmpty. Operand 6193 states and 21291 transitions. [2021-04-15 00:53:17,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-04-15 00:53:17,822 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:53:17,823 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:53:17,823 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-04-15 00:53:17,823 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:53:17,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:53:17,824 INFO L82 PathProgramCache]: Analyzing trace with hash 877321053, now seen corresponding path program 1 times [2021-04-15 00:53:17,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:53:17,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002903823] [2021-04-15 00:53:17,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:53:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:53:17,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:53:17,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002903823] [2021-04-15 00:53:17,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:53:17,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-15 00:53:17,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932049276] [2021-04-15 00:53:17,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-15 00:53:17,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:53:17,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-15 00:53:17,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-04-15 00:53:17,916 INFO L87 Difference]: Start difference. First operand 6193 states and 21291 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:18,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:53:18,051 INFO L93 Difference]: Finished difference Result 7525 states and 25349 transitions. [2021-04-15 00:53:18,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-15 00:53:18,052 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-04-15 00:53:18,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:53:18,063 INFO L225 Difference]: With dead ends: 7525 [2021-04-15 00:53:18,064 INFO L226 Difference]: Without dead ends: 5341 [2021-04-15 00:53:18,064 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 87.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-04-15 00:53:18,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5341 states. [2021-04-15 00:53:18,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5341 to 5341. [2021-04-15 00:53:18,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5341 states, 5340 states have (on average 3.348876404494382) internal successors, (17883), 5340 states have internal predecessors, (17883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:18,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5341 states to 5341 states and 17883 transitions. [2021-04-15 00:53:18,197 INFO L78 Accepts]: Start accepts. Automaton has 5341 states and 17883 transitions. Word has length 64 [2021-04-15 00:53:18,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:53:18,197 INFO L480 AbstractCegarLoop]: Abstraction has 5341 states and 17883 transitions. [2021-04-15 00:53:18,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:18,198 INFO L276 IsEmpty]: Start isEmpty. Operand 5341 states and 17883 transitions. [2021-04-15 00:53:18,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-04-15 00:53:18,207 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:53:18,208 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:53:18,208 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-04-15 00:53:18,208 INFO L428 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:53:18,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:53:18,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1712732059, now seen corresponding path program 1 times [2021-04-15 00:53:18,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:53:18,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078925863] [2021-04-15 00:53:18,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:53:18,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:53:18,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:53:18,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078925863] [2021-04-15 00:53:18,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:53:18,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-04-15 00:53:18,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239894361] [2021-04-15 00:53:18,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-04-15 00:53:18,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:53:18,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-04-15 00:53:18,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-04-15 00:53:18,321 INFO L87 Difference]: Start difference. First operand 5341 states and 17883 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:18,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:53:18,466 INFO L93 Difference]: Finished difference Result 4975 states and 16085 transitions. [2021-04-15 00:53:18,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-04-15 00:53:18,467 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-04-15 00:53:18,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:53:18,474 INFO L225 Difference]: With dead ends: 4975 [2021-04-15 00:53:18,474 INFO L226 Difference]: Without dead ends: 3271 [2021-04-15 00:53:18,474 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 114.0ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-04-15 00:53:18,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3271 states. [2021-04-15 00:53:18,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3271 to 3271. [2021-04-15 00:53:18,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3271 states, 3270 states have (on average 3.1477064220183486) internal successors, (10293), 3270 states have internal predecessors, (10293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:18,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3271 states to 3271 states and 10293 transitions. [2021-04-15 00:53:18,550 INFO L78 Accepts]: Start accepts. Automaton has 3271 states and 10293 transitions. Word has length 65 [2021-04-15 00:53:18,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:53:18,550 INFO L480 AbstractCegarLoop]: Abstraction has 3271 states and 10293 transitions. [2021-04-15 00:53:18,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:18,550 INFO L276 IsEmpty]: Start isEmpty. Operand 3271 states and 10293 transitions. [2021-04-15 00:53:18,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-04-15 00:53:18,555 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:53:18,555 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:53:18,556 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-04-15 00:53:18,556 INFO L428 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:53:18,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:53:18,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1230791938, now seen corresponding path program 1 times [2021-04-15 00:53:18,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:53:18,556 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825775182] [2021-04-15 00:53:18,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:53:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:53:18,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:53:18,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825775182] [2021-04-15 00:53:18,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:53:18,644 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-15 00:53:18,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113468803] [2021-04-15 00:53:18,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-15 00:53:18,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:53:18,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-15 00:53:18,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-04-15 00:53:18,645 INFO L87 Difference]: Start difference. First operand 3271 states and 10293 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 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-04-15 00:53:18,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:53:18,764 INFO L93 Difference]: Finished difference Result 5429 states and 16967 transitions. [2021-04-15 00:53:18,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-15 00:53:18,765 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 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-04-15 00:53:18,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:53:18,772 INFO L225 Difference]: With dead ends: 5429 [2021-04-15 00:53:18,772 INFO L226 Difference]: Without dead ends: 3379 [2021-04-15 00:53:18,772 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 95.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-04-15 00:53:18,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3379 states. [2021-04-15 00:53:18,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3379 to 3079. [2021-04-15 00:53:18,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3079 states, 3078 states have (on average 3.080896686159844) internal successors, (9483), 3078 states have internal predecessors, (9483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:18,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3079 states to 3079 states and 9483 transitions. [2021-04-15 00:53:18,844 INFO L78 Accepts]: Start accepts. Automaton has 3079 states and 9483 transitions. Word has length 67 [2021-04-15 00:53:18,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:53:18,844 INFO L480 AbstractCegarLoop]: Abstraction has 3079 states and 9483 transitions. [2021-04-15 00:53:18,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 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-04-15 00:53:18,844 INFO L276 IsEmpty]: Start isEmpty. Operand 3079 states and 9483 transitions. [2021-04-15 00:53:18,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-04-15 00:53:18,850 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:53:18,850 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:53:18,850 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-04-15 00:53:18,850 INFO L428 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:53:18,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:53:18,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1506823350, now seen corresponding path program 1 times [2021-04-15 00:53:18,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:53:18,851 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985755721] [2021-04-15 00:53:18,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:53:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:53:18,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:53:18,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985755721] [2021-04-15 00:53:18,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:53:18,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-04-15 00:53:18,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441884144] [2021-04-15 00:53:18,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-04-15 00:53:18,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:53:18,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-04-15 00:53:18,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-04-15 00:53:18,961 INFO L87 Difference]: Start difference. First operand 3079 states and 9483 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:19,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:53:19,104 INFO L93 Difference]: Finished difference Result 2341 states and 6978 transitions. [2021-04-15 00:53:19,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-04-15 00:53:19,105 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2021-04-15 00:53:19,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:53:19,107 INFO L225 Difference]: With dead ends: 2341 [2021-04-15 00:53:19,107 INFO L226 Difference]: Without dead ends: 1261 [2021-04-15 00:53:19,107 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 117.9ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-04-15 00:53:19,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2021-04-15 00:53:19,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1149. [2021-04-15 00:53:19,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 1148 states have (on average 2.847560975609756) internal successors, (3269), 1148 states have internal predecessors, (3269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:19,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 3269 transitions. [2021-04-15 00:53:19,130 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 3269 transitions. Word has length 68 [2021-04-15 00:53:19,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:53:19,130 INFO L480 AbstractCegarLoop]: Abstraction has 1149 states and 3269 transitions. [2021-04-15 00:53:19,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:19,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 3269 transitions. [2021-04-15 00:53:19,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-04-15 00:53:19,133 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:53:19,133 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:53:19,133 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-04-15 00:53:19,133 INFO L428 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:53:19,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:53:19,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1222291080, now seen corresponding path program 1 times [2021-04-15 00:53:19,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:53:19,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135014993] [2021-04-15 00:53:19,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:53:19,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:53:19,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:53:19,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135014993] [2021-04-15 00:53:19,247 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:53:19,247 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-04-15 00:53:19,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164100847] [2021-04-15 00:53:19,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-04-15 00:53:19,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:53:19,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-04-15 00:53:19,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-04-15 00:53:19,249 INFO L87 Difference]: Start difference. First operand 1149 states and 3269 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:19,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:53:19,326 INFO L93 Difference]: Finished difference Result 1759 states and 5071 transitions. [2021-04-15 00:53:19,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-04-15 00:53:19,327 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-04-15 00:53:19,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:53:19,328 INFO L225 Difference]: With dead ends: 1759 [2021-04-15 00:53:19,328 INFO L226 Difference]: Without dead ends: 789 [2021-04-15 00:53:19,329 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 85.6ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-04-15 00:53:19,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2021-04-15 00:53:19,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 789. [2021-04-15 00:53:19,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 2.813451776649746) internal successors, (2217), 788 states have internal predecessors, (2217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:19,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 2217 transitions. [2021-04-15 00:53:19,342 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 2217 transitions. Word has length 72 [2021-04-15 00:53:19,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:53:19,342 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 2217 transitions. [2021-04-15 00:53:19,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:19,343 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 2217 transitions. [2021-04-15 00:53:19,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-04-15 00:53:19,344 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:53:19,344 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:53:19,344 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-04-15 00:53:19,344 INFO L428 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:53:19,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:53:19,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1722628426, now seen corresponding path program 2 times [2021-04-15 00:53:19,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:53:19,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092818512] [2021-04-15 00:53:19,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:53:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:53:19,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:53:19,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092818512] [2021-04-15 00:53:19,565 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:53:19,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-04-15 00:53:19,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254947895] [2021-04-15 00:53:19,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-04-15 00:53:19,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:53:19,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-04-15 00:53:19,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-04-15 00:53:19,566 INFO L87 Difference]: Start difference. First operand 789 states and 2217 transitions. Second operand has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:19,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:53:19,739 INFO L93 Difference]: Finished difference Result 1219 states and 3475 transitions. [2021-04-15 00:53:19,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-04-15 00:53:19,739 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-04-15 00:53:19,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:53:19,741 INFO L225 Difference]: With dead ends: 1219 [2021-04-15 00:53:19,741 INFO L226 Difference]: Without dead ends: 645 [2021-04-15 00:53:19,743 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 180.0ms TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2021-04-15 00:53:19,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2021-04-15 00:53:19,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 645. [2021-04-15 00:53:19,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 644 states have (on average 2.734472049689441) internal successors, (1761), 644 states have internal predecessors, (1761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:19,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1761 transitions. [2021-04-15 00:53:19,753 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1761 transitions. Word has length 72 [2021-04-15 00:53:19,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:53:19,753 INFO L480 AbstractCegarLoop]: Abstraction has 645 states and 1761 transitions. [2021-04-15 00:53:19,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:53:19,754 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1761 transitions. [2021-04-15 00:53:19,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-04-15 00:53:19,755 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:53:19,755 INFO L551 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-15 00:53:19,755 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-04-15 00:53:19,755 INFO L428 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:53:19,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:53:19,756 INFO L82 PathProgramCache]: Analyzing trace with hash 591163852, now seen corresponding path program 3 times [2021-04-15 00:53:19,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:53:19,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799564988] [2021-04-15 00:53:19,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:53:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-15 00:53:19,792 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-15 00:53:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-15 00:53:19,826 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-15 00:53:19,869 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-04-15 00:53:19,871 INFO L652 BasicCegarLoop]: Counterexample might be feasible [2021-04-15 00:53:19,871 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-04-15 00:53:20,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:53:20 BasicIcfg [2021-04-15 00:53:20,023 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-04-15 00:53:20,023 INFO L168 Benchmark]: Toolchain (without parser) took 12864.76 ms. Allocated memory was 255.9 MB in the beginning and 3.5 GB in the end (delta: 3.2 GB). Free memory was 234.6 MB in the beginning and 2.2 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.2 GB. Max. memory is 16.0 GB. [2021-04-15 00:53:20,023 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 255.9 MB. Free memory was 238.2 MB in the beginning and 238.2 MB in the end (delta: 27.1 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-04-15 00:53:20,024 INFO L168 Benchmark]: CACSL2BoogieTranslator took 552.19 ms. Allocated memory was 255.9 MB in the beginning and 377.5 MB in the end (delta: 121.6 MB). Free memory was 234.0 MB in the beginning and 336.3 MB in the end (delta: -102.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-04-15 00:53:20,024 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.19 ms. Allocated memory is still 377.5 MB. Free memory was 336.3 MB in the beginning and 333.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-04-15 00:53:20,024 INFO L168 Benchmark]: Boogie Preprocessor took 28.43 ms. Allocated memory is still 377.5 MB. Free memory was 333.6 MB in the beginning and 331.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-04-15 00:53:20,024 INFO L168 Benchmark]: RCFGBuilder took 1627.07 ms. Allocated memory is still 377.5 MB. Free memory was 331.5 MB in the beginning and 267.2 MB in the end (delta: 64.2 MB). Peak memory consumption was 66.3 MB. Max. memory is 16.0 GB. [2021-04-15 00:53:20,024 INFO L168 Benchmark]: TraceAbstraction took 10608.91 ms. Allocated memory was 377.5 MB in the beginning and 3.5 GB in the end (delta: 3.1 GB). Free memory was 267.2 MB in the beginning and 2.2 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.1 GB. Max. memory is 16.0 GB. [2021-04-15 00:53:20,025 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.16 ms. Allocated memory is still 255.9 MB. Free memory was 238.2 MB in the beginning and 238.2 MB in the end (delta: 27.1 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 552.19 ms. Allocated memory was 255.9 MB in the beginning and 377.5 MB in the end (delta: 121.6 MB). Free memory was 234.0 MB in the beginning and 336.3 MB in the end (delta: -102.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 43.19 ms. Allocated memory is still 377.5 MB. Free memory was 336.3 MB in the beginning and 333.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 28.43 ms. Allocated memory is still 377.5 MB. Free memory was 333.6 MB in the beginning and 331.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1627.07 ms. Allocated memory is still 377.5 MB. Free memory was 331.5 MB in the beginning and 267.2 MB in the end (delta: 64.2 MB). Peak memory consumption was 66.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 10608.91 ms. Allocated memory was 377.5 MB in the beginning and 3.5 GB in the end (delta: 3.1 GB). Free memory was 267.2 MB in the beginning and 2.2 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.1 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L718] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L719] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L720] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L721] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L722] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L723] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L727] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L728] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L729] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L730] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L731] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L732] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L733] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t1507; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1507, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t1508; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t1508, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t1509; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t1509, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 2 x = 2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L762] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L762] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L764] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L766] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 95 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10367.7ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 178.5ms, AutomataDifference: 3595.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 671.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1894 SDtfs, 2711 SDslu, 7577 SDs, 0 SdLazy, 1053 SolverSat, 197 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1072.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 205 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 2207.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=13393occurred in iteration=0, InterpolantAutomatonStates: 156, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2470.7ms AutomataMinimizationTime, 15 MinimizatonAttempts, 1938 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 58.7ms SsaConstructionTime, 745.4ms SatisfiabilityAnalysisTime, 2227.9ms InterpolantComputationTime, 1023 NumberOfCodeBlocks, 1023 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 936 ConstructedInterpolants, 0 QuantifiedInterpolants, 4700 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...