/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/safe004_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f [2021-08-12 17:16:43,239 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-12 17:16:43,241 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-12 17:16:43,279 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-12 17:16:43,279 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-12 17:16:43,282 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-12 17:16:43,285 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-12 17:16:43,290 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-12 17:16:43,292 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-12 17:16:43,295 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-12 17:16:43,296 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-12 17:16:43,298 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-12 17:16:43,298 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-12 17:16:43,300 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-12 17:16:43,301 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-12 17:16:43,302 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-12 17:16:43,304 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-12 17:16:43,305 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-12 17:16:43,307 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-12 17:16:43,326 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-12 17:16:43,328 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-12 17:16:43,330 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-12 17:16:43,331 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-12 17:16:43,333 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-12 17:16:43,339 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-12 17:16:43,340 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-12 17:16:43,340 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-12 17:16:43,341 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-12 17:16:43,342 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-12 17:16:43,342 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-12 17:16:43,343 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-12 17:16:43,343 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-12 17:16:43,345 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-12 17:16:43,345 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-12 17:16:43,346 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-12 17:16:43,347 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-12 17:16:43,347 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-12 17:16:43,347 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-12 17:16:43,348 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-12 17:16:43,348 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-12 17:16:43,349 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-12 17:16:43,353 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-08-12 17:16:43,388 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-12 17:16:43,389 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-12 17:16:43,389 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-12 17:16:43,389 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-12 17:16:43,392 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-12 17:16:43,392 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-12 17:16:43,392 INFO L138 SettingsManager]: * Use SBE=true [2021-08-12 17:16:43,393 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-12 17:16:43,393 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-12 17:16:43,393 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-12 17:16:43,394 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-12 17:16:43,394 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-12 17:16:43,394 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-12 17:16:43,394 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-12 17:16:43,394 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-12 17:16:43,394 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-12 17:16:43,395 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-12 17:16:43,395 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-12 17:16:43,395 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-12 17:16:43,395 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-12 17:16:43,395 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-12 17:16:43,395 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-12 17:16:43,395 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-12 17:16:43,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-12 17:16:43,396 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-12 17:16:43,396 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-12 17:16:43,396 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-12 17:16:43,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-12 17:16:43,396 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-12 17:16:43,396 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-12 17:16:43,397 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-08-12 17:16:43,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-12 17:16:43,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-12 17:16:43,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-12 17:16:43,670 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-12 17:16:43,671 INFO L275 PluginConnector]: CDTParser initialized [2021-08-12 17:16:43,671 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_rmo.opt.i [2021-08-12 17:16:43,732 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97b711938/6ec249b717854b2e99c22db385e88e2c/FLAGc5e8edd8e [2021-08-12 17:16:44,206 INFO L306 CDTParser]: Found 1 translation units. [2021-08-12 17:16:44,210 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_rmo.opt.i [2021-08-12 17:16:44,219 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97b711938/6ec249b717854b2e99c22db385e88e2c/FLAGc5e8edd8e [2021-08-12 17:16:44,539 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97b711938/6ec249b717854b2e99c22db385e88e2c [2021-08-12 17:16:44,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-12 17:16:44,542 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-12 17:16:44,545 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-12 17:16:44,545 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-12 17:16:44,548 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-12 17:16:44,549 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.08 05:16:44" (1/1) ... [2021-08-12 17:16:44,550 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c174d84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:16:44, skipping insertion in model container [2021-08-12 17:16:44,550 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.08 05:16:44" (1/1) ... [2021-08-12 17:16:44,555 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-12 17:16:44,599 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-12 17:16:44,714 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/safe004_rmo.opt.i[949,962] [2021-08-12 17:16:44,967 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-12 17:16:44,973 INFO L203 MainTranslator]: Completed pre-run [2021-08-12 17:16:44,988 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/safe004_rmo.opt.i[949,962] [2021-08-12 17:16:45,042 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-12 17:16:45,096 INFO L208 MainTranslator]: Completed translation [2021-08-12 17:16:45,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:16:45 WrapperNode [2021-08-12 17:16:45,097 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-12 17:16:45,098 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-12 17:16:45,098 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-12 17:16:45,098 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-12 17:16:45,103 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:16:45" (1/1) ... [2021-08-12 17:16:45,117 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:16:45" (1/1) ... [2021-08-12 17:16:45,159 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-12 17:16:45,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-12 17:16:45,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-12 17:16:45,160 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-12 17:16:45,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:16:45" (1/1) ... [2021-08-12 17:16:45,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:16:45" (1/1) ... [2021-08-12 17:16:45,184 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:16:45" (1/1) ... [2021-08-12 17:16:45,185 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:16:45" (1/1) ... [2021-08-12 17:16:45,191 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:16:45" (1/1) ... [2021-08-12 17:16:45,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:16:45" (1/1) ... [2021-08-12 17:16:45,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:16:45" (1/1) ... [2021-08-12 17:16:45,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-12 17:16:45,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-12 17:16:45,217 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-12 17:16:45,217 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-12 17:16:45,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:16:45" (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-08-12 17:16:45,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-12 17:16:45,286 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-12 17:16:45,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-12 17:16:45,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-12 17:16:45,287 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-12 17:16:45,287 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-12 17:16:45,288 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-12 17:16:45,288 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-12 17:16:45,288 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-12 17:16:45,288 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-12 17:16:45,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-12 17:16:45,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-12 17:16:45,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-12 17:16:45,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-12 17:16:45,290 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-12 17:16:47,202 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-12 17:16:47,202 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-12 17:16:47,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.08 05:16:47 BoogieIcfgContainer [2021-08-12 17:16:47,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-12 17:16:47,208 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-12 17:16:47,208 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-12 17:16:47,210 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-12 17:16:47,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.08 05:16:44" (1/3) ... [2021-08-12 17:16:47,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a204f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.08 05:16:47, skipping insertion in model container [2021-08-12 17:16:47,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:16:45" (2/3) ... [2021-08-12 17:16:47,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a204f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.08 05:16:47, skipping insertion in model container [2021-08-12 17:16:47,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.08 05:16:47" (3/3) ... [2021-08-12 17:16:47,213 INFO L111 eAbstractionObserver]: Analyzing ICFG safe004_rmo.opt.i [2021-08-12 17:16:47,218 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-12 17:16:47,218 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-12 17:16:47,219 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-12 17:16:47,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,250 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,250 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,250 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,250 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,250 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,250 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,250 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,251 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,251 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,251 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,251 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,251 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,251 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,251 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,252 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,252 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,252 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,252 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,252 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,252 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,253 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,253 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,254 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,255 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,255 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,255 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,255 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,255 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,255 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,256 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,256 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,256 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,257 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,257 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,259 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,259 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,259 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,259 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,259 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,260 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,260 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,260 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,260 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,261 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,261 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,261 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,261 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,269 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,269 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,269 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,269 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,269 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,269 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,270 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,272 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,273 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,275 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,283 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,286 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,286 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,286 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,286 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,287 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,288 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:16:47,290 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-12 17:16:47,304 INFO L255 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-08-12 17:16:47,319 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-12 17:16:47,319 INFO L379 AbstractCegarLoop]: Hoare is true [2021-08-12 17:16:47,319 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-12 17:16:47,319 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-12 17:16:47,319 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-12 17:16:47,319 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-12 17:16:47,319 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-12 17:16:47,319 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-12 17:16:47,328 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 114 places, 106 transitions, 227 flow [2021-08-12 17:16:48,370 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 16151 states, 16147 states have (on average 3.6356598748993623) internal successors, (58705), 16150 states have internal predecessors, (58705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:16:48,466 INFO L276 IsEmpty]: Start isEmpty. Operand has 16151 states, 16147 states have (on average 3.6356598748993623) internal successors, (58705), 16150 states have internal predecessors, (58705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:16:48,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-12 17:16:48,473 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:16:48,474 INFO L550 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] [2021-08-12 17:16:48,475 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:16:48,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:16:48,479 INFO L82 PathProgramCache]: Analyzing trace with hash -591144752, now seen corresponding path program 1 times [2021-08-12 17:16:48,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:16:48,487 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489280777] [2021-08-12 17:16:48,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:16:48,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:16:48,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:16:48,709 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:16:48,710 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489280777] [2021-08-12 17:16:48,710 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489280777] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:16:48,710 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:16:48,711 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-12 17:16:48,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70558430] [2021-08-12 17:16:48,715 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-12 17:16:48,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:16:48,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-12 17:16:48,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-12 17:16:48,756 INFO L87 Difference]: Start difference. First operand has 16151 states, 16147 states have (on average 3.6356598748993623) internal successors, (58705), 16150 states have internal predecessors, (58705), 0 states have call successors, (0), 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 24.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:16:49,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:16:49,390 INFO L93 Difference]: Finished difference Result 25367 states and 93265 transitions. [2021-08-12 17:16:49,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-12 17:16:49,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2021-08-12 17:16:49,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:16:49,530 INFO L225 Difference]: With dead ends: 25367 [2021-08-12 17:16:49,530 INFO L226 Difference]: Without dead ends: 8223 [2021-08-12 17:16:49,559 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-12 17:16:49,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8223 states. [2021-08-12 17:16:49,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8223 to 8223. [2021-08-12 17:16:49,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8223 states, 8222 states have (on average 3.4911213816589637) internal successors, (28704), 8222 states have internal predecessors, (28704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:16:50,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8223 states to 8223 states and 28704 transitions. [2021-08-12 17:16:50,072 INFO L78 Accepts]: Start accepts. Automaton has 8223 states and 28704 transitions. Word has length 48 [2021-08-12 17:16:50,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:16:50,073 INFO L482 AbstractCegarLoop]: Abstraction has 8223 states and 28704 transitions. [2021-08-12 17:16:50,073 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:16:50,074 INFO L276 IsEmpty]: Start isEmpty. Operand 8223 states and 28704 transitions. [2021-08-12 17:16:50,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-12 17:16:50,095 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:16:50,095 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:16:50,096 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-12 17:16:50,096 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:16:50,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:16:50,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1192679358, now seen corresponding path program 1 times [2021-08-12 17:16:50,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:16:50,097 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415276777] [2021-08-12 17:16:50,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:16:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:16:50,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:16:50,406 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:16:50,407 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415276777] [2021-08-12 17:16:50,407 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415276777] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:16:50,408 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:16:50,408 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 17:16:50,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128167327] [2021-08-12 17:16:50,410 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 17:16:50,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:16:50,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 17:16:50,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 17:16:50,413 INFO L87 Difference]: Start difference. First operand 8223 states and 28704 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:16:50,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:16:50,932 INFO L93 Difference]: Finished difference Result 10143 states and 35200 transitions. [2021-08-12 17:16:50,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 17:16:50,933 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-08-12 17:16:50,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:16:50,992 INFO L225 Difference]: With dead ends: 10143 [2021-08-12 17:16:50,993 INFO L226 Difference]: Without dead ends: 7071 [2021-08-12 17:16:51,003 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 98.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-12 17:16:51,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7071 states. [2021-08-12 17:16:51,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7071 to 7071. [2021-08-12 17:16:51,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7071 states, 7070 states have (on average 3.448939179632249) internal successors, (24384), 7070 states have internal predecessors, (24384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:16:51,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7071 states to 7071 states and 24384 transitions. [2021-08-12 17:16:51,317 INFO L78 Accepts]: Start accepts. Automaton has 7071 states and 24384 transitions. Word has length 67 [2021-08-12 17:16:51,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:16:51,319 INFO L482 AbstractCegarLoop]: Abstraction has 7071 states and 24384 transitions. [2021-08-12 17:16:51,319 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:16:51,320 INFO L276 IsEmpty]: Start isEmpty. Operand 7071 states and 24384 transitions. [2021-08-12 17:16:51,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-08-12 17:16:51,334 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:16:51,335 INFO L550 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-08-12 17:16:51,335 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-12 17:16:51,335 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:16:51,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:16:51,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1997772786, now seen corresponding path program 1 times [2021-08-12 17:16:51,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:16:51,336 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341714524] [2021-08-12 17:16:51,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:16:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:16:51,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:16:51,522 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:16:51,522 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341714524] [2021-08-12 17:16:51,523 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341714524] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:16:51,523 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:16:51,530 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-12 17:16:51,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163892880] [2021-08-12 17:16:51,530 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-12 17:16:51,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:16:51,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-12 17:16:51,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-12 17:16:51,532 INFO L87 Difference]: Start difference. First operand 7071 states and 24384 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-08-12 17:16:52,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:16:52,010 INFO L93 Difference]: Finished difference Result 11421 states and 39424 transitions. [2021-08-12 17:16:52,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-12 17:16:52,010 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-08-12 17:16:52,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:16:52,055 INFO L225 Difference]: With dead ends: 11421 [2021-08-12 17:16:52,055 INFO L226 Difference]: Without dead ends: 6621 [2021-08-12 17:16:52,068 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 129.4ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-08-12 17:16:52,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6621 states. [2021-08-12 17:16:52,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6621 to 6621. [2021-08-12 17:16:52,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6621 states, 6620 states have (on average 3.421450151057402) internal successors, (22650), 6620 states have internal predecessors, (22650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:16:52,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6621 states to 6621 states and 22650 transitions. [2021-08-12 17:16:52,283 INFO L78 Accepts]: Start accepts. Automaton has 6621 states and 22650 transitions. Word has length 70 [2021-08-12 17:16:52,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:16:52,284 INFO L482 AbstractCegarLoop]: Abstraction has 6621 states and 22650 transitions. [2021-08-12 17:16:52,284 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-08-12 17:16:52,284 INFO L276 IsEmpty]: Start isEmpty. Operand 6621 states and 22650 transitions. [2021-08-12 17:16:52,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-12 17:16:52,303 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:16:52,303 INFO L550 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-08-12 17:16:52,303 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-12 17:16:52,303 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:16:52,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:16:52,304 INFO L82 PathProgramCache]: Analyzing trace with hash -105471251, now seen corresponding path program 1 times [2021-08-12 17:16:52,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:16:52,304 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215274603] [2021-08-12 17:16:52,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:16:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:16:52,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:16:52,595 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:16:52,596 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215274603] [2021-08-12 17:16:52,596 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215274603] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:16:52,596 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:16:52,596 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-12 17:16:52,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131694158] [2021-08-12 17:16:52,597 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-12 17:16:52,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:16:52,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-12 17:16:52,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-08-12 17:16:52,598 INFO L87 Difference]: Start difference. First operand 6621 states and 22650 transitions. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 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-08-12 17:16:53,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:16:53,068 INFO L93 Difference]: Finished difference Result 8127 states and 27702 transitions. [2021-08-12 17:16:53,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-12 17:16:53,070 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 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-08-12 17:16:53,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:16:53,112 INFO L225 Difference]: With dead ends: 8127 [2021-08-12 17:16:53,112 INFO L226 Difference]: Without dead ends: 6655 [2021-08-12 17:16:53,121 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 212.1ms TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2021-08-12 17:16:53,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6655 states. [2021-08-12 17:16:53,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6655 to 6561. [2021-08-12 17:16:53,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6561 states, 6560 states have (on average 3.4179878048780488) internal successors, (22422), 6560 states have internal predecessors, (22422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:16:53,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6561 states to 6561 states and 22422 transitions. [2021-08-12 17:16:53,425 INFO L78 Accepts]: Start accepts. Automaton has 6561 states and 22422 transitions. Word has length 72 [2021-08-12 17:16:53,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:16:53,426 INFO L482 AbstractCegarLoop]: Abstraction has 6561 states and 22422 transitions. [2021-08-12 17:16:53,426 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 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-08-12 17:16:53,426 INFO L276 IsEmpty]: Start isEmpty. Operand 6561 states and 22422 transitions. [2021-08-12 17:16:53,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-12 17:16:53,438 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:16:53,439 INFO L550 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-08-12 17:16:53,439 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-12 17:16:53,439 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:16:53,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:16:53,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1458644827, now seen corresponding path program 1 times [2021-08-12 17:16:53,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:16:53,440 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658767262] [2021-08-12 17:16:53,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:16:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:16:53,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:16:53,685 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:16:53,685 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658767262] [2021-08-12 17:16:53,685 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658767262] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:16:53,686 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:16:53,686 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-12 17:16:53,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955968417] [2021-08-12 17:16:53,687 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-12 17:16:53,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:16:53,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-12 17:16:53,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-08-12 17:16:53,688 INFO L87 Difference]: Start difference. First operand 6561 states and 22422 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-08-12 17:16:54,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:16:54,241 INFO L93 Difference]: Finished difference Result 7853 states and 26736 transitions. [2021-08-12 17:16:54,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-12 17:16:54,242 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-08-12 17:16:54,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:16:54,292 INFO L225 Difference]: With dead ends: 7853 [2021-08-12 17:16:54,292 INFO L226 Difference]: Without dead ends: 6621 [2021-08-12 17:16:54,297 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 236.7ms TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2021-08-12 17:16:54,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6621 states. [2021-08-12 17:16:54,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6621 to 6621. [2021-08-12 17:16:54,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6621 states, 6620 states have (on average 3.4193353474320243) internal successors, (22636), 6620 states have internal predecessors, (22636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:16:54,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6621 states to 6621 states and 22636 transitions. [2021-08-12 17:16:54,611 INFO L78 Accepts]: Start accepts. Automaton has 6621 states and 22636 transitions. Word has length 73 [2021-08-12 17:16:54,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:16:54,613 INFO L482 AbstractCegarLoop]: Abstraction has 6621 states and 22636 transitions. [2021-08-12 17:16:54,613 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-08-12 17:16:54,613 INFO L276 IsEmpty]: Start isEmpty. Operand 6621 states and 22636 transitions. [2021-08-12 17:16:54,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-12 17:16:54,626 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:16:54,626 INFO L550 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-08-12 17:16:54,626 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-12 17:16:54,626 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:16:54,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:16:54,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1526736092, now seen corresponding path program 1 times [2021-08-12 17:16:54,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:16:54,627 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258631513] [2021-08-12 17:16:54,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:16:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:16:54,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:16:54,738 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:16:54,739 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258631513] [2021-08-12 17:16:54,739 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258631513] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:16:54,739 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:16:54,739 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 17:16:54,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726016694] [2021-08-12 17:16:54,740 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 17:16:54,740 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:16:54,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 17:16:54,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 17:16:54,742 INFO L87 Difference]: Start difference. First operand 6621 states and 22636 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 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-08-12 17:16:55,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:16:55,109 INFO L93 Difference]: Finished difference Result 11391 states and 38617 transitions. [2021-08-12 17:16:55,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 17:16:55,110 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 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-08-12 17:16:55,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:16:55,161 INFO L225 Difference]: With dead ends: 11391 [2021-08-12 17:16:55,161 INFO L226 Difference]: Without dead ends: 7221 [2021-08-12 17:16:55,172 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 86.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-12 17:16:55,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7221 states. [2021-08-12 17:16:55,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7221 to 6321. [2021-08-12 17:16:55,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6321 states, 6320 states have (on average 3.335759493670886) internal successors, (21082), 6320 states have internal predecessors, (21082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:16:55,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6321 states to 6321 states and 21082 transitions. [2021-08-12 17:16:55,407 INFO L78 Accepts]: Start accepts. Automaton has 6321 states and 21082 transitions. Word has length 73 [2021-08-12 17:16:55,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:16:55,408 INFO L482 AbstractCegarLoop]: Abstraction has 6321 states and 21082 transitions. [2021-08-12 17:16:55,408 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 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-08-12 17:16:55,408 INFO L276 IsEmpty]: Start isEmpty. Operand 6321 states and 21082 transitions. [2021-08-12 17:16:55,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-12 17:16:55,424 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:16:55,425 INFO L550 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-08-12 17:16:55,425 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-12 17:16:55,425 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:16:55,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:16:55,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1827510732, now seen corresponding path program 1 times [2021-08-12 17:16:55,426 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:16:55,426 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006090014] [2021-08-12 17:16:55,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:16:55,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:16:55,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:16:55,554 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:16:55,554 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006090014] [2021-08-12 17:16:55,554 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006090014] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:16:55,554 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:16:55,554 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-12 17:16:55,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789889330] [2021-08-12 17:16:55,555 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-12 17:16:55,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:16:55,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-12 17:16:55,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-12 17:16:55,556 INFO L87 Difference]: Start difference. First operand 6321 states and 21082 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 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-08-12 17:16:56,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:16:56,037 INFO L93 Difference]: Finished difference Result 9171 states and 30717 transitions. [2021-08-12 17:16:56,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-12 17:16:56,038 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 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-08-12 17:16:56,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:16:56,080 INFO L225 Difference]: With dead ends: 9171 [2021-08-12 17:16:56,080 INFO L226 Difference]: Without dead ends: 3297 [2021-08-12 17:16:56,091 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 123.7ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-08-12 17:16:56,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3297 states. [2021-08-12 17:16:56,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3297 to 3297. [2021-08-12 17:16:56,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3297 states, 3296 states have (on average 3.284890776699029) internal successors, (10827), 3296 states have internal predecessors, (10827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:16:56,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3297 states to 3297 states and 10827 transitions. [2021-08-12 17:16:56,193 INFO L78 Accepts]: Start accepts. Automaton has 3297 states and 10827 transitions. Word has length 74 [2021-08-12 17:16:56,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:16:56,193 INFO L482 AbstractCegarLoop]: Abstraction has 3297 states and 10827 transitions. [2021-08-12 17:16:56,193 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 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-08-12 17:16:56,193 INFO L276 IsEmpty]: Start isEmpty. Operand 3297 states and 10827 transitions. [2021-08-12 17:16:56,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-12 17:16:56,198 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:16:56,198 INFO L550 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-08-12 17:16:56,198 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-12 17:16:56,199 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:16:56,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:16:56,199 INFO L82 PathProgramCache]: Analyzing trace with hash 813228213, now seen corresponding path program 1 times [2021-08-12 17:16:56,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:16:56,199 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851819702] [2021-08-12 17:16:56,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:16:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:16:56,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:16:56,414 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:16:56,414 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851819702] [2021-08-12 17:16:56,415 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851819702] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:16:56,415 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:16:56,415 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-12 17:16:56,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079122550] [2021-08-12 17:16:56,415 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-12 17:16:56,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:16:56,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-12 17:16:56,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-12 17:16:56,416 INFO L87 Difference]: Start difference. First operand 3297 states and 10827 transitions. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 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-08-12 17:16:56,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:16:56,955 INFO L93 Difference]: Finished difference Result 4213 states and 13809 transitions. [2021-08-12 17:16:56,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-12 17:16:56,956 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 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-08-12 17:16:56,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:16:56,986 INFO L225 Difference]: With dead ends: 4213 [2021-08-12 17:16:56,986 INFO L226 Difference]: Without dead ends: 3313 [2021-08-12 17:16:56,988 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 304.9ms TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2021-08-12 17:16:56,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3313 states. [2021-08-12 17:16:57,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3313 to 3313. [2021-08-12 17:16:57,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3313 states, 3312 states have (on average 3.281099033816425) internal successors, (10867), 3312 states have internal predecessors, (10867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:16:57,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3313 states to 3313 states and 10867 transitions. [2021-08-12 17:16:57,092 INFO L78 Accepts]: Start accepts. Automaton has 3313 states and 10867 transitions. Word has length 75 [2021-08-12 17:16:57,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:16:57,092 INFO L482 AbstractCegarLoop]: Abstraction has 3313 states and 10867 transitions. [2021-08-12 17:16:57,092 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 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-08-12 17:16:57,093 INFO L276 IsEmpty]: Start isEmpty. Operand 3313 states and 10867 transitions. [2021-08-12 17:16:57,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-12 17:16:57,098 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:16:57,098 INFO L550 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-08-12 17:16:57,098 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-12 17:16:57,098 INFO L430 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:16:57,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:16:57,099 INFO L82 PathProgramCache]: Analyzing trace with hash 2123569943, now seen corresponding path program 2 times [2021-08-12 17:16:57,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:16:57,099 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391359182] [2021-08-12 17:16:57,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:16:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:16:57,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:16:57,306 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:16:57,306 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391359182] [2021-08-12 17:16:57,306 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391359182] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:16:57,306 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:16:57,306 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-12 17:16:57,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292739450] [2021-08-12 17:16:57,306 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-08-12 17:16:57,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:16:57,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-12 17:16:57,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-08-12 17:16:57,307 INFO L87 Difference]: Start difference. First operand 3313 states and 10867 transitions. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 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-08-12 17:16:57,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:16:57,683 INFO L93 Difference]: Finished difference Result 4207 states and 13784 transitions. [2021-08-12 17:16:57,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-12 17:16:57,684 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 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-08-12 17:16:57,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:16:57,712 INFO L225 Difference]: With dead ends: 4207 [2021-08-12 17:16:57,712 INFO L226 Difference]: Without dead ends: 3307 [2021-08-12 17:16:57,715 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 251.4ms TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2021-08-12 17:16:57,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3307 states. [2021-08-12 17:16:57,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3307 to 3307. [2021-08-12 17:16:57,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3307 states, 3306 states have (on average 3.279794313369631) internal successors, (10843), 3306 states have internal predecessors, (10843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:16:57,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3307 states to 3307 states and 10843 transitions. [2021-08-12 17:16:57,817 INFO L78 Accepts]: Start accepts. Automaton has 3307 states and 10843 transitions. Word has length 75 [2021-08-12 17:16:57,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:16:57,817 INFO L482 AbstractCegarLoop]: Abstraction has 3307 states and 10843 transitions. [2021-08-12 17:16:57,817 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 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-08-12 17:16:57,818 INFO L276 IsEmpty]: Start isEmpty. Operand 3307 states and 10843 transitions. [2021-08-12 17:16:57,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-08-12 17:16:57,823 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:16:57,823 INFO L550 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] [2021-08-12 17:16:57,823 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-12 17:16:57,824 INFO L430 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:16:57,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:16:57,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1971943357, now seen corresponding path program 1 times [2021-08-12 17:16:57,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:16:57,824 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469851302] [2021-08-12 17:16:57,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:16:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:16:58,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:16:58,024 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:16:58,024 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469851302] [2021-08-12 17:16:58,024 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469851302] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:16:58,024 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:16:58,024 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-12 17:16:58,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975970443] [2021-08-12 17:16:58,024 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-08-12 17:16:58,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:16:58,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-12 17:16:58,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-08-12 17:16:58,025 INFO L87 Difference]: Start difference. First operand 3307 states and 10843 transitions. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:16:58,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:16:58,586 INFO L93 Difference]: Finished difference Result 4123 states and 13479 transitions. [2021-08-12 17:16:58,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-12 17:16:58,586 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2021-08-12 17:16:58,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:16:58,613 INFO L225 Difference]: With dead ends: 4123 [2021-08-12 17:16:58,614 INFO L226 Difference]: Without dead ends: 3253 [2021-08-12 17:16:58,616 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 390.3ms TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2021-08-12 17:16:58,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3253 states. [2021-08-12 17:16:58,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3253 to 3237. [2021-08-12 17:16:58,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3237 states, 3236 states have (on average 3.2753399258343636) internal successors, (10599), 3236 states have internal predecessors, (10599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:16:58,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3237 states to 3237 states and 10599 transitions. [2021-08-12 17:16:58,717 INFO L78 Accepts]: Start accepts. Automaton has 3237 states and 10599 transitions. Word has length 76 [2021-08-12 17:16:58,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:16:58,718 INFO L482 AbstractCegarLoop]: Abstraction has 3237 states and 10599 transitions. [2021-08-12 17:16:58,718 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:16:58,718 INFO L276 IsEmpty]: Start isEmpty. Operand 3237 states and 10599 transitions. [2021-08-12 17:16:58,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-08-12 17:16:58,723 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:16:58,723 INFO L550 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] [2021-08-12 17:16:58,724 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-12 17:16:58,724 INFO L430 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:16:58,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:16:58,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1079028512, now seen corresponding path program 1 times [2021-08-12 17:16:58,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:16:58,724 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140904723] [2021-08-12 17:16:58,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:16:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:16:58,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:16:58,800 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:16:58,800 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140904723] [2021-08-12 17:16:58,800 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140904723] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:16:58,800 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:16:58,800 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 17:16:58,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513621653] [2021-08-12 17:16:58,801 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 17:16:58,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:16:58,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 17:16:58,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 17:16:58,802 INFO L87 Difference]: Start difference. First operand 3237 states and 10599 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:16:59,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:16:59,079 INFO L93 Difference]: Finished difference Result 5217 states and 17103 transitions. [2021-08-12 17:16:59,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 17:16:59,080 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2021-08-12 17:16:59,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:16:59,110 INFO L225 Difference]: With dead ends: 5217 [2021-08-12 17:16:59,110 INFO L226 Difference]: Without dead ends: 2889 [2021-08-12 17:16:59,115 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 82.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-12 17:16:59,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2889 states. [2021-08-12 17:16:59,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2889 to 2889. [2021-08-12 17:16:59,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2889 states, 2888 states have (on average 3.2316481994459836) internal successors, (9333), 2888 states have internal predecessors, (9333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:16:59,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 9333 transitions. [2021-08-12 17:16:59,225 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 9333 transitions. Word has length 76 [2021-08-12 17:16:59,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:16:59,226 INFO L482 AbstractCegarLoop]: Abstraction has 2889 states and 9333 transitions. [2021-08-12 17:16:59,226 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:16:59,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 9333 transitions. [2021-08-12 17:16:59,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-12 17:16:59,231 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:16:59,231 INFO L550 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-08-12 17:16:59,232 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-12 17:16:59,232 INFO L430 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:16:59,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:16:59,232 INFO L82 PathProgramCache]: Analyzing trace with hash -132854058, now seen corresponding path program 1 times [2021-08-12 17:16:59,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:16:59,235 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378951870] [2021-08-12 17:16:59,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:16:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:16:59,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:16:59,328 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:16:59,328 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378951870] [2021-08-12 17:16:59,328 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378951870] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:16:59,328 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:16:59,328 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-12 17:16:59,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059795751] [2021-08-12 17:16:59,328 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-12 17:16:59,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:16:59,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-12 17:16:59,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-12 17:16:59,329 INFO L87 Difference]: Start difference. First operand 2889 states and 9333 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-08-12 17:16:59,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:16:59,564 INFO L93 Difference]: Finished difference Result 4077 states and 13077 transitions. [2021-08-12 17:16:59,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-12 17:16:59,564 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-08-12 17:16:59,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:16:59,585 INFO L225 Difference]: With dead ends: 4077 [2021-08-12 17:16:59,585 INFO L226 Difference]: Without dead ends: 2097 [2021-08-12 17:16:59,589 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 100.7ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-08-12 17:16:59,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2097 states. [2021-08-12 17:16:59,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2097 to 2097. [2021-08-12 17:16:59,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2097 states, 2096 states have (on average 3.093034351145038) internal successors, (6483), 2096 states have internal predecessors, (6483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:16:59,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2097 states to 2097 states and 6483 transitions. [2021-08-12 17:16:59,677 INFO L78 Accepts]: Start accepts. Automaton has 2097 states and 6483 transitions. Word has length 77 [2021-08-12 17:16:59,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:16:59,678 INFO L482 AbstractCegarLoop]: Abstraction has 2097 states and 6483 transitions. [2021-08-12 17:16:59,678 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-08-12 17:16:59,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2097 states and 6483 transitions. [2021-08-12 17:16:59,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-08-12 17:16:59,682 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:16:59,682 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:16:59,682 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-12 17:16:59,683 INFO L430 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:16:59,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:16:59,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1315090985, now seen corresponding path program 1 times [2021-08-12 17:16:59,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:16:59,683 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028816219] [2021-08-12 17:16:59,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:16:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:16:59,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:16:59,822 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:16:59,822 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028816219] [2021-08-12 17:16:59,822 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028816219] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:16:59,823 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:16:59,823 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-12 17:16:59,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106833049] [2021-08-12 17:16:59,823 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-12 17:16:59,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:16:59,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-12 17:16:59,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-12 17:16:59,824 INFO L87 Difference]: Start difference. First operand 2097 states and 6483 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:17:00,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:17:00,023 INFO L93 Difference]: Finished difference Result 2421 states and 7428 transitions. [2021-08-12 17:17:00,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-12 17:17:00,024 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-08-12 17:17:00,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:17:00,041 INFO L225 Difference]: With dead ends: 2421 [2021-08-12 17:17:00,041 INFO L226 Difference]: Without dead ends: 1233 [2021-08-12 17:17:00,043 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 113.1ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-08-12 17:17:00,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2021-08-12 17:17:00,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1233. [2021-08-12 17:17:00,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1233 states, 1232 states have (on average 2.924512987012987) internal successors, (3603), 1232 states have internal predecessors, (3603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:17:00,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 3603 transitions. [2021-08-12 17:17:00,087 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 3603 transitions. Word has length 79 [2021-08-12 17:17:00,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:17:00,087 INFO L482 AbstractCegarLoop]: Abstraction has 1233 states and 3603 transitions. [2021-08-12 17:17:00,087 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 17:17:00,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 3603 transitions. [2021-08-12 17:17:00,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-08-12 17:17:00,090 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:17:00,090 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:17:00,090 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-12 17:17:00,090 INFO L430 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:17:00,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:17:00,091 INFO L82 PathProgramCache]: Analyzing trace with hash 530160080, now seen corresponding path program 1 times [2021-08-12 17:17:00,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:17:00,091 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725242644] [2021-08-12 17:17:00,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:17:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-12 17:17:00,136 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-12 17:17:00,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-12 17:17:00,173 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-12 17:17:00,219 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-12 17:17:00,219 INFO L651 BasicCegarLoop]: Counterexample might be feasible [2021-08-12 17:17:00,219 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-12 17:17:00,222 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-12 17:17:00,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.08 05:17:00 BasicIcfg [2021-08-12 17:17:00,325 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-12 17:17:00,326 INFO L168 Benchmark]: Toolchain (without parser) took 15784.29 ms. Allocated memory was 199.2 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 162.2 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 729.6 MB. Max. memory is 8.0 GB. [2021-08-12 17:17:00,326 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 199.2 MB. Free memory was 180.5 MB in the beginning and 180.4 MB in the end (delta: 88.7 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-08-12 17:17:00,326 INFO L168 Benchmark]: CACSL2BoogieTranslator took 551.81 ms. Allocated memory is still 199.2 MB. Free memory was 162.0 MB in the beginning and 158.5 MB in the end (delta: 3.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2021-08-12 17:17:00,326 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.32 ms. Allocated memory is still 199.2 MB. Free memory was 158.5 MB in the beginning and 155.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-12 17:17:00,327 INFO L168 Benchmark]: Boogie Preprocessor took 56.72 ms. Allocated memory is still 199.2 MB. Free memory was 155.3 MB in the beginning and 153.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-12 17:17:00,327 INFO L168 Benchmark]: RCFGBuilder took 1989.09 ms. Allocated memory was 199.2 MB in the beginning and 257.9 MB in the end (delta: 58.7 MB). Free memory was 153.2 MB in the beginning and 201.1 MB in the end (delta: -47.9 MB). Peak memory consumption was 94.1 MB. Max. memory is 8.0 GB. [2021-08-12 17:17:00,327 INFO L168 Benchmark]: TraceAbstraction took 13117.69 ms. Allocated memory was 257.9 MB in the beginning and 2.8 GB in the end (delta: 2.5 GB). Free memory was 200.6 MB in the beginning and 2.0 GB in the end (delta: -1.8 GB). Peak memory consumption was 707.8 MB. Max. memory is 8.0 GB. [2021-08-12 17:17:00,328 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.13 ms. Allocated memory is still 199.2 MB. Free memory was 180.5 MB in the beginning and 180.4 MB in the end (delta: 88.7 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 551.81 ms. Allocated memory is still 199.2 MB. Free memory was 162.0 MB in the beginning and 158.5 MB in the end (delta: 3.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 61.32 ms. Allocated memory is still 199.2 MB. Free memory was 158.5 MB in the beginning and 155.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 56.72 ms. Allocated memory is still 199.2 MB. Free memory was 155.3 MB in the beginning and 153.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1989.09 ms. Allocated memory was 199.2 MB in the beginning and 257.9 MB in the end (delta: 58.7 MB). Free memory was 153.2 MB in the beginning and 201.1 MB in the end (delta: -47.9 MB). Peak memory consumption was 94.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 13117.69 ms. Allocated memory was 257.9 MB in the beginning and 2.8 GB in the end (delta: 2.5 GB). Free memory was 200.6 MB in the beginning and 2.0 GB in the end (delta: -1.8 GB). Peak memory consumption was 707.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L713] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L718] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L719] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L720] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L721] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L722] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L723] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L724] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L725] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L726] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L727] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L728] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L729] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L730] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L731] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L732] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L733] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L735] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L818] 0 pthread_t t1888; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L819] FCALL, FORK 0 pthread_create(&t1888, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] 0 pthread_t t1889; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L821] FCALL, FORK 0 pthread_create(&t1889, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L822] 0 pthread_t t1890; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L823] FCALL, FORK 0 pthread_create(&t1890, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L741] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L848] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12902.8ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 211.9ms, AutomataDifference: 6435.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1069.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1710 SDtfs, 2716 SDslu, 6225 SDs, 0 SdLazy, 950 SolverSat, 197 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 990.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 188 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 2137.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=16151occurred in iteration=0, InterpolantAutomatonStates: 149, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2280.7ms AutomataMinimizationTime, 13 MinimizatonAttempts, 1010 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 53.9ms SsaConstructionTime, 643.8ms SatisfiabilityAnalysisTime, 1634.8ms InterpolantComputationTime, 1017 NumberOfCodeBlocks, 1017 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 922 ConstructedInterpolants, 0 QuantifiedInterpolants, 4993 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...