/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-Delay.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe004_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-87fd7473a0bda1db0ad7f77f2116346063730f21-87fd747 [2021-08-21 17:08:12,406 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-21 17:08:12,409 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-21 17:08:12,446 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-21 17:08:12,446 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-21 17:08:12,449 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-21 17:08:12,451 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-21 17:08:12,457 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-21 17:08:12,459 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-21 17:08:12,463 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-21 17:08:12,464 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-21 17:08:12,465 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-21 17:08:12,465 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-21 17:08:12,467 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-21 17:08:12,469 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-21 17:08:12,472 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-21 17:08:12,473 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-21 17:08:12,474 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-21 17:08:12,476 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-21 17:08:12,482 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-21 17:08:12,487 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-21 17:08:12,489 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-21 17:08:12,490 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-21 17:08:12,492 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-21 17:08:12,498 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-21 17:08:12,499 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-21 17:08:12,499 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-21 17:08:12,501 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-21 17:08:12,501 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-21 17:08:12,502 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-21 17:08:12,502 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-21 17:08:12,503 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-21 17:08:12,504 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-21 17:08:12,505 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-21 17:08:12,506 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-21 17:08:12,506 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-21 17:08:12,507 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-21 17:08:12,507 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-21 17:08:12,508 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-21 17:08:12,508 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-21 17:08:12,509 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-21 17:08:12,513 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-Delay.epf [2021-08-21 17:08:12,560 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-21 17:08:12,561 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-21 17:08:12,564 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-21 17:08:12,564 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-21 17:08:12,565 INFO L138 SettingsManager]: * Use SBE=true [2021-08-21 17:08:12,565 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-21 17:08:12,565 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-21 17:08:12,565 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-21 17:08:12,565 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-21 17:08:12,565 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-21 17:08:12,566 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-21 17:08:12,566 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-21 17:08:12,567 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-21 17:08:12,567 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-21 17:08:12,567 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-21 17:08:12,567 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-21 17:08:12,567 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-21 17:08:12,567 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-21 17:08:12,567 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-21 17:08:12,567 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-21 17:08:12,568 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-21 17:08:12,568 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-21 17:08:12,568 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-21 17:08:12,568 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-21 17:08:12,568 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-21 17:08:12,569 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-21 17:08:12,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-21 17:08:12,569 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-21 17:08:12,569 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-21 17:08:12,569 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_DELAY_SET [2021-08-21 17:08:12,569 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-21 17:08:12,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-21 17:08:12,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-21 17:08:12,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-21 17:08:12,893 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-21 17:08:12,893 INFO L275 PluginConnector]: CDTParser initialized [2021-08-21 17:08:12,894 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-21 17:08:12,945 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d99c03c27/cac39e228a154a158c0aac2af9666c65/FLAG1355be471 [2021-08-21 17:08:13,379 INFO L306 CDTParser]: Found 1 translation units. [2021-08-21 17:08:13,379 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_rmo.opt.i [2021-08-21 17:08:13,392 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d99c03c27/cac39e228a154a158c0aac2af9666c65/FLAG1355be471 [2021-08-21 17:08:13,703 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d99c03c27/cac39e228a154a158c0aac2af9666c65 [2021-08-21 17:08:13,705 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-21 17:08:13,707 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-21 17:08:13,710 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-21 17:08:13,710 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-21 17:08:13,713 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-21 17:08:13,714 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 05:08:13" (1/1) ... [2021-08-21 17:08:13,715 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3edd925e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:08:13, skipping insertion in model container [2021-08-21 17:08:13,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 05:08:13" (1/1) ... [2021-08-21 17:08:13,722 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-21 17:08:13,768 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-21 17:08:13,904 WARN L228 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-21 17:08:14,127 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-21 17:08:14,139 INFO L203 MainTranslator]: Completed pre-run [2021-08-21 17:08:14,151 WARN L228 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-21 17:08:14,207 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-21 17:08:14,248 INFO L208 MainTranslator]: Completed translation [2021-08-21 17:08:14,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:08:14 WrapperNode [2021-08-21 17:08:14,250 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-21 17:08:14,251 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-21 17:08:14,251 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-21 17:08:14,251 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-21 17:08:14,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:08:14" (1/1) ... [2021-08-21 17:08:14,289 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:08:14" (1/1) ... [2021-08-21 17:08:14,327 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-21 17:08:14,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-21 17:08:14,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-21 17:08:14,328 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-21 17:08:14,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:08:14" (1/1) ... [2021-08-21 17:08:14,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:08:14" (1/1) ... [2021-08-21 17:08:14,353 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:08:14" (1/1) ... [2021-08-21 17:08:14,354 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:08:14" (1/1) ... [2021-08-21 17:08:14,361 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:08:14" (1/1) ... [2021-08-21 17:08:14,363 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:08:14" (1/1) ... [2021-08-21 17:08:14,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:08:14" (1/1) ... [2021-08-21 17:08:14,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-21 17:08:14,385 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-21 17:08:14,385 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-21 17:08:14,386 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-21 17:08:14,386 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:08:14" (1/1) ... [2021-08-21 17:08:14,391 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-21 17:08:14,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-21 17:08:14,414 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-21 17:08:14,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-21 17:08:14,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-21 17:08:14,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-21 17:08:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-21 17:08:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-21 17:08:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-21 17:08:14,461 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-21 17:08:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-21 17:08:14,461 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-21 17:08:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-21 17:08:14,461 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-21 17:08:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-21 17:08:14,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-21 17:08:14,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-21 17:08:14,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-21 17:08:14,463 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-21 17:08:16,325 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-21 17:08:16,325 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-21 17:08:16,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 05:08:16 BoogieIcfgContainer [2021-08-21 17:08:16,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-21 17:08:16,332 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-21 17:08:16,333 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-21 17:08:16,335 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-21 17:08:16,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.08 05:08:13" (1/3) ... [2021-08-21 17:08:16,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@228d2471 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 05:08:16, skipping insertion in model container [2021-08-21 17:08:16,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:08:14" (2/3) ... [2021-08-21 17:08:16,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@228d2471 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 05:08:16, skipping insertion in model container [2021-08-21 17:08:16,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 05:08:16" (3/3) ... [2021-08-21 17:08:16,338 INFO L111 eAbstractionObserver]: Analyzing ICFG safe004_rmo.opt.i [2021-08-21 17:08:16,342 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-21 17:08:16,342 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-21 17:08:16,342 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-21 17:08:16,342 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-21 17:08:16,405 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,406 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,406 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,406 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,406 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,406 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,406 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,406 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,406 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,407 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,407 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,407 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,407 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,407 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,407 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,408 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,408 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,408 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,408 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,409 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,409 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,409 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,409 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,410 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,410 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,410 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,410 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,410 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,411 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,411 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,411 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,411 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,411 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,411 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,412 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,412 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,412 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,412 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,412 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,412 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,413 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,413 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,413 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,413 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,413 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,413 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,413 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,413 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,413 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,414 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,414 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,414 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,414 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,414 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,414 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,414 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,415 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,415 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,415 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,415 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,416 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,416 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,416 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,416 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,417 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,417 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,417 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,425 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,426 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,428 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,431 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,436 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,439 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,439 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:08:16,441 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-21 17:08:16,489 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-21 17:08:16,497 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-21 17:08:16,497 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-08-21 17:08:18,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 11927 states, 10441 states have (on average 2.306196724451681) internal successors, (24079), 11926 states have internal predecessors, (24079), 0 states have call successors, (0), 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-21 17:08:18,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-21 17:08:18,033 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:08:18,034 INFO L512 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-21 17:08:18,035 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:08:18,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:08:18,039 INFO L82 PathProgramCache]: Analyzing trace with hash -83043767, now seen corresponding path program 1 times [2021-08-21 17:08:18,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:08:18,047 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360666149] [2021-08-21 17:08:18,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:08:18,048 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:08:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:08:18,326 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-21 17:08:18,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:08:18,327 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360666149] [2021-08-21 17:08:18,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360666149] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:08:18,328 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:08:18,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-21 17:08:18,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447206020] [2021-08-21 17:08:18,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-21 17:08:18,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:08:18,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-21 17:08:18,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 17:08:18,383 INFO L87 Difference]: Start difference. First operand has 11927 states, 10441 states have (on average 2.306196724451681) internal successors, (24079), 11926 states have internal predecessors, (24079), 0 states have call successors, (0), 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-21 17:08:18,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:08:18,570 INFO L93 Difference]: Finished difference Result 10015 states and 19724 transitions. [2021-08-21 17:08:18,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-21 17:08:18,573 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-21 17:08:18,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:08:18,620 INFO L225 Difference]: With dead ends: 10015 [2021-08-21 17:08:18,620 INFO L226 Difference]: Without dead ends: 5196 [2021-08-21 17:08:18,621 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 17:08:18,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5196 states. [2021-08-21 17:08:18,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5196 to 5196. [2021-08-21 17:08:18,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5196 states, 5132 states have (on average 2.4512860483242402) internal successors, (12580), 5195 states have internal predecessors, (12580), 0 states have call successors, (0), 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-21 17:08:18,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5196 states to 5196 states and 12580 transitions. [2021-08-21 17:08:18,865 INFO L78 Accepts]: Start accepts. Automaton has 5196 states and 12580 transitions. Word has length 48 [2021-08-21 17:08:18,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:08:18,865 INFO L470 AbstractCegarLoop]: Abstraction has 5196 states and 12580 transitions. [2021-08-21 17:08:18,866 INFO L471 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-21 17:08:18,866 INFO L276 IsEmpty]: Start isEmpty. Operand 5196 states and 12580 transitions. [2021-08-21 17:08:18,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-21 17:08:18,932 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:08:18,932 INFO L512 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-21 17:08:18,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-21 17:08:18,932 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:08:18,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:08:18,933 INFO L82 PathProgramCache]: Analyzing trace with hash 907583695, now seen corresponding path program 1 times [2021-08-21 17:08:18,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:08:18,933 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466857029] [2021-08-21 17:08:18,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:08:18,934 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:08:19,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:08:19,201 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-21 17:08:19,201 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:08:19,201 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466857029] [2021-08-21 17:08:19,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466857029] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:08:19,201 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:08:19,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 17:08:19,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207642753] [2021-08-21 17:08:19,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 17:08:19,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:08:19,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 17:08:19,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 17:08:19,206 INFO L87 Difference]: Start difference. First operand 5196 states and 12580 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-21 17:08:19,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:08:19,414 INFO L93 Difference]: Finished difference Result 6504 states and 16085 transitions. [2021-08-21 17:08:19,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-21 17:08:19,415 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-21 17:08:19,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:08:19,442 INFO L225 Difference]: With dead ends: 6504 [2021-08-21 17:08:19,442 INFO L226 Difference]: Without dead ends: 4919 [2021-08-21 17:08:19,443 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 91.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-21 17:08:19,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4919 states. [2021-08-21 17:08:19,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4919 to 4919. [2021-08-21 17:08:19,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4919 states, 4861 states have (on average 2.4577247479942397) internal successors, (11947), 4918 states have internal predecessors, (11947), 0 states have call successors, (0), 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-21 17:08:19,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4919 states to 4919 states and 11947 transitions. [2021-08-21 17:08:19,587 INFO L78 Accepts]: Start accepts. Automaton has 4919 states and 11947 transitions. Word has length 67 [2021-08-21 17:08:19,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:08:19,588 INFO L470 AbstractCegarLoop]: Abstraction has 4919 states and 11947 transitions. [2021-08-21 17:08:19,588 INFO L471 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-21 17:08:19,588 INFO L276 IsEmpty]: Start isEmpty. Operand 4919 states and 11947 transitions. [2021-08-21 17:08:19,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-08-21 17:08:19,596 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:08:19,596 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:08:19,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-21 17:08:19,597 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:08:19,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:08:19,598 INFO L82 PathProgramCache]: Analyzing trace with hash 892503536, now seen corresponding path program 1 times [2021-08-21 17:08:19,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:08:19,598 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967750232] [2021-08-21 17:08:19,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:08:19,599 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:08:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:08:19,853 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-21 17:08:19,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:08:19,854 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967750232] [2021-08-21 17:08:19,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967750232] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:08:19,854 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:08:19,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 17:08:19,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408705797] [2021-08-21 17:08:19,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 17:08:19,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:08:19,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 17:08:19,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 17:08:19,867 INFO L87 Difference]: Start difference. First operand 4919 states and 11947 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:08:20,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:08:20,013 INFO L93 Difference]: Finished difference Result 5267 states and 13129 transitions. [2021-08-21 17:08:20,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-21 17:08:20,013 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-08-21 17:08:20,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:08:20,035 INFO L225 Difference]: With dead ends: 5267 [2021-08-21 17:08:20,035 INFO L226 Difference]: Without dead ends: 3875 [2021-08-21 17:08:20,036 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 87.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-21 17:08:20,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3875 states. [2021-08-21 17:08:20,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3875 to 3875. [2021-08-21 17:08:20,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3875 states, 3817 states have (on average 2.4445899921404246) internal successors, (9331), 3874 states have internal predecessors, (9331), 0 states have call successors, (0), 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-21 17:08:20,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3875 states to 3875 states and 9331 transitions. [2021-08-21 17:08:20,136 INFO L78 Accepts]: Start accepts. Automaton has 3875 states and 9331 transitions. Word has length 69 [2021-08-21 17:08:20,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:08:20,137 INFO L470 AbstractCegarLoop]: Abstraction has 3875 states and 9331 transitions. [2021-08-21 17:08:20,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:08:20,137 INFO L276 IsEmpty]: Start isEmpty. Operand 3875 states and 9331 transitions. [2021-08-21 17:08:20,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-21 17:08:20,144 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:08:20,144 INFO L512 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-21 17:08:20,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-21 17:08:20,145 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:08:20,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:08:20,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1116800879, now seen corresponding path program 1 times [2021-08-21 17:08:20,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:08:20,146 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172534223] [2021-08-21 17:08:20,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:08:20,146 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:08:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:08:20,354 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-21 17:08:20,354 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:08:20,354 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172534223] [2021-08-21 17:08:20,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172534223] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:08:20,355 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:08:20,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-21 17:08:20,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568213231] [2021-08-21 17:08:20,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-21 17:08:20,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:08:20,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-21 17:08:20,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-21 17:08:20,356 INFO L87 Difference]: Start difference. First operand 3875 states and 9331 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:08:20,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:08:20,590 INFO L93 Difference]: Finished difference Result 8309 states and 21399 transitions. [2021-08-21 17:08:20,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-21 17:08:20,591 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-08-21 17:08:20,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:08:20,634 INFO L225 Difference]: With dead ends: 8309 [2021-08-21 17:08:20,634 INFO L226 Difference]: Without dead ends: 4937 [2021-08-21 17:08:20,634 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 128.1ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-08-21 17:08:20,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4937 states. [2021-08-21 17:08:20,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4937 to 3707. [2021-08-21 17:08:20,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3707 states, 3649 states have (on average 2.437654151822417) internal successors, (8895), 3706 states have internal predecessors, (8895), 0 states have call successors, (0), 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-21 17:08:20,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3707 states to 3707 states and 8895 transitions. [2021-08-21 17:08:20,765 INFO L78 Accepts]: Start accepts. Automaton has 3707 states and 8895 transitions. Word has length 72 [2021-08-21 17:08:20,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:08:20,766 INFO L470 AbstractCegarLoop]: Abstraction has 3707 states and 8895 transitions. [2021-08-21 17:08:20,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:08:20,766 INFO L276 IsEmpty]: Start isEmpty. Operand 3707 states and 8895 transitions. [2021-08-21 17:08:20,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-21 17:08:20,773 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:08:20,774 INFO L512 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-21 17:08:20,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-21 17:08:20,774 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:08:20,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:08:20,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1916805455, now seen corresponding path program 2 times [2021-08-21 17:08:20,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:08:20,775 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910452387] [2021-08-21 17:08:20,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:08:20,775 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:08:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:08:20,923 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-21 17:08:20,923 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:08:20,924 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910452387] [2021-08-21 17:08:20,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910452387] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:08:20,924 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:08:20,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-21 17:08:20,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854003765] [2021-08-21 17:08:20,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-21 17:08:20,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:08:20,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-21 17:08:20,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-21 17:08:20,926 INFO L87 Difference]: Start difference. First operand 3707 states and 8895 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:08:21,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:08:21,049 INFO L93 Difference]: Finished difference Result 4883 states and 12139 transitions. [2021-08-21 17:08:21,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-21 17:08:21,050 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-08-21 17:08:21,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:08:21,059 INFO L225 Difference]: With dead ends: 4883 [2021-08-21 17:08:21,059 INFO L226 Difference]: Without dead ends: 2834 [2021-08-21 17:08:21,059 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 79.5ms TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-08-21 17:08:21,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2021-08-21 17:08:21,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 2834. [2021-08-21 17:08:21,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2834 states, 2794 states have (on average 2.4226914817466) internal successors, (6769), 2833 states have internal predecessors, (6769), 0 states have call successors, (0), 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-21 17:08:21,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2834 states to 2834 states and 6769 transitions. [2021-08-21 17:08:21,134 INFO L78 Accepts]: Start accepts. Automaton has 2834 states and 6769 transitions. Word has length 72 [2021-08-21 17:08:21,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:08:21,135 INFO L470 AbstractCegarLoop]: Abstraction has 2834 states and 6769 transitions. [2021-08-21 17:08:21,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:08:21,136 INFO L276 IsEmpty]: Start isEmpty. Operand 2834 states and 6769 transitions. [2021-08-21 17:08:21,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-21 17:08:21,141 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:08:21,142 INFO L512 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-21 17:08:21,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-21 17:08:21,142 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:08:21,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:08:21,143 INFO L82 PathProgramCache]: Analyzing trace with hash 428825667, now seen corresponding path program 1 times [2021-08-21 17:08:21,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:08:21,143 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305438074] [2021-08-21 17:08:21,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:08:21,143 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:08:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:08:21,282 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-21 17:08:21,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:08:21,283 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305438074] [2021-08-21 17:08:21,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305438074] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:08:21,283 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:08:21,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 17:08:21,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069470475] [2021-08-21 17:08:21,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 17:08:21,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:08:21,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 17:08:21,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 17:08:21,284 INFO L87 Difference]: Start difference. First operand 2834 states and 6769 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-21 17:08:21,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:08:21,425 INFO L93 Difference]: Finished difference Result 4104 states and 10508 transitions. [2021-08-21 17:08:21,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-21 17:08:21,425 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-21 17:08:21,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:08:21,430 INFO L225 Difference]: With dead ends: 4104 [2021-08-21 17:08:21,430 INFO L226 Difference]: Without dead ends: 1528 [2021-08-21 17:08:21,431 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 90.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-21 17:08:21,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2021-08-21 17:08:21,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1528. [2021-08-21 17:08:21,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1528 states, 1498 states have (on average 2.628838451268358) internal successors, (3938), 1527 states have internal predecessors, (3938), 0 states have call successors, (0), 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-21 17:08:21,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 3938 transitions. [2021-08-21 17:08:21,464 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 3938 transitions. Word has length 73 [2021-08-21 17:08:21,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:08:21,464 INFO L470 AbstractCegarLoop]: Abstraction has 1528 states and 3938 transitions. [2021-08-21 17:08:21,464 INFO L471 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-21 17:08:21,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 3938 transitions. [2021-08-21 17:08:21,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-21 17:08:21,467 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:08:21,467 INFO L512 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-21 17:08:21,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-21 17:08:21,468 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:08:21,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:08:21,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1620547180, now seen corresponding path program 1 times [2021-08-21 17:08:21,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:08:21,468 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407602334] [2021-08-21 17:08:21,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:08:21,469 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:08:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:08:21,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:08:21,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:08:21,700 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407602334] [2021-08-21 17:08:21,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407602334] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:08:21,700 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:08:21,700 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-21 17:08:21,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476327327] [2021-08-21 17:08:21,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-21 17:08:21,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:08:21,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-21 17:08:21,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-21 17:08:21,703 INFO L87 Difference]: Start difference. First operand 1528 states and 3938 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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-21 17:08:22,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:08:22,028 INFO L93 Difference]: Finished difference Result 1916 states and 5116 transitions. [2021-08-21 17:08:22,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-21 17:08:22,029 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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-21 17:08:22,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:08:22,033 INFO L225 Difference]: With dead ends: 1916 [2021-08-21 17:08:22,033 INFO L226 Difference]: Without dead ends: 1556 [2021-08-21 17:08:22,034 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 175.0ms TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2021-08-21 17:08:22,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2021-08-21 17:08:22,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1536. [2021-08-21 17:08:22,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1536 states, 1506 states have (on average 2.6301460823373173) internal successors, (3961), 1535 states have internal predecessors, (3961), 0 states have call successors, (0), 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-21 17:08:22,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1536 states and 3961 transitions. [2021-08-21 17:08:22,070 INFO L78 Accepts]: Start accepts. Automaton has 1536 states and 3961 transitions. Word has length 75 [2021-08-21 17:08:22,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:08:22,070 INFO L470 AbstractCegarLoop]: Abstraction has 1536 states and 3961 transitions. [2021-08-21 17:08:22,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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-21 17:08:22,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 3961 transitions. [2021-08-21 17:08:22,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-21 17:08:22,073 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:08:22,074 INFO L512 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-21 17:08:22,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-21 17:08:22,074 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:08:22,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:08:22,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1203532062, now seen corresponding path program 2 times [2021-08-21 17:08:22,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:08:22,075 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524039039] [2021-08-21 17:08:22,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:08:22,075 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:08:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:08:22,257 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-21 17:08:22,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:08:22,257 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524039039] [2021-08-21 17:08:22,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524039039] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:08:22,257 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:08:22,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-21 17:08:22,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844741282] [2021-08-21 17:08:22,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-21 17:08:22,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:08:22,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-21 17:08:22,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-08-21 17:08:22,259 INFO L87 Difference]: Start difference. First operand 1536 states and 3961 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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-21 17:08:22,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:08:22,492 INFO L93 Difference]: Finished difference Result 1890 states and 5036 transitions. [2021-08-21 17:08:22,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-21 17:08:22,493 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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-21 17:08:22,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:08:22,497 INFO L225 Difference]: With dead ends: 1890 [2021-08-21 17:08:22,497 INFO L226 Difference]: Without dead ends: 1530 [2021-08-21 17:08:22,498 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 138.8ms TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-08-21 17:08:22,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2021-08-21 17:08:22,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1530. [2021-08-21 17:08:22,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1530 states, 1500 states have (on average 2.6246666666666667) internal successors, (3937), 1529 states have internal predecessors, (3937), 0 states have call successors, (0), 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-21 17:08:22,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 3937 transitions. [2021-08-21 17:08:22,531 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 3937 transitions. Word has length 75 [2021-08-21 17:08:22,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:08:22,531 INFO L470 AbstractCegarLoop]: Abstraction has 1530 states and 3937 transitions. [2021-08-21 17:08:22,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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-21 17:08:22,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 3937 transitions. [2021-08-21 17:08:22,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-08-21 17:08:22,536 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:08:22,536 INFO L512 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-21 17:08:22,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-21 17:08:22,538 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:08:22,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:08:22,538 INFO L82 PathProgramCache]: Analyzing trace with hash -831390428, now seen corresponding path program 1 times [2021-08-21 17:08:22,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:08:22,538 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331248879] [2021-08-21 17:08:22,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:08:22,539 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:08:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:08:22,665 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-21 17:08:22,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:08:22,666 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331248879] [2021-08-21 17:08:22,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331248879] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:08:22,666 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:08:22,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-21 17:08:22,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225780735] [2021-08-21 17:08:22,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-21 17:08:22,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:08:22,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-21 17:08:22,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-21 17:08:22,667 INFO L87 Difference]: Start difference. First operand 1530 states and 3937 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 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-21 17:08:22,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:08:22,775 INFO L93 Difference]: Finished difference Result 2588 states and 6890 transitions. [2021-08-21 17:08:22,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-21 17:08:22,775 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 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-21 17:08:22,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:08:22,780 INFO L225 Difference]: With dead ends: 2588 [2021-08-21 17:08:22,780 INFO L226 Difference]: Without dead ends: 1501 [2021-08-21 17:08:22,780 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 69.9ms TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-08-21 17:08:22,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2021-08-21 17:08:22,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1501. [2021-08-21 17:08:22,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1501 states, 1471 states have (on average 2.6417403127124404) internal successors, (3886), 1500 states have internal predecessors, (3886), 0 states have call successors, (0), 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-21 17:08:22,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 3886 transitions. [2021-08-21 17:08:22,813 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 3886 transitions. Word has length 76 [2021-08-21 17:08:22,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:08:22,813 INFO L470 AbstractCegarLoop]: Abstraction has 1501 states and 3886 transitions. [2021-08-21 17:08:22,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 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-21 17:08:22,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 3886 transitions. [2021-08-21 17:08:22,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-08-21 17:08:22,816 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:08:22,817 INFO L512 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-21 17:08:22,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-21 17:08:22,817 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:08:22,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:08:22,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1564728642, now seen corresponding path program 2 times [2021-08-21 17:08:22,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:08:22,818 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338612854] [2021-08-21 17:08:22,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:08:22,818 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:08:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:08:22,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:08:22,915 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:08:22,915 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338612854] [2021-08-21 17:08:22,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338612854] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:08:22,916 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:08:22,916 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 17:08:22,916 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238563650] [2021-08-21 17:08:22,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 17:08:22,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:08:22,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 17:08:22,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 17:08:22,917 INFO L87 Difference]: Start difference. First operand 1501 states and 3886 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-21 17:08:23,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:08:23,014 INFO L93 Difference]: Finished difference Result 1761 states and 4361 transitions. [2021-08-21 17:08:23,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-21 17:08:23,014 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-21 17:08:23,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:08:23,018 INFO L225 Difference]: With dead ends: 1761 [2021-08-21 17:08:23,018 INFO L226 Difference]: Without dead ends: 1279 [2021-08-21 17:08:23,019 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 71.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-21 17:08:23,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2021-08-21 17:08:23,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1279. [2021-08-21 17:08:23,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1279 states, 1249 states have (on average 2.602882305844676) internal successors, (3251), 1278 states have internal predecessors, (3251), 0 states have call successors, (0), 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-21 17:08:23,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 3251 transitions. [2021-08-21 17:08:23,045 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 3251 transitions. Word has length 76 [2021-08-21 17:08:23,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:08:23,046 INFO L470 AbstractCegarLoop]: Abstraction has 1279 states and 3251 transitions. [2021-08-21 17:08:23,046 INFO L471 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-21 17:08:23,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 3251 transitions. [2021-08-21 17:08:23,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-21 17:08:23,048 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:08:23,049 INFO L512 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-21 17:08:23,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-21 17:08:23,049 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:08:23,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:08:23,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1580687815, now seen corresponding path program 1 times [2021-08-21 17:08:23,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:08:23,050 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027172268] [2021-08-21 17:08:23,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:08:23,050 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:08:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:08:23,168 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-21 17:08:23,169 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:08:23,169 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027172268] [2021-08-21 17:08:23,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027172268] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:08:23,169 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:08:23,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-21 17:08:23,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936538674] [2021-08-21 17:08:23,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-21 17:08:23,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:08:23,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-21 17:08:23,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-21 17:08:23,171 INFO L87 Difference]: Start difference. First operand 1279 states and 3251 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-21 17:08:23,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:08:23,296 INFO L93 Difference]: Finished difference Result 1115 states and 2573 transitions. [2021-08-21 17:08:23,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-21 17:08:23,297 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-21 17:08:23,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:08:23,299 INFO L225 Difference]: With dead ends: 1115 [2021-08-21 17:08:23,299 INFO L226 Difference]: Without dead ends: 732 [2021-08-21 17:08:23,299 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 98.9ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-08-21 17:08:23,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2021-08-21 17:08:23,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 732. [2021-08-21 17:08:23,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 708 states have (on average 2.361581920903955) internal successors, (1672), 731 states have internal predecessors, (1672), 0 states have call successors, (0), 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-21 17:08:23,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1672 transitions. [2021-08-21 17:08:23,312 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1672 transitions. Word has length 77 [2021-08-21 17:08:23,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:08:23,313 INFO L470 AbstractCegarLoop]: Abstraction has 732 states and 1672 transitions. [2021-08-21 17:08:23,313 INFO L471 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-21 17:08:23,313 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1672 transitions. [2021-08-21 17:08:23,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-08-21 17:08:23,314 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:08:23,314 INFO L512 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-21 17:08:23,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-21 17:08:23,315 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:08:23,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:08:23,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1727096360, now seen corresponding path program 1 times [2021-08-21 17:08:23,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:08:23,315 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213684483] [2021-08-21 17:08:23,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:08:23,315 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:08:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:08:23,428 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-21 17:08:23,428 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:08:23,428 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213684483] [2021-08-21 17:08:23,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213684483] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:08:23,428 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:08:23,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-21 17:08:23,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538714690] [2021-08-21 17:08:23,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-21 17:08:23,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:08:23,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-21 17:08:23,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-21 17:08:23,430 INFO L87 Difference]: Start difference. First operand 732 states and 1672 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-21 17:08:23,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:08:23,556 INFO L93 Difference]: Finished difference Result 474 states and 938 transitions. [2021-08-21 17:08:23,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-21 17:08:23,557 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-21 17:08:23,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:08:23,558 INFO L225 Difference]: With dead ends: 474 [2021-08-21 17:08:23,558 INFO L226 Difference]: Without dead ends: 291 [2021-08-21 17:08:23,558 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 101.7ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-08-21 17:08:23,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-08-21 17:08:23,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2021-08-21 17:08:23,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 282 states have (on average 1.8297872340425532) internal successors, (516), 290 states have internal predecessors, (516), 0 states have call successors, (0), 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-21 17:08:23,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 516 transitions. [2021-08-21 17:08:23,563 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 516 transitions. Word has length 79 [2021-08-21 17:08:23,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:08:23,563 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 516 transitions. [2021-08-21 17:08:23,563 INFO L471 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-21 17:08:23,563 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 516 transitions. [2021-08-21 17:08:23,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-08-21 17:08:23,566 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:08:23,566 INFO L512 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-21 17:08:23,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-21 17:08:23,566 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:08:23,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:08:23,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1064536570, now seen corresponding path program 1 times [2021-08-21 17:08:23,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:08:23,567 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117177148] [2021-08-21 17:08:23,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:08:23,567 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:08:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:08:23,825 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-21 17:08:23,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:08:23,825 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117177148] [2021-08-21 17:08:23,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117177148] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:08:23,825 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:08:23,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-21 17:08:23,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041795148] [2021-08-21 17:08:23,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-21 17:08:23,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:08:23,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-21 17:08:23,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-21 17:08:23,827 INFO L87 Difference]: Start difference. First operand 291 states and 516 transitions. Second operand has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 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-21 17:08:23,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:08:23,979 INFO L93 Difference]: Finished difference Result 435 states and 826 transitions. [2021-08-21 17:08:23,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-21 17:08:23,979 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2021-08-21 17:08:23,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:08:23,980 INFO L225 Difference]: With dead ends: 435 [2021-08-21 17:08:23,980 INFO L226 Difference]: Without dead ends: 312 [2021-08-21 17:08:23,980 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 131.5ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-08-21 17:08:23,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-08-21 17:08:23,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 287. [2021-08-21 17:08:23,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 278 states have (on average 1.8129496402877698) internal successors, (504), 286 states have internal predecessors, (504), 0 states have call successors, (0), 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-21 17:08:23,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 504 transitions. [2021-08-21 17:08:23,985 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 504 transitions. Word has length 82 [2021-08-21 17:08:23,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:08:23,985 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 504 transitions. [2021-08-21 17:08:23,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 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-21 17:08:23,985 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 504 transitions. [2021-08-21 17:08:23,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-08-21 17:08:23,986 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:08:23,986 INFO L512 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-21 17:08:23,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-21 17:08:23,986 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:08:23,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:08:23,987 INFO L82 PathProgramCache]: Analyzing trace with hash -821267482, now seen corresponding path program 2 times [2021-08-21 17:08:23,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:08:23,987 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723456289] [2021-08-21 17:08:23,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:08:23,987 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:08:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:08:24,328 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-21 17:08:24,328 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:08:24,328 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723456289] [2021-08-21 17:08:24,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723456289] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:08:24,328 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:08:24,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-21 17:08:24,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143096384] [2021-08-21 17:08:24,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-21 17:08:24,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:08:24,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-21 17:08:24,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-08-21 17:08:24,330 INFO L87 Difference]: Start difference. First operand 287 states and 504 transitions. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 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-21 17:08:24,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:08:24,562 INFO L93 Difference]: Finished difference Result 427 states and 807 transitions. [2021-08-21 17:08:24,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-21 17:08:24,563 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2021-08-21 17:08:24,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:08:24,563 INFO L225 Difference]: With dead ends: 427 [2021-08-21 17:08:24,564 INFO L226 Difference]: Without dead ends: 252 [2021-08-21 17:08:24,564 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 219.7ms TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2021-08-21 17:08:24,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-08-21 17:08:24,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 251. [2021-08-21 17:08:24,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 242 states have (on average 1.8677685950413223) internal successors, (452), 250 states have internal predecessors, (452), 0 states have call successors, (0), 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-21 17:08:24,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 452 transitions. [2021-08-21 17:08:24,568 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 452 transitions. Word has length 82 [2021-08-21 17:08:24,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:08:24,568 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 452 transitions. [2021-08-21 17:08:24,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 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-21 17:08:24,568 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 452 transitions. [2021-08-21 17:08:24,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-08-21 17:08:24,569 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:08:24,569 INFO L512 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-21 17:08:24,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-21 17:08:24,569 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:08:24,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:08:24,570 INFO L82 PathProgramCache]: Analyzing trace with hash 363375434, now seen corresponding path program 3 times [2021-08-21 17:08:24,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:08:24,570 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348289218] [2021-08-21 17:08:24,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:08:24,570 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:08:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-21 17:08:24,610 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-21 17:08:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-21 17:08:24,700 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-21 17:08:24,700 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-21 17:08:24,701 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 17:08:24,703 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 17:08:24,704 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-08-21 17:08:24,706 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-08-21 17:08:24,706 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-08-21 17:08:24,706 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 17:08:24,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-21 17:08:24,712 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-21 17:08:24,712 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-21 17:08:24,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.08 05:08:24 BasicIcfg [2021-08-21 17:08:24,818 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-21 17:08:24,819 INFO L168 Benchmark]: Toolchain (without parser) took 11111.19 ms. Allocated memory was 180.4 MB in the beginning and 491.8 MB in the end (delta: 311.4 MB). Free memory was 145.0 MB in the beginning and 241.5 MB in the end (delta: -96.5 MB). Peak memory consumption was 215.6 MB. Max. memory is 8.0 GB. [2021-08-21 17:08:24,819 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 180.4 MB. Free memory is still 163.0 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-21 17:08:24,819 INFO L168 Benchmark]: CACSL2BoogieTranslator took 540.35 ms. Allocated memory is still 180.4 MB. Free memory was 144.8 MB in the beginning and 151.5 MB in the end (delta: -6.7 MB). Peak memory consumption was 14.8 MB. Max. memory is 8.0 GB. [2021-08-21 17:08:24,820 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.34 ms. Allocated memory is still 180.4 MB. Free memory was 151.5 MB in the beginning and 148.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-21 17:08:24,820 INFO L168 Benchmark]: Boogie Preprocessor took 57.24 ms. Allocated memory is still 180.4 MB. Free memory was 148.8 MB in the beginning and 146.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-21 17:08:24,820 INFO L168 Benchmark]: RCFGBuilder took 1941.65 ms. Allocated memory was 180.4 MB in the beginning and 217.1 MB in the end (delta: 36.7 MB). Free memory was 146.3 MB in the beginning and 180.8 MB in the end (delta: -34.6 MB). Peak memory consumption was 86.9 MB. Max. memory is 8.0 GB. [2021-08-21 17:08:24,821 INFO L168 Benchmark]: TraceAbstraction took 8485.16 ms. Allocated memory was 217.1 MB in the beginning and 491.8 MB in the end (delta: 274.7 MB). Free memory was 180.3 MB in the beginning and 241.5 MB in the end (delta: -61.2 MB). Peak memory consumption was 213.5 MB. Max. memory is 8.0 GB. [2021-08-21 17:08:24,822 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 180.4 MB. Free memory is still 163.0 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 540.35 ms. Allocated memory is still 180.4 MB. Free memory was 144.8 MB in the beginning and 151.5 MB in the end (delta: -6.7 MB). Peak memory consumption was 14.8 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 76.34 ms. Allocated memory is still 180.4 MB. Free memory was 151.5 MB in the beginning and 148.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 57.24 ms. Allocated memory is still 180.4 MB. Free memory was 148.8 MB in the beginning and 146.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1941.65 ms. Allocated memory was 180.4 MB in the beginning and 217.1 MB in the end (delta: 36.7 MB). Free memory was 146.3 MB in the beginning and 180.8 MB in the end (delta: -34.6 MB). Peak memory consumption was 86.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 8485.16 ms. Allocated memory was 217.1 MB in the beginning and 491.8 MB in the end (delta: 274.7 MB). Free memory was 180.3 MB in the beginning and 241.5 MB in the end (delta: -61.2 MB). Peak memory consumption was 213.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 44642, positive: 41133, positive conditional: 41133, positive unconditional: 0, negative: 3509, negative conditional: 3509, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43918, positive: 41133, positive conditional: 0, positive unconditional: 41133, negative: 2785, negative conditional: 0, negative unconditional: 2785, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1086, positive: 1038, positive conditional: 0, positive unconditional: 1038, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1086, positive: 1035, positive conditional: 0, positive unconditional: 1035, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 51, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 586, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 573, negative conditional: 0, negative unconditional: 573, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 43918, positive: 40095, positive conditional: 0, positive unconditional: 40095, negative: 2737, negative conditional: 0, negative unconditional: 2737, unknown: 1086, unknown conditional: 0, unknown unconditional: 1086] , Statistics on independence cache: Total cache size (in pairs): 1086, Positive cache size: 1038, Positive conditional cache size: 0, Positive unconditional cache size: 1038, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48, Independence queries for same thread: 724 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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}, 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}, 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}, 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}, 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}, 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}, 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] [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=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=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] [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=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] [L803] 3 __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] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [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] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [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] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [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] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [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] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [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] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [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=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 819]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 8222.0ms, OverallIterations: 15, TraceHistogramMax: 1, EmptinessCheckTime: 149.2ms, AutomataDifference: 2696.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1500.3ms, PartialOrderReductionTime: 1475.0ms, HoareTripleCheckerStatistics: 1636 SDtfs, 1952 SDslu, 5458 SDs, 0 SdLazy, 731 SolverSat, 128 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 779.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1489.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=11927occurred in iteration=0, InterpolantAutomatonStates: 132, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 868.1ms AutomataMinimizationTime, 14 MinimizatonAttempts, 1276 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 61.4ms SsaConstructionTime, 590.4ms SatisfiabilityAnalysisTime, 1973.8ms InterpolantComputationTime, 1105 NumberOfCodeBlocks, 1105 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1009 ConstructedInterpolants, 0 QuantifiedInterpolants, 4060 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-21 17:08:24,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...