/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9bbddad6b14272d9691b7fb6f1c011d15ab18596-9bbddad [2021-06-12 17:22:38,183 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-12 17:22:38,185 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-12 17:22:38,220 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-12 17:22:38,221 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-12 17:22:38,223 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-12 17:22:38,225 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-12 17:22:38,231 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-12 17:22:38,233 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-12 17:22:38,236 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-12 17:22:38,237 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-12 17:22:38,239 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-12 17:22:38,239 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-12 17:22:38,241 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-12 17:22:38,242 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-12 17:22:38,243 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-12 17:22:38,246 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-12 17:22:38,246 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-12 17:22:38,249 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-12 17:22:38,254 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-12 17:22:38,255 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-12 17:22:38,257 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-12 17:22:38,258 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-12 17:22:38,260 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-12 17:22:38,266 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-12 17:22:38,267 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-12 17:22:38,267 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-12 17:22:38,268 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-12 17:22:38,269 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-12 17:22:38,269 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-12 17:22:38,270 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-12 17:22:38,270 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-12 17:22:38,271 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-12 17:22:38,272 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-12 17:22:38,273 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-12 17:22:38,273 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-12 17:22:38,274 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-12 17:22:38,274 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-12 17:22:38,274 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-12 17:22:38,275 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-12 17:22:38,275 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-12 17:22:38,279 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-06-12 17:22:38,304 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-12 17:22:38,304 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-12 17:22:38,304 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-12 17:22:38,304 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-12 17:22:38,305 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-12 17:22:38,305 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-12 17:22:38,306 INFO L138 SettingsManager]: * Use SBE=true [2021-06-12 17:22:38,306 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-12 17:22:38,306 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-12 17:22:38,306 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-12 17:22:38,306 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-12 17:22:38,306 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-12 17:22:38,307 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-12 17:22:38,307 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-12 17:22:38,307 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-12 17:22:38,307 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-12 17:22:38,307 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-12 17:22:38,307 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-12 17:22:38,308 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-12 17:22:38,308 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-12 17:22:38,308 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-12 17:22:38,308 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-12 17:22:38,308 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-12 17:22:38,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-12 17:22:38,309 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-12 17:22:38,309 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-12 17:22:38,309 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-12 17:22:38,309 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-12 17:22:38,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-12 17:22:38,309 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-12 17:22:38,310 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-12 17:22:38,310 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-12 17:22:38,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-12 17:22:38,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-12 17:22:38,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-12 17:22:38,644 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-12 17:22:38,645 INFO L275 PluginConnector]: CDTParser initialized [2021-06-12 17:22:38,646 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt.i [2021-06-12 17:22:38,707 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09da6717a/ca3a8b528a804077bd6fb892219d11da/FLAGc9e5836e8 [2021-06-12 17:22:39,191 INFO L306 CDTParser]: Found 1 translation units. [2021-06-12 17:22:39,192 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt.i [2021-06-12 17:22:39,213 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09da6717a/ca3a8b528a804077bd6fb892219d11da/FLAGc9e5836e8 [2021-06-12 17:22:39,519 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09da6717a/ca3a8b528a804077bd6fb892219d11da [2021-06-12 17:22:39,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-12 17:22:39,529 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-12 17:22:39,530 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-12 17:22:39,531 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-12 17:22:39,545 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-12 17:22:39,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.06 05:22:39" (1/1) ... [2021-06-12 17:22:39,546 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cc6b5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:22:39, skipping insertion in model container [2021-06-12 17:22:39,546 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.06 05:22:39" (1/1) ... [2021-06-12 17:22:39,551 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-12 17:22:39,595 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-12 17:22:39,706 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt.i[951,964] [2021-06-12 17:22:39,940 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-12 17:22:39,948 INFO L203 MainTranslator]: Completed pre-run [2021-06-12 17:22:39,957 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt.i[951,964] [2021-06-12 17:22:39,989 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-12 17:22:40,043 INFO L208 MainTranslator]: Completed translation [2021-06-12 17:22:40,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:22:40 WrapperNode [2021-06-12 17:22:40,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-12 17:22:40,045 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-12 17:22:40,045 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-12 17:22:40,045 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-12 17:22:40,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:22:40" (1/1) ... [2021-06-12 17:22:40,063 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:22:40" (1/1) ... [2021-06-12 17:22:40,088 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-12 17:22:40,092 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-12 17:22:40,092 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-12 17:22:40,093 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-12 17:22:40,098 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:22:40" (1/1) ... [2021-06-12 17:22:40,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:22:40" (1/1) ... [2021-06-12 17:22:40,102 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:22:40" (1/1) ... [2021-06-12 17:22:40,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:22:40" (1/1) ... [2021-06-12 17:22:40,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:22:40" (1/1) ... [2021-06-12 17:22:40,113 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:22:40" (1/1) ... [2021-06-12 17:22:40,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:22:40" (1/1) ... [2021-06-12 17:22:40,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-12 17:22:40,127 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-12 17:22:40,127 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-12 17:22:40,127 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-12 17:22:40,128 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:22:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-12 17:22:40,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-12 17:22:40,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-12 17:22:40,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-12 17:22:40,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-12 17:22:40,201 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-12 17:22:40,201 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-12 17:22:40,201 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-12 17:22:40,201 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-12 17:22:40,201 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-12 17:22:40,201 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-12 17:22:40,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-12 17:22:40,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-12 17:22:40,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-12 17:22:40,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-12 17:22:40,203 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-12 17:22:41,622 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-12 17:22:41,622 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-12 17:22:41,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 05:22:41 BoogieIcfgContainer [2021-06-12 17:22:41,624 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-12 17:22:41,626 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-12 17:22:41,626 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-12 17:22:41,629 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-12 17:22:41,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.06 05:22:39" (1/3) ... [2021-06-12 17:22:41,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ff9fa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.06 05:22:41, skipping insertion in model container [2021-06-12 17:22:41,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:22:40" (2/3) ... [2021-06-12 17:22:41,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ff9fa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.06 05:22:41, skipping insertion in model container [2021-06-12 17:22:41,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 05:22:41" (3/3) ... [2021-06-12 17:22:41,632 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_power.opt.i [2021-06-12 17:22:41,638 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-12 17:22:41,638 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-12 17:22:41,638 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-12 17:22:41,639 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-12 17:22:41,676 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,676 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,676 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,676 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,676 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,677 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,677 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,677 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,677 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,677 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,677 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,678 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,678 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,678 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,679 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,679 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,679 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,679 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,679 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,679 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,679 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,680 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,680 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,681 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,681 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,681 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,681 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,681 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,683 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,683 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,683 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,683 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,683 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,684 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,684 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,684 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,684 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,685 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,685 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,685 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,685 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,685 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,685 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,685 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,686 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,686 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,686 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,686 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,686 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,687 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,687 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,687 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,687 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,687 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,687 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,687 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,688 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,688 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,688 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,688 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,689 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,689 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,689 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,689 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,689 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,690 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,690 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,690 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,690 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,693 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,694 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,694 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,694 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,694 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,694 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,694 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,695 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,695 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,696 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,697 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,697 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,698 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,698 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,699 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,700 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,700 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,700 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,701 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,701 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,701 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,701 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,702 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,704 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:22:41,705 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-12 17:22:41,726 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-12 17:22:41,750 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 17:22:41,750 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 17:22:41,751 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 17:22:41,751 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 17:22:41,751 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 17:22:41,751 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 17:22:41,751 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 17:22:41,751 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P2Thread1of1ForFork0======== [2021-06-12 17:22:41,761 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 104 transitions, 223 flow [2021-06-12 17:22:42,613 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 14087 states, 14083 states have (on average 3.6198963289071933) internal successors, (50979), 14086 states have internal predecessors, (50979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:42,640 INFO L276 IsEmpty]: Start isEmpty. Operand has 14087 states, 14083 states have (on average 3.6198963289071933) internal successors, (50979), 14086 states have internal predecessors, (50979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:42,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-12 17:22:42,664 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:22:42,665 INFO L472 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] [2021-06-12 17:22:42,665 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:22:42,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:22:42,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1699461236, now seen corresponding path program 1 times [2021-06-12 17:22:42,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:22:42,676 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613183857] [2021-06-12 17:22:42,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:22:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:22:42,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:22:42,999 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:22:43,000 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613183857] [2021-06-12 17:22:43,000 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613183857] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:22:43,000 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:22:43,001 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-12 17:22:43,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417289362] [2021-06-12 17:22:43,004 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-12 17:22:43,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:22:43,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-12 17:22:43,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 17:22:43,040 INFO L87 Difference]: Start difference. First operand has 14087 states, 14083 states have (on average 3.6198963289071933) internal successors, (50979), 14086 states have internal predecessors, (50979), 0 states have call successors, (0), 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 27.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:43,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:22:43,338 INFO L93 Difference]: Finished difference Result 12127 states and 42768 transitions. [2021-06-12 17:22:43,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-12 17:22:43,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2021-06-12 17:22:43,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:22:43,348 INFO L225 Difference]: With dead ends: 12127 [2021-06-12 17:22:43,348 INFO L226 Difference]: Without dead ends: 0 [2021-06-12 17:22:43,349 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 17:22:43,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-12 17:22:43,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-12 17:22:43,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:43,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-12 17:22:43,369 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2021-06-12 17:22:43,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:22:43,369 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-12 17:22:43,369 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:43,370 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-12 17:22:43,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-12 17:22:43,370 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-12 17:22:43,371 INFO L301 ceAbstractionStarter]: Result for error location P2Thread1of1ForFork0 was SAFE (1/3) [2021-06-12 17:22:43,373 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-12 17:22:43,376 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 17:22:43,376 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 17:22:43,376 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 17:22:43,377 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 17:22:43,377 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 17:22:43,377 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 17:22:43,377 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 17:22:43,377 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P2======== [2021-06-12 17:22:43,380 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 104 transitions, 223 flow [2021-06-12 17:22:43,914 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 14087 states, 14083 states have (on average 3.6198963289071933) internal successors, (50979), 14086 states have internal predecessors, (50979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:43,934 INFO L276 IsEmpty]: Start isEmpty. Operand has 14087 states, 14083 states have (on average 3.6198963289071933) internal successors, (50979), 14086 states have internal predecessors, (50979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:44,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-12 17:22:44,022 INFO L301 ceAbstractionStarter]: Result for error location P2 was SAFE (2/3) [2021-06-12 17:22:44,024 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-12 17:22:44,024 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 17:22:44,024 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 17:22:44,025 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 17:22:44,025 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 17:22:44,025 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 17:22:44,025 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 17:22:44,025 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 17:22:44,025 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-12 17:22:44,026 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 104 transitions, 223 flow [2021-06-12 17:22:44,548 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 14087 states, 14083 states have (on average 3.6198963289071933) internal successors, (50979), 14086 states have internal predecessors, (50979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:44,566 INFO L276 IsEmpty]: Start isEmpty. Operand has 14087 states, 14083 states have (on average 3.6198963289071933) internal successors, (50979), 14086 states have internal predecessors, (50979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:44,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-06-12 17:22:44,578 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:22:44,578 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 17:22:44,578 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:22:44,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:22:44,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1498850709, now seen corresponding path program 1 times [2021-06-12 17:22:44,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:22:44,579 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078869650] [2021-06-12 17:22:44,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:22:44,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:22:44,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:22:44,802 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:22:44,803 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078869650] [2021-06-12 17:22:44,803 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078869650] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:22:44,803 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:22:44,803 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 17:22:44,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262566421] [2021-06-12 17:22:44,804 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 17:22:44,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:22:44,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 17:22:44,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-12 17:22:44,823 INFO L87 Difference]: Start difference. First operand has 14087 states, 14083 states have (on average 3.6198963289071933) internal successors, (50979), 14086 states have internal predecessors, (50979), 0 states have call successors, (0), 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 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:45,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:22:45,193 INFO L93 Difference]: Finished difference Result 19775 states and 69886 transitions. [2021-06-12 17:22:45,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-12 17:22:45,193 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-06-12 17:22:45,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:22:45,277 INFO L225 Difference]: With dead ends: 19775 [2021-06-12 17:22:45,277 INFO L226 Difference]: Without dead ends: 7715 [2021-06-12 17:22:45,277 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 99.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-12 17:22:45,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7715 states. [2021-06-12 17:22:45,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7715 to 7715. [2021-06-12 17:22:45,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7715 states, 7713 states have (on average 3.4760793465577597) internal successors, (26811), 7714 states have internal predecessors, (26811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:45,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7715 states to 7715 states and 26811 transitions. [2021-06-12 17:22:45,693 INFO L78 Accepts]: Start accepts. Automaton has 7715 states and 26811 transitions. Word has length 66 [2021-06-12 17:22:45,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:22:45,694 INFO L482 AbstractCegarLoop]: Abstraction has 7715 states and 26811 transitions. [2021-06-12 17:22:45,695 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:45,695 INFO L276 IsEmpty]: Start isEmpty. Operand 7715 states and 26811 transitions. [2021-06-12 17:22:45,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-12 17:22:45,718 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:22:45,718 INFO L472 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-06-12 17:22:45,718 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-12 17:22:45,719 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:22:45,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:22:45,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1135028906, now seen corresponding path program 1 times [2021-06-12 17:22:45,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:22:45,723 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640901168] [2021-06-12 17:22:45,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:22:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:22:45,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:22:45,869 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:22:45,869 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640901168] [2021-06-12 17:22:45,869 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640901168] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:22:45,869 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:22:45,869 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 17:22:45,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484322543] [2021-06-12 17:22:45,871 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 17:22:45,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:22:45,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 17:22:45,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-12 17:22:45,871 INFO L87 Difference]: Start difference. First operand 7715 states and 26811 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 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-06-12 17:22:46,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:22:46,042 INFO L93 Difference]: Finished difference Result 8939 states and 30789 transitions. [2021-06-12 17:22:46,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-12 17:22:46,042 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 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-06-12 17:22:46,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:22:46,100 INFO L225 Difference]: With dead ends: 8939 [2021-06-12 17:22:46,100 INFO L226 Difference]: Without dead ends: 7427 [2021-06-12 17:22:46,101 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 94.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-12 17:22:46,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7427 states. [2021-06-12 17:22:46,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7427 to 7427. [2021-06-12 17:22:46,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7427 states, 7425 states have (on average 3.462222222222222) internal successors, (25707), 7426 states have internal predecessors, (25707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:46,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7427 states to 7427 states and 25707 transitions. [2021-06-12 17:22:46,415 INFO L78 Accepts]: Start accepts. Automaton has 7427 states and 25707 transitions. Word has length 68 [2021-06-12 17:22:46,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:22:46,417 INFO L482 AbstractCegarLoop]: Abstraction has 7427 states and 25707 transitions. [2021-06-12 17:22:46,417 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 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-06-12 17:22:46,417 INFO L276 IsEmpty]: Start isEmpty. Operand 7427 states and 25707 transitions. [2021-06-12 17:22:46,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-06-12 17:22:46,430 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:22:46,430 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 17:22:46,430 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-12 17:22:46,430 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:22:46,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:22:46,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1573199234, now seen corresponding path program 1 times [2021-06-12 17:22:46,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:22:46,431 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892258862] [2021-06-12 17:22:46,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:22:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:22:46,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:22:46,619 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:22:46,619 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892258862] [2021-06-12 17:22:46,619 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892258862] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:22:46,619 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:22:46,620 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 17:22:46,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459184328] [2021-06-12 17:22:46,621 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 17:22:46,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:22:46,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 17:22:46,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-12 17:22:46,621 INFO L87 Difference]: Start difference. First operand 7427 states and 25707 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:46,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:22:46,811 INFO L93 Difference]: Finished difference Result 12419 states and 42219 transitions. [2021-06-12 17:22:46,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-12 17:22:46,811 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-06-12 17:22:46,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:22:46,841 INFO L225 Difference]: With dead ends: 12419 [2021-06-12 17:22:46,842 INFO L226 Difference]: Without dead ends: 8291 [2021-06-12 17:22:46,842 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 102.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-12 17:22:46,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8291 states. [2021-06-12 17:22:47,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8291 to 6995. [2021-06-12 17:22:47,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6995 states, 6993 states have (on average 3.3758043758043756) internal successors, (23607), 6994 states have internal predecessors, (23607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:47,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6995 states to 6995 states and 23607 transitions. [2021-06-12 17:22:47,214 INFO L78 Accepts]: Start accepts. Automaton has 6995 states and 23607 transitions. Word has length 69 [2021-06-12 17:22:47,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:22:47,215 INFO L482 AbstractCegarLoop]: Abstraction has 6995 states and 23607 transitions. [2021-06-12 17:22:47,215 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:47,215 INFO L276 IsEmpty]: Start isEmpty. Operand 6995 states and 23607 transitions. [2021-06-12 17:22:47,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-06-12 17:22:47,226 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:22:47,226 INFO L472 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] [2021-06-12 17:22:47,227 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-12 17:22:47,227 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:22:47,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:22:47,227 INFO L82 PathProgramCache]: Analyzing trace with hash -789215593, now seen corresponding path program 1 times [2021-06-12 17:22:47,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:22:47,228 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296638703] [2021-06-12 17:22:47,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:22:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:22:47,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:22:47,485 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:22:47,485 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296638703] [2021-06-12 17:22:47,486 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296638703] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:22:47,486 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:22:47,486 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-12 17:22:47,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651362827] [2021-06-12 17:22:47,486 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-12 17:22:47,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:22:47,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-12 17:22:47,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-12 17:22:47,488 INFO L87 Difference]: Start difference. First operand 6995 states and 23607 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:47,713 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2021-06-12 17:22:47,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:22:47,939 INFO L93 Difference]: Finished difference Result 8153 states and 27362 transitions. [2021-06-12 17:22:47,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-12 17:22:47,940 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2021-06-12 17:22:47,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:22:47,968 INFO L225 Difference]: With dead ends: 8153 [2021-06-12 17:22:47,968 INFO L226 Difference]: Without dead ends: 6833 [2021-06-12 17:22:47,968 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 330.5ms TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2021-06-12 17:22:47,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6833 states. [2021-06-12 17:22:48,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6833 to 6833. [2021-06-12 17:22:48,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6833 states, 6831 states have (on average 3.365393061045235) internal successors, (22989), 6832 states have internal predecessors, (22989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:48,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6833 states to 6833 states and 22989 transitions. [2021-06-12 17:22:48,150 INFO L78 Accepts]: Start accepts. Automaton has 6833 states and 22989 transitions. Word has length 70 [2021-06-12 17:22:48,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:22:48,150 INFO L482 AbstractCegarLoop]: Abstraction has 6833 states and 22989 transitions. [2021-06-12 17:22:48,150 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:48,151 INFO L276 IsEmpty]: Start isEmpty. Operand 6833 states and 22989 transitions. [2021-06-12 17:22:48,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-12 17:22:48,161 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:22:48,162 INFO L472 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] [2021-06-12 17:22:48,162 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-12 17:22:48,162 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:22:48,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:22:48,162 INFO L82 PathProgramCache]: Analyzing trace with hash -646375001, now seen corresponding path program 1 times [2021-06-12 17:22:48,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:22:48,163 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249582984] [2021-06-12 17:22:48,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:22:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:22:48,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:22:48,340 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:22:48,340 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249582984] [2021-06-12 17:22:48,340 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249582984] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:22:48,340 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:22:48,340 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-12 17:22:48,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113970268] [2021-06-12 17:22:48,345 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-12 17:22:48,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:22:48,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-12 17:22:48,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-12 17:22:48,348 INFO L87 Difference]: Start difference. First operand 6833 states and 22989 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:48,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:22:48,766 INFO L93 Difference]: Finished difference Result 6919 states and 23040 transitions. [2021-06-12 17:22:48,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-12 17:22:48,767 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2021-06-12 17:22:48,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:22:48,792 INFO L225 Difference]: With dead ends: 6919 [2021-06-12 17:22:48,792 INFO L226 Difference]: Without dead ends: 6119 [2021-06-12 17:22:48,793 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 305.0ms TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2021-06-12 17:22:48,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6119 states. [2021-06-12 17:22:48,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6119 to 6119. [2021-06-12 17:22:48,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6119 states, 6118 states have (on average 3.3425956194834914) internal successors, (20450), 6118 states have internal predecessors, (20450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:48,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6119 states to 6119 states and 20450 transitions. [2021-06-12 17:22:48,943 INFO L78 Accepts]: Start accepts. Automaton has 6119 states and 20450 transitions. Word has length 71 [2021-06-12 17:22:48,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:22:48,944 INFO L482 AbstractCegarLoop]: Abstraction has 6119 states and 20450 transitions. [2021-06-12 17:22:48,944 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:48,944 INFO L276 IsEmpty]: Start isEmpty. Operand 6119 states and 20450 transitions. [2021-06-12 17:22:48,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-12 17:22:48,954 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:22:48,955 INFO L472 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-06-12 17:22:48,955 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-12 17:22:48,955 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:22:48,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:22:48,955 INFO L82 PathProgramCache]: Analyzing trace with hash -860155308, now seen corresponding path program 1 times [2021-06-12 17:22:48,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:22:48,956 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61222894] [2021-06-12 17:22:48,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:22:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:22:49,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:22:49,117 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:22:49,118 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61222894] [2021-06-12 17:22:49,118 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61222894] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:22:49,118 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:22:49,118 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-12 17:22:49,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195477199] [2021-06-12 17:22:49,118 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-12 17:22:49,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:22:49,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-12 17:22:49,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-12 17:22:49,119 INFO L87 Difference]: Start difference. First operand 6119 states and 20450 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 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-06-12 17:22:49,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:22:49,340 INFO L93 Difference]: Finished difference Result 6519 states and 21670 transitions. [2021-06-12 17:22:49,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-12 17:22:49,341 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 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-06-12 17:22:49,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:22:49,359 INFO L225 Difference]: With dead ends: 6519 [2021-06-12 17:22:49,359 INFO L226 Difference]: Without dead ends: 5879 [2021-06-12 17:22:49,359 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 144.6ms TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-06-12 17:22:49,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5879 states. [2021-06-12 17:22:49,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5879 to 5879. [2021-06-12 17:22:49,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5879 states, 5878 states have (on average 3.3341272541680844) internal successors, (19598), 5878 states have internal predecessors, (19598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:49,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5879 states to 5879 states and 19598 transitions. [2021-06-12 17:22:49,592 INFO L78 Accepts]: Start accepts. Automaton has 5879 states and 19598 transitions. Word has length 72 [2021-06-12 17:22:49,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:22:49,592 INFO L482 AbstractCegarLoop]: Abstraction has 5879 states and 19598 transitions. [2021-06-12 17:22:49,592 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 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-06-12 17:22:49,592 INFO L276 IsEmpty]: Start isEmpty. Operand 5879 states and 19598 transitions. [2021-06-12 17:22:49,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-12 17:22:49,602 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:22:49,602 INFO L472 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-06-12 17:22:49,603 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-12 17:22:49,603 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:22:49,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:22:49,603 INFO L82 PathProgramCache]: Analyzing trace with hash 2031589724, now seen corresponding path program 1 times [2021-06-12 17:22:49,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:22:49,603 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592442349] [2021-06-12 17:22:49,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:22:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:22:49,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:22:49,683 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:22:49,683 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592442349] [2021-06-12 17:22:49,683 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592442349] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:22:49,683 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:22:49,683 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 17:22:49,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099049677] [2021-06-12 17:22:49,684 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 17:22:49,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:22:49,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 17:22:49,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-12 17:22:49,684 INFO L87 Difference]: Start difference. First operand 5879 states and 19598 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 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-06-12 17:22:49,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:22:49,819 INFO L93 Difference]: Finished difference Result 9473 states and 31211 transitions. [2021-06-12 17:22:49,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-12 17:22:49,819 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 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-06-12 17:22:49,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:22:49,838 INFO L225 Difference]: With dead ends: 9473 [2021-06-12 17:22:49,838 INFO L226 Difference]: Without dead ends: 6281 [2021-06-12 17:22:49,838 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 86.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-12 17:22:49,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6281 states. [2021-06-12 17:22:49,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6281 to 5531. [2021-06-12 17:22:49,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5531 states, 5530 states have (on average 3.250994575045208) internal successors, (17978), 5530 states have internal predecessors, (17978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:49,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5531 states to 5531 states and 17978 transitions. [2021-06-12 17:22:49,974 INFO L78 Accepts]: Start accepts. Automaton has 5531 states and 17978 transitions. Word has length 72 [2021-06-12 17:22:49,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:22:49,975 INFO L482 AbstractCegarLoop]: Abstraction has 5531 states and 17978 transitions. [2021-06-12 17:22:49,975 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 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-06-12 17:22:49,975 INFO L276 IsEmpty]: Start isEmpty. Operand 5531 states and 17978 transitions. [2021-06-12 17:22:49,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-12 17:22:49,985 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:22:49,985 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 17:22:49,985 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-12 17:22:49,985 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:22:49,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:22:49,986 INFO L82 PathProgramCache]: Analyzing trace with hash 2117553635, now seen corresponding path program 1 times [2021-06-12 17:22:49,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:22:49,986 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865407335] [2021-06-12 17:22:49,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:22:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:22:50,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:22:50,142 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:22:50,142 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865407335] [2021-06-12 17:22:50,142 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865407335] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:22:50,142 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:22:50,142 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-12 17:22:50,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076567680] [2021-06-12 17:22:50,142 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-12 17:22:50,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:22:50,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-12 17:22:50,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-06-12 17:22:50,143 INFO L87 Difference]: Start difference. First operand 5531 states and 17978 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:50,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:22:50,483 INFO L93 Difference]: Finished difference Result 6235 states and 20210 transitions. [2021-06-12 17:22:50,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-12 17:22:50,485 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2021-06-12 17:22:50,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:22:50,502 INFO L225 Difference]: With dead ends: 6235 [2021-06-12 17:22:50,502 INFO L226 Difference]: Without dead ends: 5635 [2021-06-12 17:22:50,502 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 235.3ms TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2021-06-12 17:22:50,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5635 states. [2021-06-12 17:22:50,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5635 to 5635. [2021-06-12 17:22:50,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5635 states, 5634 states have (on average 3.247071352502662) internal successors, (18294), 5634 states have internal predecessors, (18294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:50,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5635 states to 5635 states and 18294 transitions. [2021-06-12 17:22:50,649 INFO L78 Accepts]: Start accepts. Automaton has 5635 states and 18294 transitions. Word has length 73 [2021-06-12 17:22:50,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:22:50,649 INFO L482 AbstractCegarLoop]: Abstraction has 5635 states and 18294 transitions. [2021-06-12 17:22:50,649 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:50,649 INFO L276 IsEmpty]: Start isEmpty. Operand 5635 states and 18294 transitions. [2021-06-12 17:22:50,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-12 17:22:50,660 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:22:50,660 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 17:22:50,660 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-12 17:22:50,660 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:22:50,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:22:50,661 INFO L82 PathProgramCache]: Analyzing trace with hash -511051197, now seen corresponding path program 2 times [2021-06-12 17:22:50,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:22:50,661 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679813193] [2021-06-12 17:22:50,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:22:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:22:50,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:22:50,909 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:22:50,909 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679813193] [2021-06-12 17:22:50,909 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679813193] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:22:50,910 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:22:50,910 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-12 17:22:50,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576832681] [2021-06-12 17:22:50,910 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-12 17:22:50,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:22:50,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-12 17:22:50,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-06-12 17:22:50,911 INFO L87 Difference]: Start difference. First operand 5635 states and 18294 transitions. Second operand has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:51,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:22:51,385 INFO L93 Difference]: Finished difference Result 6765 states and 21806 transitions. [2021-06-12 17:22:51,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-12 17:22:51,386 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2021-06-12 17:22:51,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:22:51,399 INFO L225 Difference]: With dead ends: 6765 [2021-06-12 17:22:51,399 INFO L226 Difference]: Without dead ends: 5325 [2021-06-12 17:22:51,400 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 373.4ms TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2021-06-12 17:22:51,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5325 states. [2021-06-12 17:22:51,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5325 to 5301. [2021-06-12 17:22:51,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5301 states, 5300 states have (on average 3.23) internal successors, (17119), 5300 states have internal predecessors, (17119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:51,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5301 states to 5301 states and 17119 transitions. [2021-06-12 17:22:51,542 INFO L78 Accepts]: Start accepts. Automaton has 5301 states and 17119 transitions. Word has length 73 [2021-06-12 17:22:51,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:22:51,542 INFO L482 AbstractCegarLoop]: Abstraction has 5301 states and 17119 transitions. [2021-06-12 17:22:51,543 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:51,543 INFO L276 IsEmpty]: Start isEmpty. Operand 5301 states and 17119 transitions. [2021-06-12 17:22:51,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-12 17:22:51,552 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:22:51,552 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 17:22:51,552 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-12 17:22:51,553 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:22:51,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:22:51,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1016703129, now seen corresponding path program 3 times [2021-06-12 17:22:51,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:22:51,553 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77629364] [2021-06-12 17:22:51,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:22:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:22:51,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:22:51,747 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:22:51,747 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77629364] [2021-06-12 17:22:51,747 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77629364] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:22:51,749 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:22:51,749 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-12 17:22:51,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127786336] [2021-06-12 17:22:51,749 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-12 17:22:51,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:22:51,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-12 17:22:51,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-12 17:22:51,750 INFO L87 Difference]: Start difference. First operand 5301 states and 17119 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:52,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:22:52,152 INFO L93 Difference]: Finished difference Result 6293 states and 20346 transitions. [2021-06-12 17:22:52,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-12 17:22:52,152 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2021-06-12 17:22:52,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:22:52,168 INFO L225 Difference]: With dead ends: 6293 [2021-06-12 17:22:52,168 INFO L226 Difference]: Without dead ends: 5613 [2021-06-12 17:22:52,168 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 288.2ms TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-06-12 17:22:52,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5613 states. [2021-06-12 17:22:52,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5613 to 5403. [2021-06-12 17:22:52,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5403 states, 5402 states have (on average 3.2317660125879306) internal successors, (17458), 5402 states have internal predecessors, (17458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:52,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5403 states to 5403 states and 17458 transitions. [2021-06-12 17:22:52,310 INFO L78 Accepts]: Start accepts. Automaton has 5403 states and 17458 transitions. Word has length 73 [2021-06-12 17:22:52,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:22:52,311 INFO L482 AbstractCegarLoop]: Abstraction has 5403 states and 17458 transitions. [2021-06-12 17:22:52,311 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:52,311 INFO L276 IsEmpty]: Start isEmpty. Operand 5403 states and 17458 transitions. [2021-06-12 17:22:52,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-12 17:22:52,321 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:22:52,321 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 17:22:52,321 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-12 17:22:52,321 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:22:52,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:22:52,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1077713512, now seen corresponding path program 1 times [2021-06-12 17:22:52,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:22:52,322 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015192365] [2021-06-12 17:22:52,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:22:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:22:52,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:22:52,589 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:22:52,589 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015192365] [2021-06-12 17:22:52,589 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015192365] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:22:52,589 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:22:52,589 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-12 17:22:52,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886180820] [2021-06-12 17:22:52,590 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-12 17:22:52,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:22:52,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-12 17:22:52,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-06-12 17:22:52,591 INFO L87 Difference]: Start difference. First operand 5403 states and 17458 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:52,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:22:52,881 INFO L93 Difference]: Finished difference Result 6347 states and 20314 transitions. [2021-06-12 17:22:52,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-12 17:22:52,882 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2021-06-12 17:22:52,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:22:52,892 INFO L225 Difference]: With dead ends: 6347 [2021-06-12 17:22:52,892 INFO L226 Difference]: Without dead ends: 5632 [2021-06-12 17:22:52,893 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 276.4ms TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2021-06-12 17:22:52,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5632 states. [2021-06-12 17:22:53,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5632 to 5452. [2021-06-12 17:22:53,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5452 states, 5451 states have (on average 3.2241790497156484) internal successors, (17575), 5451 states have internal predecessors, (17575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:53,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5452 states to 5452 states and 17575 transitions. [2021-06-12 17:22:53,027 INFO L78 Accepts]: Start accepts. Automaton has 5452 states and 17575 transitions. Word has length 74 [2021-06-12 17:22:53,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:22:53,028 INFO L482 AbstractCegarLoop]: Abstraction has 5452 states and 17575 transitions. [2021-06-12 17:22:53,028 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:53,028 INFO L276 IsEmpty]: Start isEmpty. Operand 5452 states and 17575 transitions. [2021-06-12 17:22:53,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-12 17:22:53,037 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:22:53,037 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 17:22:53,037 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-12 17:22:53,037 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:22:53,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:22:53,038 INFO L82 PathProgramCache]: Analyzing trace with hash -960084680, now seen corresponding path program 2 times [2021-06-12 17:22:53,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:22:53,038 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862594668] [2021-06-12 17:22:53,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:22:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:22:53,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:22:53,334 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:22:53,334 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862594668] [2021-06-12 17:22:53,334 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862594668] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:22:53,334 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:22:53,334 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-12 17:22:53,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291799521] [2021-06-12 17:22:53,334 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-12 17:22:53,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:22:53,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-12 17:22:53,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-06-12 17:22:53,335 INFO L87 Difference]: Start difference. First operand 5452 states and 17575 transitions. Second operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:53,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:22:53,729 INFO L93 Difference]: Finished difference Result 6162 states and 19786 transitions. [2021-06-12 17:22:53,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-12 17:22:53,730 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2021-06-12 17:22:53,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:22:53,740 INFO L225 Difference]: With dead ends: 6162 [2021-06-12 17:22:53,740 INFO L226 Difference]: Without dead ends: 5532 [2021-06-12 17:22:53,741 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 417.3ms TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2021-06-12 17:22:53,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5532 states. [2021-06-12 17:22:53,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5532 to 5323. [2021-06-12 17:22:53,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5323 states, 5322 states have (on average 3.2290492296129276) internal successors, (17185), 5322 states have internal predecessors, (17185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:53,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5323 states to 5323 states and 17185 transitions. [2021-06-12 17:22:53,873 INFO L78 Accepts]: Start accepts. Automaton has 5323 states and 17185 transitions. Word has length 74 [2021-06-12 17:22:53,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:22:53,873 INFO L482 AbstractCegarLoop]: Abstraction has 5323 states and 17185 transitions. [2021-06-12 17:22:53,873 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:53,873 INFO L276 IsEmpty]: Start isEmpty. Operand 5323 states and 17185 transitions. [2021-06-12 17:22:53,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-12 17:22:53,882 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:22:53,882 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 17:22:53,882 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-12 17:22:53,882 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:22:53,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:22:53,883 INFO L82 PathProgramCache]: Analyzing trace with hash 544574612, now seen corresponding path program 3 times [2021-06-12 17:22:53,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:22:53,883 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668176206] [2021-06-12 17:22:53,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:22:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:22:54,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:22:54,118 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:22:54,118 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668176206] [2021-06-12 17:22:54,118 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668176206] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:22:54,118 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:22:54,118 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-12 17:22:54,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714368511] [2021-06-12 17:22:54,119 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-12 17:22:54,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:22:54,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-12 17:22:54,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-12 17:22:54,120 INFO L87 Difference]: Start difference. First operand 5323 states and 17185 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:54,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:22:54,378 INFO L93 Difference]: Finished difference Result 7509 states and 24067 transitions. [2021-06-12 17:22:54,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-12 17:22:54,378 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2021-06-12 17:22:54,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:22:54,394 INFO L225 Difference]: With dead ends: 7509 [2021-06-12 17:22:54,394 INFO L226 Difference]: Without dead ends: 6819 [2021-06-12 17:22:54,394 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 226.6ms TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2021-06-12 17:22:54,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6819 states. [2021-06-12 17:22:54,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6819 to 5298. [2021-06-12 17:22:54,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5298 states, 5297 states have (on average 3.2199358127241835) internal successors, (17056), 5297 states have internal predecessors, (17056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:54,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5298 states to 5298 states and 17056 transitions. [2021-06-12 17:22:54,538 INFO L78 Accepts]: Start accepts. Automaton has 5298 states and 17056 transitions. Word has length 74 [2021-06-12 17:22:54,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:22:54,538 INFO L482 AbstractCegarLoop]: Abstraction has 5298 states and 17056 transitions. [2021-06-12 17:22:54,538 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:54,538 INFO L276 IsEmpty]: Start isEmpty. Operand 5298 states and 17056 transitions. [2021-06-12 17:22:54,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-12 17:22:54,547 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:22:54,547 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 17:22:54,547 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-12 17:22:54,547 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:22:54,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:22:54,548 INFO L82 PathProgramCache]: Analyzing trace with hash 146367498, now seen corresponding path program 4 times [2021-06-12 17:22:54,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:22:54,548 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878688271] [2021-06-12 17:22:54,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:22:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:22:54,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:22:54,786 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:22:54,786 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878688271] [2021-06-12 17:22:54,786 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878688271] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:22:54,786 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:22:54,786 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-12 17:22:54,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379632927] [2021-06-12 17:22:54,787 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-12 17:22:54,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:22:54,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-12 17:22:54,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-06-12 17:22:54,788 INFO L87 Difference]: Start difference. First operand 5298 states and 17056 transitions. Second operand has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:55,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:22:55,045 INFO L93 Difference]: Finished difference Result 7491 states and 23902 transitions. [2021-06-12 17:22:55,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-12 17:22:55,046 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2021-06-12 17:22:55,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:22:55,056 INFO L225 Difference]: With dead ends: 7491 [2021-06-12 17:22:55,057 INFO L226 Difference]: Without dead ends: 4706 [2021-06-12 17:22:55,057 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 241.5ms TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2021-06-12 17:22:55,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4706 states. [2021-06-12 17:22:55,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4706 to 3836. [2021-06-12 17:22:55,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3836 states, 3835 states have (on average 3.1994784876140807) internal successors, (12270), 3835 states have internal predecessors, (12270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:55,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3836 states to 3836 states and 12270 transitions. [2021-06-12 17:22:55,156 INFO L78 Accepts]: Start accepts. Automaton has 3836 states and 12270 transitions. Word has length 74 [2021-06-12 17:22:55,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:22:55,156 INFO L482 AbstractCegarLoop]: Abstraction has 3836 states and 12270 transitions. [2021-06-12 17:22:55,157 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:55,157 INFO L276 IsEmpty]: Start isEmpty. Operand 3836 states and 12270 transitions. [2021-06-12 17:22:55,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-12 17:22:55,163 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:22:55,163 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 17:22:55,163 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-12 17:22:55,163 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:22:55,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:22:55,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1790156746, now seen corresponding path program 1 times [2021-06-12 17:22:55,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:22:55,164 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601783810] [2021-06-12 17:22:55,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:22:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:22:55,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:22:55,253 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:22:55,253 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601783810] [2021-06-12 17:22:55,255 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601783810] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:22:55,255 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:22:55,255 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 17:22:55,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639572754] [2021-06-12 17:22:55,256 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 17:22:55,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:22:55,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 17:22:55,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-12 17:22:55,257 INFO L87 Difference]: Start difference. First operand 3836 states and 12270 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:55,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:22:55,377 INFO L93 Difference]: Finished difference Result 4692 states and 14710 transitions. [2021-06-12 17:22:55,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-12 17:22:55,378 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2021-06-12 17:22:55,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:22:55,385 INFO L225 Difference]: With dead ends: 4692 [2021-06-12 17:22:55,385 INFO L226 Difference]: Without dead ends: 3380 [2021-06-12 17:22:55,387 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 87.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-12 17:22:55,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3380 states. [2021-06-12 17:22:55,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3380 to 3380. [2021-06-12 17:22:55,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3380 states, 3379 states have (on average 3.1358390056229655) internal successors, (10596), 3379 states have internal predecessors, (10596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:55,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3380 states to 3380 states and 10596 transitions. [2021-06-12 17:22:55,446 INFO L78 Accepts]: Start accepts. Automaton has 3380 states and 10596 transitions. Word has length 74 [2021-06-12 17:22:55,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:22:55,446 INFO L482 AbstractCegarLoop]: Abstraction has 3380 states and 10596 transitions. [2021-06-12 17:22:55,446 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:55,446 INFO L276 IsEmpty]: Start isEmpty. Operand 3380 states and 10596 transitions. [2021-06-12 17:22:55,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-06-12 17:22:55,450 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:22:55,450 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 17:22:55,451 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-12 17:22:55,451 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:22:55,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:22:55,451 INFO L82 PathProgramCache]: Analyzing trace with hash 178190096, now seen corresponding path program 1 times [2021-06-12 17:22:55,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:22:55,451 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919454845] [2021-06-12 17:22:55,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:22:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:22:55,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:22:55,540 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:22:55,541 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919454845] [2021-06-12 17:22:55,541 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919454845] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:22:55,541 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:22:55,541 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-12 17:22:55,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778153604] [2021-06-12 17:22:55,541 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-12 17:22:55,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:22:55,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-12 17:22:55,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-12 17:22:55,542 INFO L87 Difference]: Start difference. First operand 3380 states and 10596 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:55,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:22:55,666 INFO L93 Difference]: Finished difference Result 3422 states and 10426 transitions. [2021-06-12 17:22:55,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-12 17:22:55,666 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2021-06-12 17:22:55,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:22:55,670 INFO L225 Difference]: With dead ends: 3422 [2021-06-12 17:22:55,670 INFO L226 Difference]: Without dead ends: 2354 [2021-06-12 17:22:55,670 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 98.4ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-06-12 17:22:55,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2354 states. [2021-06-12 17:22:55,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2354 to 2354. [2021-06-12 17:22:55,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2354 states, 2353 states have (on average 3.008924776880578) internal successors, (7080), 2353 states have internal predecessors, (7080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:55,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2354 states to 2354 states and 7080 transitions. [2021-06-12 17:22:55,700 INFO L78 Accepts]: Start accepts. Automaton has 2354 states and 7080 transitions. Word has length 75 [2021-06-12 17:22:55,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:22:55,700 INFO L482 AbstractCegarLoop]: Abstraction has 2354 states and 7080 transitions. [2021-06-12 17:22:55,700 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:55,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2354 states and 7080 transitions. [2021-06-12 17:22:55,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-12 17:22:55,703 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:22:55,703 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 17:22:55,703 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-12 17:22:55,703 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:22:55,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:22:55,703 INFO L82 PathProgramCache]: Analyzing trace with hash 649217767, now seen corresponding path program 1 times [2021-06-12 17:22:55,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:22:55,704 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538157892] [2021-06-12 17:22:55,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:22:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:22:55,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:22:55,784 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:22:55,784 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538157892] [2021-06-12 17:22:55,784 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538157892] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:22:55,784 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:22:55,785 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-12 17:22:55,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620339851] [2021-06-12 17:22:55,785 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-12 17:22:55,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:22:55,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-12 17:22:55,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-12 17:22:55,786 INFO L87 Difference]: Start difference. First operand 2354 states and 7080 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:55,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:22:55,907 INFO L93 Difference]: Finished difference Result 1940 states and 5673 transitions. [2021-06-12 17:22:55,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-12 17:22:55,907 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2021-06-12 17:22:55,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:22:55,909 INFO L225 Difference]: With dead ends: 1940 [2021-06-12 17:22:55,909 INFO L226 Difference]: Without dead ends: 794 [2021-06-12 17:22:55,909 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 100.5ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-06-12 17:22:55,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2021-06-12 17:22:55,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 794. [2021-06-12 17:22:55,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 793 states have (on average 2.7919293820933166) internal successors, (2214), 793 states have internal predecessors, (2214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:55,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 2214 transitions. [2021-06-12 17:22:55,919 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 2214 transitions. Word has length 77 [2021-06-12 17:22:55,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:22:55,919 INFO L482 AbstractCegarLoop]: Abstraction has 794 states and 2214 transitions. [2021-06-12 17:22:55,919 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:22:55,919 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 2214 transitions. [2021-06-12 17:22:55,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-12 17:22:55,920 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:22:55,921 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 17:22:55,921 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-12 17:22:55,921 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:22:55,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:22:55,921 INFO L82 PathProgramCache]: Analyzing trace with hash 162993972, now seen corresponding path program 1 times [2021-06-12 17:22:55,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:22:55,922 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550396118] [2021-06-12 17:22:55,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:22:55,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-12 17:22:55,952 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-12 17:22:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-12 17:22:55,984 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-12 17:22:56,017 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-12 17:22:56,018 INFO L573 BasicCegarLoop]: Counterexample might be feasible [2021-06-12 17:22:56,018 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-12 17:22:56,018 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (3/3) [2021-06-12 17:22:56,019 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-12 17:22:56,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.06 05:22:56 BasicIcfg [2021-06-12 17:22:56,118 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-12 17:22:56,119 INFO L168 Benchmark]: Toolchain (without parser) took 16589.84 ms. Allocated memory was 198.2 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 161.0 MB in the beginning and 971.3 MB in the end (delta: -810.3 MB). Peak memory consumption was 1.9 GB. Max. memory is 8.0 GB. [2021-06-12 17:22:56,119 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 198.2 MB. Free memory was 179.3 MB in the beginning and 179.2 MB in the end (delta: 140.1 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-06-12 17:22:56,119 INFO L168 Benchmark]: CACSL2BoogieTranslator took 513.74 ms. Allocated memory is still 198.2 MB. Free memory was 160.9 MB in the beginning and 157.2 MB in the end (delta: 3.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-06-12 17:22:56,119 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.57 ms. Allocated memory is still 198.2 MB. Free memory was 157.2 MB in the beginning and 154.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-06-12 17:22:56,119 INFO L168 Benchmark]: Boogie Preprocessor took 34.16 ms. Allocated memory is still 198.2 MB. Free memory was 154.6 MB in the beginning and 152.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-06-12 17:22:56,120 INFO L168 Benchmark]: RCFGBuilder took 1497.33 ms. Allocated memory was 198.2 MB in the beginning and 238.0 MB in the end (delta: 39.8 MB). Free memory was 152.0 MB in the beginning and 206.1 MB in the end (delta: -54.1 MB). Peak memory consumption was 93.2 MB. Max. memory is 8.0 GB. [2021-06-12 17:22:56,120 INFO L168 Benchmark]: TraceAbstraction took 14492.16 ms. Allocated memory was 238.0 MB in the beginning and 2.9 GB in the end (delta: 2.6 GB). Free memory was 205.6 MB in the beginning and 971.3 MB in the end (delta: -765.7 MB). Peak memory consumption was 1.9 GB. Max. memory is 8.0 GB. [2021-06-12 17:22:56,120 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.17 ms. Allocated memory is still 198.2 MB. Free memory was 179.3 MB in the beginning and 179.2 MB in the end (delta: 140.1 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 513.74 ms. Allocated memory is still 198.2 MB. Free memory was 160.9 MB in the beginning and 157.2 MB in the end (delta: 3.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 43.57 ms. Allocated memory is still 198.2 MB. Free memory was 157.2 MB in the beginning and 154.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 34.16 ms. Allocated memory is still 198.2 MB. Free memory was 154.6 MB in the beginning and 152.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1497.33 ms. Allocated memory was 198.2 MB in the beginning and 238.0 MB in the end (delta: 39.8 MB). Free memory was 152.0 MB in the beginning and 206.1 MB in the end (delta: -54.1 MB). Peak memory consumption was 93.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 14492.16 ms. Allocated memory was 238.0 MB in the beginning and 2.9 GB in the end (delta: 2.6 GB). Free memory was 205.6 MB in the beginning and 971.3 MB in the end (delta: -765.7 MB). Peak memory consumption was 1.9 GB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L711] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L713] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L716] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L717] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L718] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=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] [L719] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=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] [L720] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=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] [L721] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=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] [L722] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=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] [L723] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=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] [L724] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=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] [L725] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=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] [L726] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=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] [L727] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=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}] [L728] 0 int y$w_buff0; VAL [__unbuffered_cnt=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] [L729] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=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] [L730] 0 int y$w_buff1; VAL [__unbuffered_cnt=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] [L731] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=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] [L733] 0 int z = 0; VAL [__unbuffered_cnt=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] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=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] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L811] 0 pthread_t t2492; VAL [__unbuffered_cnt=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] [L812] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L813] 0 pthread_t t2493; VAL [__unbuffered_cnt=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] [L814] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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 t2494; VAL [__unbuffered_cnt=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] [L816] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=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] [L786] 3 z = 1 VAL [__unbuffered_cnt=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] [L739] 1 z = 2 VAL [__unbuffered_cnt=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=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=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=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=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=2] [L757] 2 y = 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=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=2] [L789] 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) [L789] 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) [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L791] 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 [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L793] 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 [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=2] [L760] 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) [L760] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L760] 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) [L760] 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) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 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 [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 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 [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=2] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=2] [L822] 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) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] 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) [L822] 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) [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 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 [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L826] 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 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] 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) [L833] 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) [L834] 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)) [L834] 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)) [L835] 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)) [L835] 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)) [L836] 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)) [L836] 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)) [L837] 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)) [L837] 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)) [L838] 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)) [L838] 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)) [L839] 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)) [L839] 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)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, 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=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, 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=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, 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=2] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P2Thread1of1ForFork0 with 1 thread instances CFG has 7 procedures, 130 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1621.9ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 50.4ms, AutomataDifference: 344.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 862.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 93 SDtfs, 35 SDslu, 64 SDs, 0 SdLazy, 9 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=14087occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 8.2ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 6.4ms SsaConstructionTime, 119.0ms SatisfiabilityAnalysisTime, 136.0ms InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 53 ConstructedInterpolants, 0 QuantifiedInterpolants, 109 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P2 with 1 thread instances CFG has 7 procedures, 130 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 646.2ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 108.1ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 536.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=14087occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 130 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11993.6ms, OverallIterations: 18, TraceHistogramMax: 1, EmptinessCheckTime: 185.3ms, AutomataDifference: 5152.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 523.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2483 SDtfs, 3704 SDslu, 10882 SDs, 0 SdLazy, 1470 SolverSat, 267 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1433.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 269 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 3509.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=14087occurred in iteration=0, InterpolantAutomatonStates: 200, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2838.4ms AutomataMinimizationTime, 17 MinimizatonAttempts, 5060 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 56.4ms SsaConstructionTime, 555.2ms SatisfiabilityAnalysisTime, 2465.1ms InterpolantComputationTime, 1309 NumberOfCodeBlocks, 1309 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1212 ConstructedInterpolants, 0 QuantifiedInterpolants, 7430 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...