/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe023_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-87fd7473a0bda1db0ad7f77f2116346063730f21-87fd747 [2021-08-21 11:42:19,628 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-21 11:42:19,630 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-21 11:42:19,662 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-21 11:42:19,662 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-21 11:42:19,664 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-21 11:42:19,666 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-21 11:42:19,670 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-21 11:42:19,672 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-21 11:42:19,675 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-21 11:42:19,676 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-21 11:42:19,677 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-21 11:42:19,677 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-21 11:42:19,678 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-21 11:42:19,680 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-21 11:42:19,682 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-21 11:42:19,683 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-21 11:42:19,684 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-21 11:42:19,686 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-21 11:42:19,692 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-21 11:42:19,694 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-21 11:42:19,695 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-21 11:42:19,696 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-21 11:42:19,698 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-21 11:42:19,703 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-21 11:42:19,703 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-21 11:42:19,703 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-21 11:42:19,704 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-21 11:42:19,704 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-21 11:42:19,705 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-21 11:42:19,705 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-21 11:42:19,705 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-21 11:42:19,706 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-21 11:42:19,707 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-21 11:42:19,708 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-21 11:42:19,708 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-21 11:42:19,708 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-21 11:42:19,709 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-21 11:42:19,709 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-21 11:42:19,709 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-21 11:42:19,710 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-21 11:42:19,710 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-08-21 11:42:19,739 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-21 11:42:19,740 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-21 11:42:19,740 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-21 11:42:19,740 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-21 11:42:19,743 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-21 11:42:19,743 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-21 11:42:19,743 INFO L138 SettingsManager]: * Use SBE=true [2021-08-21 11:42:19,743 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-21 11:42:19,743 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-21 11:42:19,744 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-21 11:42:19,744 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-21 11:42:19,744 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-21 11:42:19,744 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-21 11:42:19,745 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-21 11:42:19,745 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-21 11:42:19,745 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-21 11:42:19,745 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-21 11:42:19,745 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-21 11:42:19,745 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-21 11:42:19,745 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-21 11:42:19,745 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-21 11:42:19,746 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-21 11:42:19,746 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-21 11:42:19,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-21 11:42:19,746 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-21 11:42:19,746 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-21 11:42:19,746 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-21 11:42:19,746 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-21 11:42:19,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-21 11:42:19,747 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-21 11:42:19,747 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-21 11:42:19,747 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 11:42:20,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-21 11:42:20,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-21 11:42:20,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-21 11:42:20,026 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-21 11:42:20,026 INFO L275 PluginConnector]: CDTParser initialized [2021-08-21 11:42:20,027 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe023_rmo.opt.i [2021-08-21 11:42:20,072 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72d3a88aa/d511cfa4c5f64fc0a6966e194ac2d976/FLAG6770da9c6 [2021-08-21 11:42:20,526 INFO L306 CDTParser]: Found 1 translation units. [2021-08-21 11:42:20,527 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_rmo.opt.i [2021-08-21 11:42:20,544 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72d3a88aa/d511cfa4c5f64fc0a6966e194ac2d976/FLAG6770da9c6 [2021-08-21 11:42:20,844 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72d3a88aa/d511cfa4c5f64fc0a6966e194ac2d976 [2021-08-21 11:42:20,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-21 11:42:20,846 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-21 11:42:20,847 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-21 11:42:20,847 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-21 11:42:20,852 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-21 11:42:20,853 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 11:42:20" (1/1) ... [2021-08-21 11:42:20,854 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24b9e5c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:42:20, skipping insertion in model container [2021-08-21 11:42:20,855 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 11:42:20" (1/1) ... [2021-08-21 11:42:20,859 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-21 11:42:20,902 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-21 11:42:21,052 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/safe023_rmo.opt.i[992,1005] [2021-08-21 11:42:21,259 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-21 11:42:21,264 INFO L203 MainTranslator]: Completed pre-run [2021-08-21 11:42:21,278 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/safe023_rmo.opt.i[992,1005] [2021-08-21 11:42:21,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-21 11:42:21,361 INFO L208 MainTranslator]: Completed translation [2021-08-21 11:42:21,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:42:21 WrapperNode [2021-08-21 11:42:21,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-21 11:42:21,363 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-21 11:42:21,363 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-21 11:42:21,363 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-21 11:42:21,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:42:21" (1/1) ... [2021-08-21 11:42:21,409 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:42:21" (1/1) ... [2021-08-21 11:42:21,440 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-21 11:42:21,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-21 11:42:21,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-21 11:42:21,441 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-21 11:42:21,447 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:42:21" (1/1) ... [2021-08-21 11:42:21,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:42:21" (1/1) ... [2021-08-21 11:42:21,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:42:21" (1/1) ... [2021-08-21 11:42:21,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:42:21" (1/1) ... [2021-08-21 11:42:21,479 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:42:21" (1/1) ... [2021-08-21 11:42:21,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:42:21" (1/1) ... [2021-08-21 11:42:21,491 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:42:21" (1/1) ... [2021-08-21 11:42:21,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-21 11:42:21,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-21 11:42:21,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-21 11:42:21,495 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-21 11:42:21,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:42:21" (1/1) ... [2021-08-21 11:42:21,504 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-21 11:42:21,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-21 11:42:21,526 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 11:42:21,553 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 11:42:21,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-21 11:42:21,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-21 11:42:21,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-21 11:42:21,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-21 11:42:21,567 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-21 11:42:21,567 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-21 11:42:21,567 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-21 11:42:21,567 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-21 11:42:21,567 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-21 11:42:21,567 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-21 11:42:21,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-21 11:42:21,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-21 11:42:21,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-21 11:42:21,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-21 11:42:21,569 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 11:42:23,924 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-21 11:42:23,924 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-21 11:42:23,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 11:42:23 BoogieIcfgContainer [2021-08-21 11:42:23,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-21 11:42:23,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-21 11:42:23,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-21 11:42:23,929 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-21 11:42:23,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.08 11:42:20" (1/3) ... [2021-08-21 11:42:23,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd305c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 11:42:23, skipping insertion in model container [2021-08-21 11:42:23,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:42:21" (2/3) ... [2021-08-21 11:42:23,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd305c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 11:42:23, skipping insertion in model container [2021-08-21 11:42:23,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 11:42:23" (3/3) ... [2021-08-21 11:42:23,931 INFO L111 eAbstractionObserver]: Analyzing ICFG safe023_rmo.opt.i [2021-08-21 11:42:23,934 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-21 11:42:23,934 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-21 11:42:23,934 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-21 11:42:23,934 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-21 11:42:23,970 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,970 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,970 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,971 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,971 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,971 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,971 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,971 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,971 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,971 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,971 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,971 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,971 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,972 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,972 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,972 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,972 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,972 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,972 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,972 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,972 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,972 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,973 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,973 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,973 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,973 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,973 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,973 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,973 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,973 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,973 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,973 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,976 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,976 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,977 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,977 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,977 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,977 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,977 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,977 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,977 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,977 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,977 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,977 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,978 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,978 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,978 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,978 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,978 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,978 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,978 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,978 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,978 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,978 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,978 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,980 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,980 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,980 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,980 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,980 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,980 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,981 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,981 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,981 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,983 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,983 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,983 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,984 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,984 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,984 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,984 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,984 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,984 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,984 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,984 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,984 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,984 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,984 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,985 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,985 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,985 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,985 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,985 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,985 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,985 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,985 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,985 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,986 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,986 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,986 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,986 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,986 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,986 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,986 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,986 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,986 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,986 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,987 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,987 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,987 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,987 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,987 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,987 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,987 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,987 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,987 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,987 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,987 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,997 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,997 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,997 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,997 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,997 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,997 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,997 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,997 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:23,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,000 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,001 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,004 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,004 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,004 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,004 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,004 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,004 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,005 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,005 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,005 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,005 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,005 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,005 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,005 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,005 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,005 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,006 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,006 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,006 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,006 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,006 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,006 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,006 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,006 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,006 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,006 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,006 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,007 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,007 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,007 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,007 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,007 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,007 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,007 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,007 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,007 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,007 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,007 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,008 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,008 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,009 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,009 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,009 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,009 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,009 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,009 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,010 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,010 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,010 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,010 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,010 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,010 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:42:24,011 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-21 11:42:24,038 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-21 11:42:24,044 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 11:42:24,045 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-08-21 11:42:24,052 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 116 places, 108 transitions, 231 flow [2021-08-21 11:42:24,405 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 13414 states, 13411 states have (on average 3.577138170158825) internal successors, (47973), 13413 states have internal predecessors, (47973), 0 states have call successors, (0), 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 11:42:24,437 INFO L276 IsEmpty]: Start isEmpty. Operand has 13414 states, 13411 states have (on average 3.577138170158825) internal successors, (47973), 13413 states have internal predecessors, (47973), 0 states have call successors, (0), 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 11:42:24,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-08-21 11:42:24,444 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:42:24,445 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] [2021-08-21 11:42:24,445 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 11:42:24,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:42:24,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1631481371, now seen corresponding path program 1 times [2021-08-21 11:42:24,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:42:24,458 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303296963] [2021-08-21 11:42:24,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:42:24,460 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:42:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:42:24,740 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 11:42:24,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:42:24,741 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303296963] [2021-08-21 11:42:24,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303296963] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:42:24,742 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:42:24,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-21 11:42:24,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12170132] [2021-08-21 11:42:24,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-21 11:42:24,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:42:24,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-21 11:42:24,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 11:42:24,787 INFO L87 Difference]: Start difference. First operand has 13414 states, 13411 states have (on average 3.577138170158825) internal successors, (47973), 13413 states have internal predecessors, (47973), 0 states have call successors, (0), 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.5) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 11:42:24,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:42:24,971 INFO L93 Difference]: Finished difference Result 11263 states and 39212 transitions. [2021-08-21 11:42:24,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-21 11:42:24,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2021-08-21 11:42:24,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:42:25,045 INFO L225 Difference]: With dead ends: 11263 [2021-08-21 11:42:25,046 INFO L226 Difference]: Without dead ends: 9247 [2021-08-21 11:42:25,047 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 11:42:25,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9247 states. [2021-08-21 11:42:25,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9247 to 9247. [2021-08-21 11:42:25,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9247 states, 9246 states have (on average 3.505948518278174) internal successors, (32416), 9246 states have internal predecessors, (32416), 0 states have call successors, (0), 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 11:42:25,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9247 states to 9247 states and 32416 transitions. [2021-08-21 11:42:25,530 INFO L78 Accepts]: Start accepts. Automaton has 9247 states and 32416 transitions. Word has length 49 [2021-08-21 11:42:25,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:42:25,530 INFO L470 AbstractCegarLoop]: Abstraction has 9247 states and 32416 transitions. [2021-08-21 11:42:25,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 11:42:25,531 INFO L276 IsEmpty]: Start isEmpty. Operand 9247 states and 32416 transitions. [2021-08-21 11:42:25,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-08-21 11:42:25,541 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:42:25,542 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] [2021-08-21 11:42:25,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-21 11:42:25,542 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 11:42:25,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:42:25,543 INFO L82 PathProgramCache]: Analyzing trace with hash 80787783, now seen corresponding path program 1 times [2021-08-21 11:42:25,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:42:25,543 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406908088] [2021-08-21 11:42:25,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:42:25,543 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:42:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:42:25,745 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 11:42:25,745 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:42:25,746 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406908088] [2021-08-21 11:42:25,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406908088] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:42:25,746 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:42:25,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 11:42:25,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694742796] [2021-08-21 11:42:25,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 11:42:25,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:42:25,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 11:42:25,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 11:42:25,749 INFO L87 Difference]: Start difference. First operand 9247 states and 32416 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:42:25,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:42:25,978 INFO L93 Difference]: Finished difference Result 10687 states and 37116 transitions. [2021-08-21 11:42:25,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-21 11:42:25,979 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-08-21 11:42:25,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:42:26,036 INFO L225 Difference]: With dead ends: 10687 [2021-08-21 11:42:26,036 INFO L226 Difference]: Without dead ends: 8383 [2021-08-21 11:42:26,037 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 61.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-21 11:42:26,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8383 states. [2021-08-21 11:42:26,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8383 to 8383. [2021-08-21 11:42:26,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8383 states, 8382 states have (on average 3.4793605344786447) internal successors, (29164), 8382 states have internal predecessors, (29164), 0 states have call successors, (0), 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 11:42:26,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8383 states to 8383 states and 29164 transitions. [2021-08-21 11:42:26,275 INFO L78 Accepts]: Start accepts. Automaton has 8383 states and 29164 transitions. Word has length 68 [2021-08-21 11:42:26,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:42:26,276 INFO L470 AbstractCegarLoop]: Abstraction has 8383 states and 29164 transitions. [2021-08-21 11:42:26,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:42:26,276 INFO L276 IsEmpty]: Start isEmpty. Operand 8383 states and 29164 transitions. [2021-08-21 11:42:26,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-08-21 11:42:26,390 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:42:26,390 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] [2021-08-21 11:42:26,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-21 11:42:26,391 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 11:42:26,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:42:26,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1422607162, now seen corresponding path program 1 times [2021-08-21 11:42:26,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:42:26,399 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262174962] [2021-08-21 11:42:26,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:42:26,399 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:42:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:42:26,594 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 11:42:26,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:42:26,594 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262174962] [2021-08-21 11:42:26,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262174962] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:42:26,595 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:42:26,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 11:42:26,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059442005] [2021-08-21 11:42:26,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 11:42:26,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:42:26,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 11:42:26,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 11:42:26,596 INFO L87 Difference]: Start difference. First operand 8383 states and 29164 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:42:26,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:42:26,759 INFO L93 Difference]: Finished difference Result 8959 states and 30868 transitions. [2021-08-21 11:42:26,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-21 11:42:26,760 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-08-21 11:42:26,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:42:26,786 INFO L225 Difference]: With dead ends: 8959 [2021-08-21 11:42:26,786 INFO L226 Difference]: Without dead ends: 7231 [2021-08-21 11:42:26,787 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 69.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-21 11:42:26,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7231 states. [2021-08-21 11:42:27,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7231 to 7231. [2021-08-21 11:42:27,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7231 states, 7230 states have (on average 3.442876901798064) internal successors, (24892), 7230 states have internal predecessors, (24892), 0 states have call successors, (0), 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 11:42:27,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7231 states to 7231 states and 24892 transitions. [2021-08-21 11:42:27,041 INFO L78 Accepts]: Start accepts. Automaton has 7231 states and 24892 transitions. Word has length 70 [2021-08-21 11:42:27,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:42:27,041 INFO L470 AbstractCegarLoop]: Abstraction has 7231 states and 24892 transitions. [2021-08-21 11:42:27,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:42:27,041 INFO L276 IsEmpty]: Start isEmpty. Operand 7231 states and 24892 transitions. [2021-08-21 11:42:27,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-21 11:42:27,055 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:42:27,055 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] [2021-08-21 11:42:27,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-21 11:42:27,055 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 11:42:27,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:42:27,056 INFO L82 PathProgramCache]: Analyzing trace with hash -718976248, now seen corresponding path program 1 times [2021-08-21 11:42:27,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:42:27,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092102005] [2021-08-21 11:42:27,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:42:27,056 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:42:27,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:42:27,187 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 11:42:27,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:42:27,187 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092102005] [2021-08-21 11:42:27,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092102005] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:42:27,191 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:42:27,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-21 11:42:27,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573891466] [2021-08-21 11:42:27,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-21 11:42:27,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:42:27,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-21 11:42:27,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-21 11:42:27,193 INFO L87 Difference]: Start difference. First operand 7231 states and 24892 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:42:27,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:42:27,377 INFO L93 Difference]: Finished difference Result 10081 states and 34587 transitions. [2021-08-21 11:42:27,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-21 11:42:27,378 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-08-21 11:42:27,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:42:27,393 INFO L225 Difference]: With dead ends: 10081 [2021-08-21 11:42:27,393 INFO L226 Difference]: Without dead ends: 5233 [2021-08-21 11:42:27,394 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 111.7ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-08-21 11:42:27,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5233 states. [2021-08-21 11:42:27,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5233 to 5233. [2021-08-21 11:42:27,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5233 states, 5232 states have (on average 3.3298929663608563) internal successors, (17422), 5232 states have internal predecessors, (17422), 0 states have call successors, (0), 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 11:42:27,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5233 states to 5233 states and 17422 transitions. [2021-08-21 11:42:27,589 INFO L78 Accepts]: Start accepts. Automaton has 5233 states and 17422 transitions. Word has length 74 [2021-08-21 11:42:27,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:42:27,590 INFO L470 AbstractCegarLoop]: Abstraction has 5233 states and 17422 transitions. [2021-08-21 11:42:27,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:42:27,590 INFO L276 IsEmpty]: Start isEmpty. Operand 5233 states and 17422 transitions. [2021-08-21 11:42:27,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-21 11:42:27,601 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:42:27,601 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 11:42:27,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-21 11:42:27,601 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 11:42:27,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:42:27,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1313229512, now seen corresponding path program 1 times [2021-08-21 11:42:27,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:42:27,602 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566094519] [2021-08-21 11:42:27,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:42:27,602 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:42:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:42:27,995 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 11:42:27,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:42:27,995 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566094519] [2021-08-21 11:42:27,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566094519] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:42:27,996 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:42:27,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-21 11:42:27,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723137960] [2021-08-21 11:42:27,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-21 11:42:27,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:42:27,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-21 11:42:27,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-08-21 11:42:27,997 INFO L87 Difference]: Start difference. First operand 5233 states and 17422 transitions. Second operand has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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 11:42:28,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:42:28,530 INFO L93 Difference]: Finished difference Result 6250 states and 20744 transitions. [2021-08-21 11:42:28,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-21 11:42:28,531 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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 11:42:28,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:42:28,546 INFO L225 Difference]: With dead ends: 6250 [2021-08-21 11:42:28,547 INFO L226 Difference]: Without dead ends: 5650 [2021-08-21 11:42:28,547 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 283.6ms TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2021-08-21 11:42:28,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5650 states. [2021-08-21 11:42:28,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5650 to 5650. [2021-08-21 11:42:28,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5650 states, 5649 states have (on average 3.333156310851478) internal successors, (18829), 5649 states have internal predecessors, (18829), 0 states have call successors, (0), 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 11:42:28,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5650 states to 5650 states and 18829 transitions. [2021-08-21 11:42:28,683 INFO L78 Accepts]: Start accepts. Automaton has 5650 states and 18829 transitions. Word has length 77 [2021-08-21 11:42:28,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:42:28,684 INFO L470 AbstractCegarLoop]: Abstraction has 5650 states and 18829 transitions. [2021-08-21 11:42:28,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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 11:42:28,684 INFO L276 IsEmpty]: Start isEmpty. Operand 5650 states and 18829 transitions. [2021-08-21 11:42:28,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-21 11:42:28,694 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:42:28,694 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 11:42:28,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-21 11:42:28,695 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 11:42:28,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:42:28,695 INFO L82 PathProgramCache]: Analyzing trace with hash -686679236, now seen corresponding path program 2 times [2021-08-21 11:42:28,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:42:28,695 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550868082] [2021-08-21 11:42:28,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:42:28,695 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:42:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:42:29,074 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 11:42:29,074 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:42:29,074 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550868082] [2021-08-21 11:42:29,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550868082] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:42:29,074 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:42:29,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-21 11:42:29,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141568761] [2021-08-21 11:42:29,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-21 11:42:29,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:42:29,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-21 11:42:29,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2021-08-21 11:42:29,076 INFO L87 Difference]: Start difference. First operand 5650 states and 18829 transitions. Second operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 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 11:42:29,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:42:29,853 INFO L93 Difference]: Finished difference Result 6364 states and 21117 transitions. [2021-08-21 11:42:29,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-21 11:42:29,854 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 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 11:42:29,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:42:29,870 INFO L225 Difference]: With dead ends: 6364 [2021-08-21 11:42:29,870 INFO L226 Difference]: Without dead ends: 5744 [2021-08-21 11:42:29,870 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 559.9ms TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2021-08-21 11:42:29,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5744 states. [2021-08-21 11:42:29,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5744 to 5705. [2021-08-21 11:42:29,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5705 states, 5704 states have (on average 3.3357293127629735) internal successors, (19027), 5704 states have internal predecessors, (19027), 0 states have call successors, (0), 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 11:42:29,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5705 states to 5705 states and 19027 transitions. [2021-08-21 11:42:29,991 INFO L78 Accepts]: Start accepts. Automaton has 5705 states and 19027 transitions. Word has length 77 [2021-08-21 11:42:29,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:42:29,991 INFO L470 AbstractCegarLoop]: Abstraction has 5705 states and 19027 transitions. [2021-08-21 11:42:29,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 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 11:42:29,992 INFO L276 IsEmpty]: Start isEmpty. Operand 5705 states and 19027 transitions. [2021-08-21 11:42:30,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-21 11:42:30,001 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:42:30,002 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 11:42:30,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-21 11:42:30,002 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 11:42:30,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:42:30,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1419324564, now seen corresponding path program 3 times [2021-08-21 11:42:30,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:42:30,003 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306267782] [2021-08-21 11:42:30,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:42:30,003 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:42:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:42:30,411 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 11:42:30,411 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:42:30,411 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306267782] [2021-08-21 11:42:30,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306267782] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:42:30,411 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:42:30,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-21 11:42:30,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700431849] [2021-08-21 11:42:30,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-21 11:42:30,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:42:30,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-21 11:42:30,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2021-08-21 11:42:30,413 INFO L87 Difference]: Start difference. First operand 5705 states and 19027 transitions. Second operand has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 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 11:42:31,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:42:31,022 INFO L93 Difference]: Finished difference Result 6675 states and 22187 transitions. [2021-08-21 11:42:31,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-21 11:42:31,029 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 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 11:42:31,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:42:31,049 INFO L225 Difference]: With dead ends: 6675 [2021-08-21 11:42:31,049 INFO L226 Difference]: Without dead ends: 6059 [2021-08-21 11:42:31,050 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 332.5ms TimeCoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2021-08-21 11:42:31,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6059 states. [2021-08-21 11:42:31,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6059 to 5764. [2021-08-21 11:42:31,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5764 states, 5763 states have (on average 3.3376713517265313) internal successors, (19235), 5763 states have internal predecessors, (19235), 0 states have call successors, (0), 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 11:42:31,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5764 states to 5764 states and 19235 transitions. [2021-08-21 11:42:31,186 INFO L78 Accepts]: Start accepts. Automaton has 5764 states and 19235 transitions. Word has length 77 [2021-08-21 11:42:31,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:42:31,186 INFO L470 AbstractCegarLoop]: Abstraction has 5764 states and 19235 transitions. [2021-08-21 11:42:31,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 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 11:42:31,186 INFO L276 IsEmpty]: Start isEmpty. Operand 5764 states and 19235 transitions. [2021-08-21 11:42:31,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-21 11:42:31,197 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:42:31,197 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 11:42:31,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-21 11:42:31,197 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 11:42:31,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:42:31,198 INFO L82 PathProgramCache]: Analyzing trace with hash 521980904, now seen corresponding path program 4 times [2021-08-21 11:42:31,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:42:31,199 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859957536] [2021-08-21 11:42:31,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:42:31,199 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:42:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:42:31,459 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 11:42:31,459 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:42:31,459 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859957536] [2021-08-21 11:42:31,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859957536] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:42:31,459 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:42:31,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-21 11:42:31,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688852937] [2021-08-21 11:42:31,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-21 11:42:31,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:42:31,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-21 11:42:31,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-08-21 11:42:31,461 INFO L87 Difference]: Start difference. First operand 5764 states and 19235 transitions. Second operand has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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 11:42:31,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:42:31,845 INFO L93 Difference]: Finished difference Result 9294 states and 30985 transitions. [2021-08-21 11:42:31,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-21 11:42:31,846 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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 11:42:31,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:42:31,868 INFO L225 Difference]: With dead ends: 9294 [2021-08-21 11:42:31,868 INFO L226 Difference]: Without dead ends: 8694 [2021-08-21 11:42:31,869 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 179.8ms TimeCoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2021-08-21 11:42:31,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8694 states. [2021-08-21 11:42:32,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8694 to 5668. [2021-08-21 11:42:32,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5668 states, 5667 states have (on average 3.3310393506264337) internal successors, (18877), 5667 states have internal predecessors, (18877), 0 states have call successors, (0), 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 11:42:32,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5668 states to 5668 states and 18877 transitions. [2021-08-21 11:42:32,032 INFO L78 Accepts]: Start accepts. Automaton has 5668 states and 18877 transitions. Word has length 77 [2021-08-21 11:42:32,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:42:32,032 INFO L470 AbstractCegarLoop]: Abstraction has 5668 states and 18877 transitions. [2021-08-21 11:42:32,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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 11:42:32,033 INFO L276 IsEmpty]: Start isEmpty. Operand 5668 states and 18877 transitions. [2021-08-21 11:42:32,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-21 11:42:32,043 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:42:32,043 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 11:42:32,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-21 11:42:32,043 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 11:42:32,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:42:32,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1099751956, now seen corresponding path program 5 times [2021-08-21 11:42:32,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:42:32,044 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52939761] [2021-08-21 11:42:32,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:42:32,044 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:42:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:42:32,336 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 11:42:32,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:42:32,336 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52939761] [2021-08-21 11:42:32,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52939761] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:42:32,336 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:42:32,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-21 11:42:32,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949348629] [2021-08-21 11:42:32,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-21 11:42:32,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:42:32,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-21 11:42:32,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-08-21 11:42:32,337 INFO L87 Difference]: Start difference. First operand 5668 states and 18877 transitions. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 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 11:42:32,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:42:32,950 INFO L93 Difference]: Finished difference Result 9389 states and 31227 transitions. [2021-08-21 11:42:32,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-21 11:42:32,950 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 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 11:42:32,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:42:32,967 INFO L225 Difference]: With dead ends: 9389 [2021-08-21 11:42:32,967 INFO L226 Difference]: Without dead ends: 6913 [2021-08-21 11:42:32,967 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 284.6ms TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2021-08-21 11:42:32,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6913 states. [2021-08-21 11:42:33,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6913 to 6500. [2021-08-21 11:42:33,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6500 states, 6499 states have (on average 3.314202184951531) internal successors, (21539), 6499 states have internal predecessors, (21539), 0 states have call successors, (0), 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 11:42:33,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6500 states to 6500 states and 21539 transitions. [2021-08-21 11:42:33,090 INFO L78 Accepts]: Start accepts. Automaton has 6500 states and 21539 transitions. Word has length 77 [2021-08-21 11:42:33,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:42:33,090 INFO L470 AbstractCegarLoop]: Abstraction has 6500 states and 21539 transitions. [2021-08-21 11:42:33,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 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 11:42:33,090 INFO L276 IsEmpty]: Start isEmpty. Operand 6500 states and 21539 transitions. [2021-08-21 11:42:33,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-08-21 11:42:33,101 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:42:33,101 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] [2021-08-21 11:42:33,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-21 11:42:33,102 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 11:42:33,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:42:33,102 INFO L82 PathProgramCache]: Analyzing trace with hash -194874649, now seen corresponding path program 1 times [2021-08-21 11:42:33,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:42:33,103 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909304088] [2021-08-21 11:42:33,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:42:33,103 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:42:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:42:33,341 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 11:42:33,341 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:42:33,341 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909304088] [2021-08-21 11:42:33,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909304088] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:42:33,341 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:42:33,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-21 11:42:33,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108046239] [2021-08-21 11:42:33,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-21 11:42:33,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:42:33,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-21 11:42:33,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-08-21 11:42:33,342 INFO L87 Difference]: Start difference. First operand 6500 states and 21539 transitions. Second operand has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 0 states have call successors, (0), 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 11:42:33,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:42:33,777 INFO L93 Difference]: Finished difference Result 9899 states and 32727 transitions. [2021-08-21 11:42:33,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-21 11:42:33,777 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2021-08-21 11:42:33,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:42:33,794 INFO L225 Difference]: With dead ends: 9899 [2021-08-21 11:42:33,794 INFO L226 Difference]: Without dead ends: 7735 [2021-08-21 11:42:33,795 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 230.1ms TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2021-08-21 11:42:33,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7735 states. [2021-08-21 11:42:33,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7735 to 5773. [2021-08-21 11:42:33,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5773 states, 5772 states have (on average 3.2694040194040195) internal successors, (18871), 5772 states have internal predecessors, (18871), 0 states have call successors, (0), 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 11:42:33,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5773 states to 5773 states and 18871 transitions. [2021-08-21 11:42:33,922 INFO L78 Accepts]: Start accepts. Automaton has 5773 states and 18871 transitions. Word has length 78 [2021-08-21 11:42:33,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:42:33,922 INFO L470 AbstractCegarLoop]: Abstraction has 5773 states and 18871 transitions. [2021-08-21 11:42:33,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 0 states have call successors, (0), 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 11:42:33,923 INFO L276 IsEmpty]: Start isEmpty. Operand 5773 states and 18871 transitions. [2021-08-21 11:42:33,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-08-21 11:42:33,933 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:42:33,933 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] [2021-08-21 11:42:33,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-21 11:42:33,933 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 11:42:33,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:42:33,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1602195427, now seen corresponding path program 2 times [2021-08-21 11:42:33,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:42:33,935 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536596437] [2021-08-21 11:42:33,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:42:33,935 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:42:33,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:42:34,017 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 11:42:34,018 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:42:34,018 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536596437] [2021-08-21 11:42:34,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536596437] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:42:34,018 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:42:34,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 11:42:34,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253317091] [2021-08-21 11:42:34,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 11:42:34,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:42:34,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 11:42:34,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 11:42:34,020 INFO L87 Difference]: Start difference. First operand 5773 states and 18871 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 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 11:42:34,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:42:34,113 INFO L93 Difference]: Finished difference Result 6848 states and 22091 transitions. [2021-08-21 11:42:34,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-21 11:42:34,114 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2021-08-21 11:42:34,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:42:34,126 INFO L225 Difference]: With dead ends: 6848 [2021-08-21 11:42:34,126 INFO L226 Difference]: Without dead ends: 5028 [2021-08-21 11:42:34,126 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 48.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-21 11:42:34,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5028 states. [2021-08-21 11:42:34,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5028 to 5028. [2021-08-21 11:42:34,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5028 states, 5027 states have (on average 3.2038989456932563) internal successors, (16106), 5027 states have internal predecessors, (16106), 0 states have call successors, (0), 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 11:42:34,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5028 states to 5028 states and 16106 transitions. [2021-08-21 11:42:34,229 INFO L78 Accepts]: Start accepts. Automaton has 5028 states and 16106 transitions. Word has length 78 [2021-08-21 11:42:34,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:42:34,229 INFO L470 AbstractCegarLoop]: Abstraction has 5028 states and 16106 transitions. [2021-08-21 11:42:34,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 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 11:42:34,229 INFO L276 IsEmpty]: Start isEmpty. Operand 5028 states and 16106 transitions. [2021-08-21 11:42:34,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-08-21 11:42:34,239 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:42:34,239 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 11:42:34,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-21 11:42:34,239 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 11:42:34,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:42:34,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1844587799, now seen corresponding path program 1 times [2021-08-21 11:42:34,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:42:34,240 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60377963] [2021-08-21 11:42:34,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:42:34,240 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:42:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:42:34,347 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 11:42:34,347 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:42:34,347 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60377963] [2021-08-21 11:42:34,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60377963] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:42:34,347 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:42:34,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-21 11:42:34,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30180467] [2021-08-21 11:42:34,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-21 11:42:34,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:42:34,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-21 11:42:34,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-21 11:42:34,348 INFO L87 Difference]: Start difference. First operand 5028 states and 16106 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 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 11:42:34,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:42:34,452 INFO L93 Difference]: Finished difference Result 4974 states and 15581 transitions. [2021-08-21 11:42:34,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-21 11:42:34,452 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 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 11:42:34,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:42:34,459 INFO L225 Difference]: With dead ends: 4974 [2021-08-21 11:42:34,460 INFO L226 Difference]: Without dead ends: 3570 [2021-08-21 11:42:34,460 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 63.8ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-08-21 11:42:34,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3570 states. [2021-08-21 11:42:34,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3570 to 3555. [2021-08-21 11:42:34,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3555 states, 3554 states have (on average 3.068655036578503) internal successors, (10906), 3554 states have internal predecessors, (10906), 0 states have call successors, (0), 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 11:42:34,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3555 states to 3555 states and 10906 transitions. [2021-08-21 11:42:34,526 INFO L78 Accepts]: Start accepts. Automaton has 3555 states and 10906 transitions. Word has length 79 [2021-08-21 11:42:34,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:42:34,526 INFO L470 AbstractCegarLoop]: Abstraction has 3555 states and 10906 transitions. [2021-08-21 11:42:34,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 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 11:42:34,526 INFO L276 IsEmpty]: Start isEmpty. Operand 3555 states and 10906 transitions. [2021-08-21 11:42:34,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-08-21 11:42:34,532 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:42:34,533 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] [2021-08-21 11:42:34,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-21 11:42:34,533 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 11:42:34,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:42:34,533 INFO L82 PathProgramCache]: Analyzing trace with hash 403661066, now seen corresponding path program 1 times [2021-08-21 11:42:34,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:42:34,533 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215486865] [2021-08-21 11:42:34,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:42:34,534 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:42:34,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:42:34,644 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 11:42:34,645 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:42:34,645 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215486865] [2021-08-21 11:42:34,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215486865] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:42:34,645 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:42:34,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-21 11:42:34,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136515298] [2021-08-21 11:42:34,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-21 11:42:34,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:42:34,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-21 11:42:34,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-21 11:42:34,646 INFO L87 Difference]: Start difference. First operand 3555 states and 10906 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:42:34,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:42:34,757 INFO L93 Difference]: Finished difference Result 3033 states and 9103 transitions. [2021-08-21 11:42:34,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-21 11:42:34,757 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-08-21 11:42:34,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:42:34,761 INFO L225 Difference]: With dead ends: 3033 [2021-08-21 11:42:34,762 INFO L226 Difference]: Without dead ends: 2421 [2021-08-21 11:42:34,762 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 74.5ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-08-21 11:42:34,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2421 states. [2021-08-21 11:42:34,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2421 to 1981. [2021-08-21 11:42:34,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1981 states, 1980 states have (on average 2.9313131313131313) internal successors, (5804), 1980 states have internal predecessors, (5804), 0 states have call successors, (0), 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 11:42:34,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1981 states to 1981 states and 5804 transitions. [2021-08-21 11:42:34,795 INFO L78 Accepts]: Start accepts. Automaton has 1981 states and 5804 transitions. Word has length 81 [2021-08-21 11:42:34,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:42:34,795 INFO L470 AbstractCegarLoop]: Abstraction has 1981 states and 5804 transitions. [2021-08-21 11:42:34,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:42:34,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1981 states and 5804 transitions. [2021-08-21 11:42:34,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-21 11:42:34,799 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:42:34,799 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, 1, 1] [2021-08-21 11:42:34,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-21 11:42:34,799 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 11:42:34,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:42:34,800 INFO L82 PathProgramCache]: Analyzing trace with hash -242475590, now seen corresponding path program 1 times [2021-08-21 11:42:34,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:42:34,800 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440578734] [2021-08-21 11:42:34,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:42:34,800 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:42:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:42:34,970 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 11:42:34,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:42:34,970 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440578734] [2021-08-21 11:42:34,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440578734] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:42:34,970 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:42:34,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-21 11:42:34,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991794814] [2021-08-21 11:42:34,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-21 11:42:34,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:42:34,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-21 11:42:34,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-08-21 11:42:34,972 INFO L87 Difference]: Start difference. First operand 1981 states and 5804 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 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 11:42:35,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:42:35,190 INFO L93 Difference]: Finished difference Result 3305 states and 9757 transitions. [2021-08-21 11:42:35,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-21 11:42:35,191 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2021-08-21 11:42:35,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:42:35,194 INFO L225 Difference]: With dead ends: 3305 [2021-08-21 11:42:35,195 INFO L226 Difference]: Without dead ends: 2347 [2021-08-21 11:42:35,195 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 73.1ms TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-08-21 11:42:35,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2347 states. [2021-08-21 11:42:35,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2347 to 2347. [2021-08-21 11:42:35,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2347 states, 2346 states have (on average 2.9049445865302643) internal successors, (6815), 2346 states have internal predecessors, (6815), 0 states have call successors, (0), 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 11:42:35,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 6815 transitions. [2021-08-21 11:42:35,227 INFO L78 Accepts]: Start accepts. Automaton has 2347 states and 6815 transitions. Word has length 84 [2021-08-21 11:42:35,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:42:35,227 INFO L470 AbstractCegarLoop]: Abstraction has 2347 states and 6815 transitions. [2021-08-21 11:42:35,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 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 11:42:35,227 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 6815 transitions. [2021-08-21 11:42:35,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-21 11:42:35,230 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:42:35,230 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, 1, 1] [2021-08-21 11:42:35,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-21 11:42:35,231 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 11:42:35,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:42:35,231 INFO L82 PathProgramCache]: Analyzing trace with hash -671676650, now seen corresponding path program 2 times [2021-08-21 11:42:35,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:42:35,231 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726025763] [2021-08-21 11:42:35,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:42:35,231 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:42:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:42:35,444 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 11:42:35,445 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:42:35,445 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726025763] [2021-08-21 11:42:35,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726025763] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:42:35,445 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:42:35,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-21 11:42:35,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579579905] [2021-08-21 11:42:35,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-21 11:42:35,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:42:35,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-21 11:42:35,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-08-21 11:42:35,446 INFO L87 Difference]: Start difference. First operand 2347 states and 6815 transitions. Second operand has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 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 11:42:35,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:42:35,699 INFO L93 Difference]: Finished difference Result 3757 states and 11012 transitions. [2021-08-21 11:42:35,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-21 11:42:35,699 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2021-08-21 11:42:35,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:42:35,704 INFO L225 Difference]: With dead ends: 3757 [2021-08-21 11:42:35,704 INFO L226 Difference]: Without dead ends: 2599 [2021-08-21 11:42:35,704 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 112.7ms TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2021-08-21 11:42:35,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2599 states. [2021-08-21 11:42:35,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2599 to 2190. [2021-08-21 11:42:35,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2190 states, 2189 states have (on average 2.8839652809502057) internal successors, (6313), 2189 states have internal predecessors, (6313), 0 states have call successors, (0), 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 11:42:35,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2190 states to 2190 states and 6313 transitions. [2021-08-21 11:42:35,761 INFO L78 Accepts]: Start accepts. Automaton has 2190 states and 6313 transitions. Word has length 84 [2021-08-21 11:42:35,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:42:35,762 INFO L470 AbstractCegarLoop]: Abstraction has 2190 states and 6313 transitions. [2021-08-21 11:42:35,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 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 11:42:35,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2190 states and 6313 transitions. [2021-08-21 11:42:35,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-21 11:42:35,765 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:42:35,765 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, 1, 1] [2021-08-21 11:42:35,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-21 11:42:35,765 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:42:35,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:42:35,766 INFO L82 PathProgramCache]: Analyzing trace with hash 886492762, now seen corresponding path program 3 times [2021-08-21 11:42:35,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:42:35,766 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447581344] [2021-08-21 11:42:35,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:42:35,766 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:42:35,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:42:35,930 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 11:42:35,931 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:42:35,931 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447581344] [2021-08-21 11:42:35,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447581344] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:42:35,931 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:42:35,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-21 11:42:35,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294838790] [2021-08-21 11:42:35,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-21 11:42:35,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:42:35,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-21 11:42:35,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-08-21 11:42:35,932 INFO L87 Difference]: Start difference. First operand 2190 states and 6313 transitions. Second operand has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 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 11:42:36,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:42:36,138 INFO L93 Difference]: Finished difference Result 2918 states and 8489 transitions. [2021-08-21 11:42:36,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-21 11:42:36,139 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2021-08-21 11:42:36,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:42:36,143 INFO L225 Difference]: With dead ends: 2918 [2021-08-21 11:42:36,143 INFO L226 Difference]: Without dead ends: 2219 [2021-08-21 11:42:36,143 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 96.9ms TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2021-08-21 11:42:36,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2219 states. [2021-08-21 11:42:36,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2219 to 2219. [2021-08-21 11:42:36,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2219 states, 2218 states have (on average 2.8800721370604148) internal successors, (6388), 2218 states have internal predecessors, (6388), 0 states have call successors, (0), 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 11:42:36,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2219 states to 2219 states and 6388 transitions. [2021-08-21 11:42:36,178 INFO L78 Accepts]: Start accepts. Automaton has 2219 states and 6388 transitions. Word has length 84 [2021-08-21 11:42:36,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:42:36,178 INFO L470 AbstractCegarLoop]: Abstraction has 2219 states and 6388 transitions. [2021-08-21 11:42:36,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 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 11:42:36,179 INFO L276 IsEmpty]: Start isEmpty. Operand 2219 states and 6388 transitions. [2021-08-21 11:42:36,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-21 11:42:36,182 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:42:36,182 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, 1, 1] [2021-08-21 11:42:36,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-21 11:42:36,183 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:42:36,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:42:36,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1797082036, now seen corresponding path program 4 times [2021-08-21 11:42:36,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:42:36,183 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946383977] [2021-08-21 11:42:36,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:42:36,184 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:42:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:42:36,531 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 11:42:36,532 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:42:36,532 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946383977] [2021-08-21 11:42:36,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946383977] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:42:36,532 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:42:36,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-08-21 11:42:36,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871835727] [2021-08-21 11:42:36,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-21 11:42:36,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:42:36,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-21 11:42:36,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2021-08-21 11:42:36,533 INFO L87 Difference]: Start difference. First operand 2219 states and 6388 transitions. Second operand has 16 states, 16 states have (on average 5.25) internal successors, (84), 16 states have internal predecessors, (84), 0 states have call successors, (0), 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 11:42:36,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:42:36,913 INFO L93 Difference]: Finished difference Result 4270 states and 12598 transitions. [2021-08-21 11:42:36,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-21 11:42:36,913 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 16 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2021-08-21 11:42:36,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:42:36,918 INFO L225 Difference]: With dead ends: 4270 [2021-08-21 11:42:36,918 INFO L226 Difference]: Without dead ends: 2878 [2021-08-21 11:42:36,918 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 247.8ms TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2021-08-21 11:42:36,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2878 states. [2021-08-21 11:42:36,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2878 to 2277. [2021-08-21 11:42:36,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2277 states, 2276 states have (on average 2.8681898066783833) internal successors, (6528), 2276 states have internal predecessors, (6528), 0 states have call successors, (0), 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 11:42:36,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 2277 states and 6528 transitions. [2021-08-21 11:42:36,951 INFO L78 Accepts]: Start accepts. Automaton has 2277 states and 6528 transitions. Word has length 84 [2021-08-21 11:42:36,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:42:36,951 INFO L470 AbstractCegarLoop]: Abstraction has 2277 states and 6528 transitions. [2021-08-21 11:42:36,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 16 states have internal predecessors, (84), 0 states have call successors, (0), 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 11:42:36,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 6528 transitions. [2021-08-21 11:42:36,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-21 11:42:36,955 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:42:36,955 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, 1, 1] [2021-08-21 11:42:36,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-21 11:42:36,955 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:42:36,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:42:36,955 INFO L82 PathProgramCache]: Analyzing trace with hash -549886570, now seen corresponding path program 5 times [2021-08-21 11:42:36,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:42:36,955 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477697095] [2021-08-21 11:42:36,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:42:36,955 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:42:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:42:37,284 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 11:42:37,284 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:42:37,284 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477697095] [2021-08-21 11:42:37,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477697095] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:42:37,285 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:42:37,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-21 11:42:37,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440244233] [2021-08-21 11:42:37,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-21 11:42:37,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:42:37,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-21 11:42:37,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-08-21 11:42:37,286 INFO L87 Difference]: Start difference. First operand 2277 states and 6528 transitions. Second operand has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 0 states have call successors, (0), 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 11:42:37,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:42:37,770 INFO L93 Difference]: Finished difference Result 3716 states and 10859 transitions. [2021-08-21 11:42:37,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-21 11:42:37,770 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2021-08-21 11:42:37,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:42:37,775 INFO L225 Difference]: With dead ends: 3716 [2021-08-21 11:42:37,775 INFO L226 Difference]: Without dead ends: 2733 [2021-08-21 11:42:37,776 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 280.2ms TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2021-08-21 11:42:37,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2733 states. [2021-08-21 11:42:37,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2733 to 2039. [2021-08-21 11:42:37,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2039 states, 2038 states have (on average 2.842001962708538) internal successors, (5792), 2038 states have internal predecessors, (5792), 0 states have call successors, (0), 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 11:42:37,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 5792 transitions. [2021-08-21 11:42:37,805 INFO L78 Accepts]: Start accepts. Automaton has 2039 states and 5792 transitions. Word has length 84 [2021-08-21 11:42:37,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:42:37,805 INFO L470 AbstractCegarLoop]: Abstraction has 2039 states and 5792 transitions. [2021-08-21 11:42:37,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 0 states have call successors, (0), 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 11:42:37,805 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 5792 transitions. [2021-08-21 11:42:37,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-21 11:42:37,808 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:42:37,808 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, 1, 1] [2021-08-21 11:42:37,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-21 11:42:37,808 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:42:37,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:42:37,809 INFO L82 PathProgramCache]: Analyzing trace with hash -464200646, now seen corresponding path program 6 times [2021-08-21 11:42:37,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:42:37,809 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615314139] [2021-08-21 11:42:37,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:42:37,809 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:42:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:42:38,266 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 11:42:38,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:42:38,266 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615314139] [2021-08-21 11:42:38,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615314139] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:42:38,266 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:42:38,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-08-21 11:42:38,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224720553] [2021-08-21 11:42:38,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-21 11:42:38,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:42:38,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-21 11:42:38,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2021-08-21 11:42:38,268 INFO L87 Difference]: Start difference. First operand 2039 states and 5792 transitions. Second operand has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 18 states have internal predecessors, (84), 0 states have call successors, (0), 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 11:42:38,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:42:38,621 INFO L93 Difference]: Finished difference Result 2711 states and 7821 transitions. [2021-08-21 11:42:38,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-21 11:42:38,621 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 18 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2021-08-21 11:42:38,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:42:38,624 INFO L225 Difference]: With dead ends: 2711 [2021-08-21 11:42:38,625 INFO L226 Difference]: Without dead ends: 1981 [2021-08-21 11:42:38,625 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 260.9ms TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2021-08-21 11:42:38,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2021-08-21 11:42:38,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1981. [2021-08-21 11:42:38,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1981 states, 1980 states have (on average 2.856060606060606) internal successors, (5655), 1980 states have internal predecessors, (5655), 0 states have call successors, (0), 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 11:42:38,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1981 states to 1981 states and 5655 transitions. [2021-08-21 11:42:38,648 INFO L78 Accepts]: Start accepts. Automaton has 1981 states and 5655 transitions. Word has length 84 [2021-08-21 11:42:38,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:42:38,648 INFO L470 AbstractCegarLoop]: Abstraction has 1981 states and 5655 transitions. [2021-08-21 11:42:38,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 18 states have internal predecessors, (84), 0 states have call successors, (0), 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 11:42:38,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1981 states and 5655 transitions. [2021-08-21 11:42:38,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-21 11:42:38,651 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:42:38,651 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, 1, 1] [2021-08-21 11:42:38,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-21 11:42:38,651 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:42:38,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:42:38,651 INFO L82 PathProgramCache]: Analyzing trace with hash -2109550566, now seen corresponding path program 7 times [2021-08-21 11:42:38,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:42:38,652 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409367156] [2021-08-21 11:42:38,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:42:38,652 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:42:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:42:38,942 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 11:42:38,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:42:38,942 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409367156] [2021-08-21 11:42:38,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409367156] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:42:38,942 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:42:38,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-08-21 11:42:38,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950909080] [2021-08-21 11:42:38,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-21 11:42:38,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:42:38,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-21 11:42:38,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2021-08-21 11:42:38,943 INFO L87 Difference]: Start difference. First operand 1981 states and 5655 transitions. Second operand has 16 states, 16 states have (on average 5.25) internal successors, (84), 16 states have internal predecessors, (84), 0 states have call successors, (0), 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 11:42:39,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:42:39,245 INFO L93 Difference]: Finished difference Result 2827 states and 8123 transitions. [2021-08-21 11:42:39,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-21 11:42:39,245 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 16 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2021-08-21 11:42:39,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:42:39,249 INFO L225 Difference]: With dead ends: 2827 [2021-08-21 11:42:39,249 INFO L226 Difference]: Without dead ends: 1750 [2021-08-21 11:42:39,249 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 183.7ms TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2021-08-21 11:42:39,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2021-08-21 11:42:39,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1750. [2021-08-21 11:42:39,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1750 states, 1749 states have (on average 2.8644939965694682) internal successors, (5010), 1749 states have internal predecessors, (5010), 0 states have call successors, (0), 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 11:42:39,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 5010 transitions. [2021-08-21 11:42:39,274 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 5010 transitions. Word has length 84 [2021-08-21 11:42:39,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:42:39,274 INFO L470 AbstractCegarLoop]: Abstraction has 1750 states and 5010 transitions. [2021-08-21 11:42:39,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 16 states have internal predecessors, (84), 0 states have call successors, (0), 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 11:42:39,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 5010 transitions. [2021-08-21 11:42:39,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-21 11:42:39,276 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:42:39,276 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, 1, 1] [2021-08-21 11:42:39,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-21 11:42:39,277 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:42:39,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:42:39,277 INFO L82 PathProgramCache]: Analyzing trace with hash 285082740, now seen corresponding path program 8 times [2021-08-21 11:42:39,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:42:39,277 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537439414] [2021-08-21 11:42:39,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:42:39,277 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:42:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:42:39,424 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 11:42:39,424 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:42:39,425 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537439414] [2021-08-21 11:42:39,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537439414] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:42:39,425 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:42:39,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-21 11:42:39,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778158692] [2021-08-21 11:42:39,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-21 11:42:39,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:42:39,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-21 11:42:39,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-08-21 11:42:39,426 INFO L87 Difference]: Start difference. First operand 1750 states and 5010 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 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 11:42:39,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:42:39,616 INFO L93 Difference]: Finished difference Result 2980 states and 8689 transitions. [2021-08-21 11:42:39,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-21 11:42:39,616 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2021-08-21 11:42:39,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:42:39,620 INFO L225 Difference]: With dead ends: 2980 [2021-08-21 11:42:39,620 INFO L226 Difference]: Without dead ends: 2386 [2021-08-21 11:42:39,621 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 79.5ms TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-08-21 11:42:39,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2386 states. [2021-08-21 11:42:39,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 1750. [2021-08-21 11:42:39,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1750 states, 1749 states have (on average 2.857632933104631) internal successors, (4998), 1749 states have internal predecessors, (4998), 0 states have call successors, (0), 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 11:42:39,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 4998 transitions. [2021-08-21 11:42:39,644 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 4998 transitions. Word has length 84 [2021-08-21 11:42:39,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:42:39,645 INFO L470 AbstractCegarLoop]: Abstraction has 1750 states and 4998 transitions. [2021-08-21 11:42:39,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 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 11:42:39,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 4998 transitions. [2021-08-21 11:42:39,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-21 11:42:39,648 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:42:39,648 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, 1, 1] [2021-08-21 11:42:39,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-21 11:42:39,648 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:42:39,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:42:39,649 INFO L82 PathProgramCache]: Analyzing trace with hash -144118320, now seen corresponding path program 9 times [2021-08-21 11:42:39,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:42:39,649 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610406692] [2021-08-21 11:42:39,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:42:39,649 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:42:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:42:39,849 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 11:42:39,849 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:42:39,849 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610406692] [2021-08-21 11:42:39,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610406692] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:42:39,849 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:42:39,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-21 11:42:39,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316806178] [2021-08-21 11:42:39,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-21 11:42:39,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:42:39,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-21 11:42:39,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-08-21 11:42:39,850 INFO L87 Difference]: Start difference. First operand 1750 states and 4998 transitions. Second operand has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 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 11:42:40,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:42:40,057 INFO L93 Difference]: Finished difference Result 2437 states and 7067 transitions. [2021-08-21 11:42:40,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-21 11:42:40,057 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2021-08-21 11:42:40,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:42:40,061 INFO L225 Difference]: With dead ends: 2437 [2021-08-21 11:42:40,061 INFO L226 Difference]: Without dead ends: 1671 [2021-08-21 11:42:40,061 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 148.2ms TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-08-21 11:42:40,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2021-08-21 11:42:40,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1494. [2021-08-21 11:42:40,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1494 states, 1493 states have (on average 2.81178834561286) internal successors, (4198), 1493 states have internal predecessors, (4198), 0 states have call successors, (0), 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 11:42:40,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 4198 transitions. [2021-08-21 11:42:40,080 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 4198 transitions. Word has length 84 [2021-08-21 11:42:40,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:42:40,080 INFO L470 AbstractCegarLoop]: Abstraction has 1494 states and 4198 transitions. [2021-08-21 11:42:40,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 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 11:42:40,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 4198 transitions. [2021-08-21 11:42:40,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-21 11:42:40,082 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:42:40,082 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, 1, 1] [2021-08-21 11:42:40,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-21 11:42:40,082 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:42:40,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:42:40,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1260532590, now seen corresponding path program 10 times [2021-08-21 11:42:40,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:42:40,083 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955865131] [2021-08-21 11:42:40,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:42:40,083 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:42:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:42:40,374 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 11:42:40,374 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:42:40,374 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955865131] [2021-08-21 11:42:40,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955865131] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:42:40,374 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:42:40,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-21 11:42:40,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95229347] [2021-08-21 11:42:40,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-21 11:42:40,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:42:40,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-21 11:42:40,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-08-21 11:42:40,375 INFO L87 Difference]: Start difference. First operand 1494 states and 4198 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 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 11:42:40,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:42:40,884 INFO L93 Difference]: Finished difference Result 3099 states and 9057 transitions. [2021-08-21 11:42:40,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-21 11:42:40,884 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2021-08-21 11:42:40,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:42:40,887 INFO L225 Difference]: With dead ends: 3099 [2021-08-21 11:42:40,887 INFO L226 Difference]: Without dead ends: 1430 [2021-08-21 11:42:40,888 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 321.7ms TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2021-08-21 11:42:40,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2021-08-21 11:42:40,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 971. [2021-08-21 11:42:40,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 2.804123711340206) internal successors, (2720), 970 states have internal predecessors, (2720), 0 states have call successors, (0), 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 11:42:40,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 2720 transitions. [2021-08-21 11:42:40,900 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 2720 transitions. Word has length 84 [2021-08-21 11:42:40,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:42:40,900 INFO L470 AbstractCegarLoop]: Abstraction has 971 states and 2720 transitions. [2021-08-21 11:42:40,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 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 11:42:40,903 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 2720 transitions. [2021-08-21 11:42:40,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-21 11:42:40,904 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:42:40,904 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, 1, 1] [2021-08-21 11:42:40,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-21 11:42:40,904 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:42:40,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:42:40,905 INFO L82 PathProgramCache]: Analyzing trace with hash 231321590, now seen corresponding path program 11 times [2021-08-21 11:42:40,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:42:40,905 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657744393] [2021-08-21 11:42:40,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:42:40,906 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:42:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-21 11:42:40,958 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-21 11:42:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-21 11:42:41,066 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-21 11:42:41,066 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-21 11:42:41,067 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 11:42:41,068 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 11:42:41,069 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-08-21 11:42:41,071 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-08-21 11:42:41,071 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-08-21 11:42:41,071 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 11:42:41,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-21 11:42:41,077 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-21 11:42:41,078 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-21 11:42:41,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.08 11:42:41 BasicIcfg [2021-08-21 11:42:41,196 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-21 11:42:41,197 INFO L168 Benchmark]: Toolchain (without parser) took 20350.32 ms. Allocated memory was 206.6 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 169.1 MB in the beginning and 998.6 MB in the end (delta: -829.5 MB). Peak memory consumption was 780.9 MB. Max. memory is 8.0 GB. [2021-08-21 11:42:41,197 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 206.6 MB. Free memory is still 187.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-21 11:42:41,198 INFO L168 Benchmark]: CACSL2BoogieTranslator took 514.75 ms. Allocated memory is still 206.6 MB. Free memory was 168.9 MB in the beginning and 173.2 MB in the end (delta: -4.3 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2021-08-21 11:42:41,198 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.91 ms. Allocated memory is still 206.6 MB. Free memory was 173.2 MB in the beginning and 170.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-21 11:42:41,198 INFO L168 Benchmark]: Boogie Preprocessor took 53.32 ms. Allocated memory is still 206.6 MB. Free memory was 170.0 MB in the beginning and 166.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-21 11:42:41,198 INFO L168 Benchmark]: RCFGBuilder took 2430.88 ms. Allocated memory was 206.6 MB in the beginning and 274.7 MB in the end (delta: 68.2 MB). Free memory was 166.9 MB in the beginning and 218.8 MB in the end (delta: -51.9 MB). Peak memory consumption was 146.7 MB. Max. memory is 8.0 GB. [2021-08-21 11:42:41,199 INFO L168 Benchmark]: TraceAbstraction took 17269.36 ms. Allocated memory was 274.7 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 218.3 MB in the beginning and 998.6 MB in the end (delta: -780.3 MB). Peak memory consumption was 761.1 MB. Max. memory is 8.0 GB. [2021-08-21 11:42:41,201 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.12 ms. Allocated memory is still 206.6 MB. Free memory is still 187.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 514.75 ms. Allocated memory is still 206.6 MB. Free memory was 168.9 MB in the beginning and 173.2 MB in the end (delta: -4.3 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 77.91 ms. Allocated memory is still 206.6 MB. Free memory was 173.2 MB in the beginning and 170.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 53.32 ms. Allocated memory is still 206.6 MB. Free memory was 170.0 MB in the beginning and 166.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2430.88 ms. Allocated memory was 206.6 MB in the beginning and 274.7 MB in the end (delta: 68.2 MB). Free memory was 166.9 MB in the beginning and 218.8 MB in the end (delta: -51.9 MB). Peak memory consumption was 146.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 17269.36 ms. Allocated memory was 274.7 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 218.3 MB in the beginning and 998.6 MB in the end (delta: -780.3 MB). Peak memory consumption was 761.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L722] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L723] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L724] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L725] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L726] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L727] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L728] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L729] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L730] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L731] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L732] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L733] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L734] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L735] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L736] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L737] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L738] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L854] 0 pthread_t t2336; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L855] FCALL, FORK 0 pthread_create(&t2336, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L856] 0 pthread_t t2337; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L857] FCALL, FORK 0 pthread_create(&t2337, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 2 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L858] 0 pthread_t t2338; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L859] FCALL, FORK 0 pthread_create(&t2338, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L813] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L816] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 3 y$flush_delayed = weak$$choice2 [L819] 3 y$mem_tmp = y [L820] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L820] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L821] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L821] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0) [L821] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L821] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L822] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L822] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L822] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L822] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L823] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L823] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L823] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L823] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L824] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L824] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L825] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3) [L825] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L825] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L826] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L826] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 __unbuffered_p2_EBX = y [L828] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L828] 3 y = y$flush_delayed ? y$mem_tmp : y [L829] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=50, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L832] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L832] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L832] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L832] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L833] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L833] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L834] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L834] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L835] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L835] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L836] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L836] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=50, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=50, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L748] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L749] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L750] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L751] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0) [L759] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L760] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1) [L760] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used) [L761] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L762] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L763] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1) [L763] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L764] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __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=51, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L770] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L770] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L770] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L771] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L771] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L772] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L772] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L773] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L773] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L774] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __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=51, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L799] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __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=51, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L866] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L868] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L869] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] 0 y$mem_tmp = y [L876] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L878] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L879] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L880] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L882] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L19] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L19] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 19]: 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: 855]: 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: 859]: 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: 857]: 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, 136 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 17037.4ms, OverallIterations: 24, TraceHistogramMax: 1, EmptinessCheckTime: 294.7ms, AutomataDifference: 7945.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 360.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3383 SDtfs, 5295 SDslu, 17853 SDs, 0 SdLazy, 3348 SolverSat, 734 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3256.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 397 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 4119.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=13414occurred in iteration=0, InterpolantAutomatonStates: 273, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2453.8ms AutomataMinimizationTime, 23 MinimizatonAttempts, 9166 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 95.7ms SsaConstructionTime, 959.6ms SatisfiabilityAnalysisTime, 4484.6ms InterpolantComputationTime, 1886 NumberOfCodeBlocks, 1886 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1779 ConstructedInterpolants, 0 QuantifiedInterpolants, 12601 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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 11:42:41,233 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...