/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/safe002_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-8a14012e553caa636f65c1137831746b6d9875cd-8a14012 [2021-08-06 13:47:39,397 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-06 13:47:39,399 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-06 13:47:39,429 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-06 13:47:39,430 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-06 13:47:39,432 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-06 13:47:39,711 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-06 13:47:39,715 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-06 13:47:39,717 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-06 13:47:39,720 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-06 13:47:39,721 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-06 13:47:39,722 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-06 13:47:39,722 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-06 13:47:39,724 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-06 13:47:39,725 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-06 13:47:39,730 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-06 13:47:39,731 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-06 13:47:39,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-06 13:47:39,735 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-06 13:47:39,736 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-06 13:47:39,737 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-06 13:47:39,741 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-06 13:47:39,741 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-06 13:47:39,742 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-06 13:47:39,757 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-06 13:47:39,758 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-06 13:47:39,758 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-06 13:47:39,759 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-06 13:47:39,759 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-06 13:47:39,759 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-06 13:47:39,759 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-06 13:47:39,760 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-06 13:47:39,760 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-06 13:47:39,761 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-06 13:47:39,761 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-06 13:47:39,762 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-06 13:47:39,762 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-06 13:47:39,762 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-06 13:47:39,762 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-06 13:47:39,763 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-06 13:47:39,763 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-06 13:47:39,769 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-06 13:47:39,794 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-06 13:47:39,795 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-06 13:47:39,795 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-06 13:47:39,795 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-06 13:47:39,797 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-06 13:47:39,798 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-06 13:47:39,798 INFO L138 SettingsManager]: * Use SBE=true [2021-08-06 13:47:39,798 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-06 13:47:39,798 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-06 13:47:39,798 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-06 13:47:39,799 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-06 13:47:39,799 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-06 13:47:39,799 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-06 13:47:39,799 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-06 13:47:39,799 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-06 13:47:39,799 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-06 13:47:39,799 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-06 13:47:39,799 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-06 13:47:39,800 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-06 13:47:39,800 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-06 13:47:39,800 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-06 13:47:39,800 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-06 13:47:39,800 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-06 13:47:39,800 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-06 13:47:39,800 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-06 13:47:39,800 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-06 13:47:39,800 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-06 13:47:39,801 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-06 13:47:39,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-06 13:47:39,801 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-06 13:47:39,801 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-06 13:47:39,801 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-06 13:47:40,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-06 13:47:40,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-06 13:47:40,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-06 13:47:40,085 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-06 13:47:40,086 INFO L275 PluginConnector]: CDTParser initialized [2021-08-06 13:47:40,086 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_rmo.opt.i [2021-08-06 13:47:40,128 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e828f99e9/2aebcacb405e49ad858d9643f169d3a5/FLAG15e9bdada [2021-08-06 13:47:40,548 INFO L306 CDTParser]: Found 1 translation units. [2021-08-06 13:47:40,549 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_rmo.opt.i [2021-08-06 13:47:40,559 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e828f99e9/2aebcacb405e49ad858d9643f169d3a5/FLAG15e9bdada [2021-08-06 13:47:40,899 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e828f99e9/2aebcacb405e49ad858d9643f169d3a5 [2021-08-06 13:47:40,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-06 13:47:40,902 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-06 13:47:40,903 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-06 13:47:40,903 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-06 13:47:40,906 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-06 13:47:40,907 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.08 01:47:40" (1/1) ... [2021-08-06 13:47:40,909 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21c87c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:47:40, skipping insertion in model container [2021-08-06 13:47:40,909 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.08 01:47:40" (1/1) ... [2021-08-06 13:47:40,913 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-06 13:47:40,958 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-06 13:47:41,069 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_rmo.opt.i[992,1005] [2021-08-06 13:47:41,245 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-06 13:47:41,250 INFO L203 MainTranslator]: Completed pre-run [2021-08-06 13:47:41,257 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_rmo.opt.i[992,1005] [2021-08-06 13:47:41,279 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-06 13:47:41,304 INFO L208 MainTranslator]: Completed translation [2021-08-06 13:47:41,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:47:41 WrapperNode [2021-08-06 13:47:41,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-06 13:47:41,305 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-06 13:47:41,305 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-06 13:47:41,305 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-06 13:47:41,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:47:41" (1/1) ... [2021-08-06 13:47:41,327 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:47:41" (1/1) ... [2021-08-06 13:47:41,352 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-06 13:47:41,353 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-06 13:47:41,353 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-06 13:47:41,353 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-06 13:47:41,359 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:47:41" (1/1) ... [2021-08-06 13:47:41,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:47:41" (1/1) ... [2021-08-06 13:47:41,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:47:41" (1/1) ... [2021-08-06 13:47:41,374 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:47:41" (1/1) ... [2021-08-06 13:47:41,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:47:41" (1/1) ... [2021-08-06 13:47:41,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:47:41" (1/1) ... [2021-08-06 13:47:41,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:47:41" (1/1) ... [2021-08-06 13:47:41,402 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-06 13:47:41,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-06 13:47:41,402 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-06 13:47:41,402 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-06 13:47:41,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:47:41" (1/1) ... [2021-08-06 13:47:41,410 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-06 13:47:41,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-06 13:47:41,429 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-06 13:47:41,455 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-06 13:47:41,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-06 13:47:41,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-06 13:47:41,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-06 13:47:41,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-06 13:47:41,470 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-06 13:47:41,470 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-06 13:47:41,470 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-06 13:47:41,470 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-06 13:47:41,470 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-06 13:47:41,470 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-06 13:47:41,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-06 13:47:41,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-06 13:47:41,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-06 13:47:41,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-06 13:47:41,472 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-06 13:47:42,886 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-06 13:47:42,886 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-06 13:47:42,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.08 01:47:42 BoogieIcfgContainer [2021-08-06 13:47:42,887 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-06 13:47:42,888 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-06 13:47:42,889 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-06 13:47:42,890 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-06 13:47:42,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.08 01:47:40" (1/3) ... [2021-08-06 13:47:42,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85b341a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.08 01:47:42, skipping insertion in model container [2021-08-06 13:47:42,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:47:41" (2/3) ... [2021-08-06 13:47:42,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85b341a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.08 01:47:42, skipping insertion in model container [2021-08-06 13:47:42,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.08 01:47:42" (3/3) ... [2021-08-06 13:47:42,892 INFO L111 eAbstractionObserver]: Analyzing ICFG safe002_rmo.opt.i [2021-08-06 13:47:42,922 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-06 13:47:42,922 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-06 13:47:42,923 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-06 13:47:42,923 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-06 13:47:42,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,952 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,952 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,952 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,952 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,957 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,957 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,957 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,957 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,958 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,958 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,958 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,958 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,958 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,958 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,958 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,958 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,958 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,958 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,958 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,962 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,962 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,962 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,962 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,963 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,963 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,963 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,963 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,963 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,964 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,964 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,964 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,967 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,967 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,967 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,967 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,967 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,968 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,968 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,972 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,972 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,972 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,972 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,972 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,972 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,972 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,973 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,973 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,973 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,975 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,975 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,976 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,976 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,976 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,976 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,976 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,976 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,976 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,976 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,976 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,976 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,976 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,977 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,977 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,977 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,978 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,978 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,978 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,978 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,978 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,978 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,978 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,979 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,979 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,979 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,979 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,979 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:47:42,980 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-06 13:47:43,007 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2021-08-06 13:47:43,012 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-06 13:47:43,012 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-08-06 13:47:43,019 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 114 places, 106 transitions, 227 flow [2021-08-06 13:47:43,209 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 8594 states, 8592 states have (on average 3.5547020484171323) internal successors, (30542), 8593 states have internal predecessors, (30542), 0 states have call successors, (0), 0 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-06 13:47:43,236 INFO L276 IsEmpty]: Start isEmpty. Operand has 8594 states, 8592 states have (on average 3.5547020484171323) internal successors, (30542), 8593 states have internal predecessors, (30542), 0 states have call successors, (0), 0 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-06 13:47:43,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-08-06 13:47:43,268 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:47:43,268 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-06 13:47:43,269 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:47:43,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:47:43,272 INFO L82 PathProgramCache]: Analyzing trace with hash 2105882266, now seen corresponding path program 1 times [2021-08-06 13:47:43,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:47:43,278 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541165061] [2021-08-06 13:47:43,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:47:43,279 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:47:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:47:43,681 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-06 13:47:43,682 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:47:43,682 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541165061] [2021-08-06 13:47:43,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541165061] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:47:43,682 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:47:43,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-06 13:47:43,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47788400] [2021-08-06 13:47:43,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-06 13:47:43,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:47:43,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-06 13:47:43,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-06 13:47:43,740 INFO L87 Difference]: Start difference. First operand has 8594 states, 8592 states have (on average 3.5547020484171323) internal successors, (30542), 8593 states have internal predecessors, (30542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 11.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-06 13:47:44,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:47:44,080 INFO L93 Difference]: Finished difference Result 15861 states and 54563 transitions. [2021-08-06 13:47:44,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-06 13:47:44,081 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-06 13:47:44,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:47:44,158 INFO L225 Difference]: With dead ends: 15861 [2021-08-06 13:47:44,159 INFO L226 Difference]: Without dead ends: 11091 [2021-08-06 13:47:44,160 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 147.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-06 13:47:44,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11091 states. [2021-08-06 13:47:44,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11091 to 9471. [2021-08-06 13:47:44,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9471 states, 9469 states have (on average 3.4430246066110466) internal successors, (32602), 9470 states have internal predecessors, (32602), 0 states have call successors, (0), 0 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-06 13:47:44,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9471 states to 9471 states and 32602 transitions. [2021-08-06 13:47:44,678 INFO L78 Accepts]: Start accepts. Automaton has 9471 states and 32602 transitions. Word has length 68 [2021-08-06 13:47:44,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:47:44,679 INFO L470 AbstractCegarLoop]: Abstraction has 9471 states and 32602 transitions. [2021-08-06 13:47:44,679 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-06 13:47:44,679 INFO L276 IsEmpty]: Start isEmpty. Operand 9471 states and 32602 transitions. [2021-08-06 13:47:44,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-08-06 13:47:44,697 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:47:44,698 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-06 13:47:44,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-06 13:47:44,698 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:47:44,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:47:44,700 INFO L82 PathProgramCache]: Analyzing trace with hash -461649767, now seen corresponding path program 1 times [2021-08-06 13:47:44,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:47:44,701 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023523722] [2021-08-06 13:47:44,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:47:44,701 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:47:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:47:44,863 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-06 13:47:44,863 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:47:44,863 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023523722] [2021-08-06 13:47:44,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023523722] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:47:44,863 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:47:44,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-06 13:47:44,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999221214] [2021-08-06 13:47:44,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-06 13:47:44,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:47:44,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-06 13:47:44,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-06 13:47:44,865 INFO L87 Difference]: Start difference. First operand 9471 states and 32602 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:47:45,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:47:45,177 INFO L93 Difference]: Finished difference Result 12491 states and 42403 transitions. [2021-08-06 13:47:45,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-06 13:47:45,178 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-08-06 13:47:45,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:47:45,234 INFO L225 Difference]: With dead ends: 12491 [2021-08-06 13:47:45,234 INFO L226 Difference]: Without dead ends: 10311 [2021-08-06 13:47:45,235 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 182.9ms TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2021-08-06 13:47:45,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10311 states. [2021-08-06 13:47:45,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10311 to 8931. [2021-08-06 13:47:45,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8931 states, 8929 states have (on average 3.4236756635681487) internal successors, (30570), 8930 states have internal predecessors, (30570), 0 states have call successors, (0), 0 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-06 13:47:45,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8931 states to 8931 states and 30570 transitions. [2021-08-06 13:47:45,514 INFO L78 Accepts]: Start accepts. Automaton has 8931 states and 30570 transitions. Word has length 70 [2021-08-06 13:47:45,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:47:45,514 INFO L470 AbstractCegarLoop]: Abstraction has 8931 states and 30570 transitions. [2021-08-06 13:47:45,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:47:45,515 INFO L276 IsEmpty]: Start isEmpty. Operand 8931 states and 30570 transitions. [2021-08-06 13:47:45,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-06 13:47:45,528 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:47:45,528 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] [2021-08-06 13:47:45,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-06 13:47:45,529 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:47:45,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:47:45,529 INFO L82 PathProgramCache]: Analyzing trace with hash 322867422, now seen corresponding path program 1 times [2021-08-06 13:47:45,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:47:45,530 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461536993] [2021-08-06 13:47:45,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:47:45,530 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:47:45,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:47:45,727 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-06 13:47:45,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:47:45,727 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461536993] [2021-08-06 13:47:45,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461536993] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:47:45,728 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:47:45,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-06 13:47:45,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704502552] [2021-08-06 13:47:45,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-06 13:47:45,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:47:45,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-06 13:47:45,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-06 13:47:45,729 INFO L87 Difference]: Start difference. First operand 8931 states and 30570 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:47:45,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:47:45,990 INFO L93 Difference]: Finished difference Result 11231 states and 38000 transitions. [2021-08-06 13:47:45,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-06 13:47:45,991 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-08-06 13:47:45,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:47:46,020 INFO L225 Difference]: With dead ends: 11231 [2021-08-06 13:47:46,021 INFO L226 Difference]: Without dead ends: 9471 [2021-08-06 13:47:46,021 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 169.3ms TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2021-08-06 13:47:46,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9471 states. [2021-08-06 13:47:46,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9471 to 7941. [2021-08-06 13:47:46,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7941 states, 7939 states have (on average 3.4019397909056557) internal successors, (27008), 7940 states have internal predecessors, (27008), 0 states have call successors, (0), 0 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-06 13:47:46,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7941 states to 7941 states and 27008 transitions. [2021-08-06 13:47:46,226 INFO L78 Accepts]: Start accepts. Automaton has 7941 states and 27008 transitions. Word has length 71 [2021-08-06 13:47:46,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:47:46,227 INFO L470 AbstractCegarLoop]: Abstraction has 7941 states and 27008 transitions. [2021-08-06 13:47:46,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:47:46,227 INFO L276 IsEmpty]: Start isEmpty. Operand 7941 states and 27008 transitions. [2021-08-06 13:47:46,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-06 13:47:46,241 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:47:46,241 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:47:46,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-06 13:47:46,241 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:47:46,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:47:46,242 INFO L82 PathProgramCache]: Analyzing trace with hash 48646783, now seen corresponding path program 1 times [2021-08-06 13:47:46,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:47:46,242 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555314673] [2021-08-06 13:47:46,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:47:46,242 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:47:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:47:46,398 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-06 13:47:46,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:47:46,399 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555314673] [2021-08-06 13:47:46,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555314673] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:47:46,399 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:47:46,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-06 13:47:46,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78982369] [2021-08-06 13:47:46,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-06 13:47:46,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:47:46,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-06 13:47:46,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-08-06 13:47:46,400 INFO L87 Difference]: Start difference. First operand 7941 states and 27008 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:47:46,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:47:46,528 INFO L93 Difference]: Finished difference Result 13136 states and 44384 transitions. [2021-08-06 13:47:46,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-06 13:47:46,534 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-08-06 13:47:46,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:47:46,560 INFO L225 Difference]: With dead ends: 13136 [2021-08-06 13:47:46,560 INFO L226 Difference]: Without dead ends: 7501 [2021-08-06 13:47:46,560 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 62.1ms TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-08-06 13:47:46,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7501 states. [2021-08-06 13:47:46,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7501 to 6601. [2021-08-06 13:47:46,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6601 states, 6599 states have (on average 3.3933929383239887) internal successors, (22393), 6600 states have internal predecessors, (22393), 0 states have call successors, (0), 0 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-06 13:47:46,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6601 states to 6601 states and 22393 transitions. [2021-08-06 13:47:46,710 INFO L78 Accepts]: Start accepts. Automaton has 6601 states and 22393 transitions. Word has length 73 [2021-08-06 13:47:46,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:47:46,710 INFO L470 AbstractCegarLoop]: Abstraction has 6601 states and 22393 transitions. [2021-08-06 13:47:46,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:47:46,710 INFO L276 IsEmpty]: Start isEmpty. Operand 6601 states and 22393 transitions. [2021-08-06 13:47:46,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-06 13:47:46,721 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:47:46,722 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:47:46,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-06 13:47:46,722 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:47:46,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:47:46,722 INFO L82 PathProgramCache]: Analyzing trace with hash 753651861, now seen corresponding path program 1 times [2021-08-06 13:47:46,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:47:46,723 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563932820] [2021-08-06 13:47:46,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:47:46,723 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:47:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:47:46,944 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-06 13:47:46,944 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:47:46,945 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563932820] [2021-08-06 13:47:46,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563932820] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:47:46,945 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:47:46,945 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-06 13:47:46,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039949377] [2021-08-06 13:47:46,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-06 13:47:46,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:47:46,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-06 13:47:46,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-08-06 13:47:46,946 INFO L87 Difference]: Start difference. First operand 6601 states and 22393 transitions. Second operand has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:47:47,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:47:47,535 INFO L93 Difference]: Finished difference Result 8435 states and 28376 transitions. [2021-08-06 13:47:47,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-08-06 13:47:47,535 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-08-06 13:47:47,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:47:47,555 INFO L225 Difference]: With dead ends: 8435 [2021-08-06 13:47:47,555 INFO L226 Difference]: Without dead ends: 7555 [2021-08-06 13:47:47,556 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 409.8ms TimeCoverageRelationStatistics Valid=198, Invalid=558, Unknown=0, NotChecked=0, Total=756 [2021-08-06 13:47:47,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7555 states. [2021-08-06 13:47:47,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7555 to 6301. [2021-08-06 13:47:47,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6301 states, 6299 states have (on average 3.383552944911891) internal successors, (21313), 6300 states have internal predecessors, (21313), 0 states have call successors, (0), 0 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-06 13:47:47,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6301 states to 6301 states and 21313 transitions. [2021-08-06 13:47:47,677 INFO L78 Accepts]: Start accepts. Automaton has 6301 states and 21313 transitions. Word has length 73 [2021-08-06 13:47:47,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:47:47,677 INFO L470 AbstractCegarLoop]: Abstraction has 6301 states and 21313 transitions. [2021-08-06 13:47:47,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:47:47,677 INFO L276 IsEmpty]: Start isEmpty. Operand 6301 states and 21313 transitions. [2021-08-06 13:47:47,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-06 13:47:47,686 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:47:47,686 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:47:47,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-06 13:47:47,687 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:47:47,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:47:47,687 INFO L82 PathProgramCache]: Analyzing trace with hash 196952609, now seen corresponding path program 2 times [2021-08-06 13:47:47,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:47:47,687 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308538958] [2021-08-06 13:47:47,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:47:47,687 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:47:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:47:47,755 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-06 13:47:47,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:47:47,755 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308538958] [2021-08-06 13:47:47,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308538958] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:47:47,755 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:47:47,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-06 13:47:47,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944645146] [2021-08-06 13:47:47,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-06 13:47:47,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:47:47,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-06 13:47:47,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-06 13:47:47,756 INFO L87 Difference]: Start difference. First operand 6301 states and 21313 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:47:47,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:47:47,848 INFO L93 Difference]: Finished difference Result 8591 states and 29040 transitions. [2021-08-06 13:47:47,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-06 13:47:47,848 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-08-06 13:47:47,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:47:47,858 INFO L225 Difference]: With dead ends: 8591 [2021-08-06 13:47:47,859 INFO L226 Difference]: Without dead ends: 4094 [2021-08-06 13:47:47,859 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 50.0ms TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-08-06 13:47:47,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4094 states. [2021-08-06 13:47:47,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4094 to 4094. [2021-08-06 13:47:47,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4094 states, 4093 states have (on average 3.3288541412167114) internal successors, (13625), 4093 states have internal predecessors, (13625), 0 states have call successors, (0), 0 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-06 13:47:47,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4094 states to 4094 states and 13625 transitions. [2021-08-06 13:47:47,985 INFO L78 Accepts]: Start accepts. Automaton has 4094 states and 13625 transitions. Word has length 73 [2021-08-06 13:47:47,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:47:47,986 INFO L470 AbstractCegarLoop]: Abstraction has 4094 states and 13625 transitions. [2021-08-06 13:47:47,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:47:47,986 INFO L276 IsEmpty]: Start isEmpty. Operand 4094 states and 13625 transitions. [2021-08-06 13:47:47,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-06 13:47:47,996 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:47:47,996 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:47:47,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-06 13:47:47,997 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:47:47,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:47:47,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1337634712, now seen corresponding path program 1 times [2021-08-06 13:47:47,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:47:47,997 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818478816] [2021-08-06 13:47:47,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:47:47,998 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:47:48,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:47:48,114 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-06 13:47:48,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:47:48,115 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818478816] [2021-08-06 13:47:48,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818478816] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:47:48,115 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:47:48,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-06 13:47:48,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343508103] [2021-08-06 13:47:48,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-06 13:47:48,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:47:48,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-06 13:47:48,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-06 13:47:48,116 INFO L87 Difference]: Start difference. First operand 4094 states and 13625 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:47:48,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:47:48,225 INFO L93 Difference]: Finished difference Result 4544 states and 15020 transitions. [2021-08-06 13:47:48,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-06 13:47:48,226 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-08-06 13:47:48,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:47:48,235 INFO L225 Difference]: With dead ends: 4544 [2021-08-06 13:47:48,236 INFO L226 Difference]: Without dead ends: 3944 [2021-08-06 13:47:48,236 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 73.6ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-08-06 13:47:48,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3944 states. [2021-08-06 13:47:48,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3944 to 3719. [2021-08-06 13:47:48,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3719 states, 3718 states have (on average 3.3082302313071543) internal successors, (12300), 3718 states have internal predecessors, (12300), 0 states have call successors, (0), 0 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-06 13:47:48,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3719 states to 3719 states and 12300 transitions. [2021-08-06 13:47:48,318 INFO L78 Accepts]: Start accepts. Automaton has 3719 states and 12300 transitions. Word has length 75 [2021-08-06 13:47:48,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:47:48,318 INFO L470 AbstractCegarLoop]: Abstraction has 3719 states and 12300 transitions. [2021-08-06 13:47:48,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:47:48,319 INFO L276 IsEmpty]: Start isEmpty. Operand 3719 states and 12300 transitions. [2021-08-06 13:47:48,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-08-06 13:47:48,325 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:47:48,325 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:47:48,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-06 13:47:48,326 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:47:48,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:47:48,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1474858749, now seen corresponding path program 1 times [2021-08-06 13:47:48,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:47:48,326 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101931890] [2021-08-06 13:47:48,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:47:48,326 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:47:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:47:48,420 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-06 13:47:48,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:47:48,421 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101931890] [2021-08-06 13:47:48,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101931890] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:47:48,421 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:47:48,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-06 13:47:48,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741456245] [2021-08-06 13:47:48,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-06 13:47:48,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:47:48,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-06 13:47:48,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-08-06 13:47:48,422 INFO L87 Difference]: Start difference. First operand 3719 states and 12300 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:47:48,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:47:48,508 INFO L93 Difference]: Finished difference Result 5344 states and 17700 transitions. [2021-08-06 13:47:48,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-06 13:47:48,508 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-08-06 13:47:48,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:47:48,514 INFO L225 Difference]: With dead ends: 5344 [2021-08-06 13:47:48,515 INFO L226 Difference]: Without dead ends: 2869 [2021-08-06 13:47:48,515 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 64.8ms TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-08-06 13:47:48,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2869 states. [2021-08-06 13:47:48,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2869 to 2869. [2021-08-06 13:47:48,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2869 states, 2868 states have (on average 3.2496513249651326) internal successors, (9320), 2868 states have internal predecessors, (9320), 0 states have call successors, (0), 0 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-06 13:47:48,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2869 states to 2869 states and 9320 transitions. [2021-08-06 13:47:48,569 INFO L78 Accepts]: Start accepts. Automaton has 2869 states and 9320 transitions. Word has length 76 [2021-08-06 13:47:48,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:47:48,569 INFO L470 AbstractCegarLoop]: Abstraction has 2869 states and 9320 transitions. [2021-08-06 13:47:48,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:47:48,570 INFO L276 IsEmpty]: Start isEmpty. Operand 2869 states and 9320 transitions. [2021-08-06 13:47:48,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-08-06 13:47:48,575 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:47:48,575 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:47:48,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-06 13:47:48,575 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:47:48,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:47:48,575 INFO L82 PathProgramCache]: Analyzing trace with hash 933513811, now seen corresponding path program 2 times [2021-08-06 13:47:48,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:47:48,576 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160399802] [2021-08-06 13:47:48,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:47:48,576 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:47:48,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:47:48,672 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-06 13:47:48,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:47:48,673 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160399802] [2021-08-06 13:47:48,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160399802] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:47:48,673 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:47:48,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-06 13:47:48,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580242423] [2021-08-06 13:47:48,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-06 13:47:48,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:47:48,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-06 13:47:48,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-06 13:47:48,674 INFO L87 Difference]: Start difference. First operand 2869 states and 9320 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:47:48,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:47:48,772 INFO L93 Difference]: Finished difference Result 3449 states and 11059 transitions. [2021-08-06 13:47:48,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-06 13:47:48,773 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-08-06 13:47:48,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:47:48,778 INFO L225 Difference]: With dead ends: 3449 [2021-08-06 13:47:48,778 INFO L226 Difference]: Without dead ends: 2581 [2021-08-06 13:47:48,778 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 63.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-06 13:47:48,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2581 states. [2021-08-06 13:47:48,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2581 to 2581. [2021-08-06 13:47:48,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2581 states, 2580 states have (on average 3.2077519379844963) internal successors, (8276), 2580 states have internal predecessors, (8276), 0 states have call successors, (0), 0 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-06 13:47:48,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2581 states to 2581 states and 8276 transitions. [2021-08-06 13:47:48,827 INFO L78 Accepts]: Start accepts. Automaton has 2581 states and 8276 transitions. Word has length 76 [2021-08-06 13:47:48,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:47:48,827 INFO L470 AbstractCegarLoop]: Abstraction has 2581 states and 8276 transitions. [2021-08-06 13:47:48,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:47:48,828 INFO L276 IsEmpty]: Start isEmpty. Operand 2581 states and 8276 transitions. [2021-08-06 13:47:48,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-08-06 13:47:48,832 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:47:48,832 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-06 13:47:48,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-06 13:47:48,832 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:47:48,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:47:48,833 INFO L82 PathProgramCache]: Analyzing trace with hash -2084857326, now seen corresponding path program 1 times [2021-08-06 13:47:48,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:47:48,833 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160243175] [2021-08-06 13:47:48,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:47:48,833 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:47:48,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:47:48,907 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-06 13:47:48,907 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:47:48,907 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160243175] [2021-08-06 13:47:48,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160243175] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:47:48,907 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:47:48,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-06 13:47:48,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26937444] [2021-08-06 13:47:48,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-06 13:47:48,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:47:48,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-06 13:47:48,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-06 13:47:48,909 INFO L87 Difference]: Start difference. First operand 2581 states and 8276 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 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-06 13:47:49,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:47:49,006 INFO L93 Difference]: Finished difference Result 2605 states and 8115 transitions. [2021-08-06 13:47:49,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-06 13:47:49,006 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 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-06 13:47:49,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:47:49,010 INFO L225 Difference]: With dead ends: 2605 [2021-08-06 13:47:49,010 INFO L226 Difference]: Without dead ends: 1897 [2021-08-06 13:47:49,010 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 64.5ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-08-06 13:47:49,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2021-08-06 13:47:49,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1897. [2021-08-06 13:47:49,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1897 states, 1896 states have (on average 3.070675105485232) internal successors, (5822), 1896 states have internal predecessors, (5822), 0 states have call successors, (0), 0 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-06 13:47:49,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 5822 transitions. [2021-08-06 13:47:49,054 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 5822 transitions. Word has length 78 [2021-08-06 13:47:49,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:47:49,055 INFO L470 AbstractCegarLoop]: Abstraction has 1897 states and 5822 transitions. [2021-08-06 13:47:49,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 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-06 13:47:49,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 5822 transitions. [2021-08-06 13:47:49,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-08-06 13:47:49,058 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:47:49,058 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] [2021-08-06 13:47:49,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-06 13:47:49,058 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:47:49,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:47:49,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1606360435, now seen corresponding path program 1 times [2021-08-06 13:47:49,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:47:49,059 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130126706] [2021-08-06 13:47:49,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:47:49,059 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:47:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:47:49,134 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-06 13:47:49,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:47:49,134 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130126706] [2021-08-06 13:47:49,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130126706] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:47:49,134 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:47:49,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-06 13:47:49,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725377383] [2021-08-06 13:47:49,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-06 13:47:49,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:47:49,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-06 13:47:49,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-06 13:47:49,135 INFO L87 Difference]: Start difference. First operand 1897 states and 5822 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 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-06 13:47:49,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:47:49,238 INFO L93 Difference]: Finished difference Result 1537 states and 4559 transitions. [2021-08-06 13:47:49,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-06 13:47:49,238 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2021-08-06 13:47:49,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:47:49,240 INFO L225 Difference]: With dead ends: 1537 [2021-08-06 13:47:49,240 INFO L226 Difference]: Without dead ends: 1141 [2021-08-06 13:47:49,240 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 75.6ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-08-06 13:47:49,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2021-08-06 13:47:49,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1141. [2021-08-06 13:47:49,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 1140 states have (on average 2.8964912280701753) internal successors, (3302), 1140 states have internal predecessors, (3302), 0 states have call successors, (0), 0 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-06 13:47:49,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 3302 transitions. [2021-08-06 13:47:49,260 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 3302 transitions. Word has length 80 [2021-08-06 13:47:49,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:47:49,260 INFO L470 AbstractCegarLoop]: Abstraction has 1141 states and 3302 transitions. [2021-08-06 13:47:49,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 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-06 13:47:49,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 3302 transitions. [2021-08-06 13:47:49,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-08-06 13:47:49,262 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:47:49,262 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:47:49,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-06 13:47:49,262 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:47:49,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:47:49,263 INFO L82 PathProgramCache]: Analyzing trace with hash 328140404, now seen corresponding path program 1 times [2021-08-06 13:47:49,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:47:49,263 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144448541] [2021-08-06 13:47:49,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:47:49,263 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:47:49,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:47:49,518 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-06 13:47:49,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:47:49,518 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144448541] [2021-08-06 13:47:49,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144448541] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:47:49,518 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:47:49,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-06 13:47:49,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098509307] [2021-08-06 13:47:49,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-06 13:47:49,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:47:49,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-06 13:47:49,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-08-06 13:47:49,519 INFO L87 Difference]: Start difference. First operand 1141 states and 3302 transitions. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:47:49,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:47:49,690 INFO L93 Difference]: Finished difference Result 2311 states and 6812 transitions. [2021-08-06 13:47:49,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-06 13:47:49,690 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-08-06 13:47:49,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:47:49,693 INFO L225 Difference]: With dead ends: 2311 [2021-08-06 13:47:49,693 INFO L226 Difference]: Without dead ends: 1493 [2021-08-06 13:47:49,693 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 132.2ms TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2021-08-06 13:47:49,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2021-08-06 13:47:49,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 977. [2021-08-06 13:47:49,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 2.8709016393442623) internal successors, (2802), 976 states have internal predecessors, (2802), 0 states have call successors, (0), 0 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-06 13:47:49,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 2802 transitions. [2021-08-06 13:47:49,708 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 2802 transitions. Word has length 82 [2021-08-06 13:47:49,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:47:49,708 INFO L470 AbstractCegarLoop]: Abstraction has 977 states and 2802 transitions. [2021-08-06 13:47:49,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:47:49,708 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 2802 transitions. [2021-08-06 13:47:49,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-08-06 13:47:49,710 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:47:49,710 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:47:49,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-06 13:47:49,710 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:47:49,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:47:49,710 INFO L82 PathProgramCache]: Analyzing trace with hash -127423018, now seen corresponding path program 2 times [2021-08-06 13:47:49,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:47:49,710 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250914657] [2021-08-06 13:47:49,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:47:49,711 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:47:49,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:47:49,869 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-06 13:47:49,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:47:49,869 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250914657] [2021-08-06 13:47:49,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250914657] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:47:49,869 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:47:49,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-06 13:47:49,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012889448] [2021-08-06 13:47:49,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-06 13:47:49,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:47:49,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-06 13:47:49,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-08-06 13:47:49,870 INFO L87 Difference]: Start difference. First operand 977 states and 2802 transitions. Second operand has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:47:50,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:47:50,056 INFO L93 Difference]: Finished difference Result 1439 states and 4172 transitions. [2021-08-06 13:47:50,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-06 13:47:50,056 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-08-06 13:47:50,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:47:50,058 INFO L225 Difference]: With dead ends: 1439 [2021-08-06 13:47:50,058 INFO L226 Difference]: Without dead ends: 833 [2021-08-06 13:47:50,058 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 141.1ms TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2021-08-06 13:47:50,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2021-08-06 13:47:50,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 833. [2021-08-06 13:47:50,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 832 states have (on average 2.7764423076923075) internal successors, (2310), 832 states have internal predecessors, (2310), 0 states have call successors, (0), 0 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-06 13:47:50,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 2310 transitions. [2021-08-06 13:47:50,068 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 2310 transitions. Word has length 82 [2021-08-06 13:47:50,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:47:50,068 INFO L470 AbstractCegarLoop]: Abstraction has 833 states and 2310 transitions. [2021-08-06 13:47:50,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:47:50,069 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 2310 transitions. [2021-08-06 13:47:50,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-08-06 13:47:50,070 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:47:50,070 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:47:50,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-06 13:47:50,070 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:47:50,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:47:50,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1344632278, now seen corresponding path program 3 times [2021-08-06 13:47:50,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:47:50,071 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481320488] [2021-08-06 13:47:50,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:47:50,071 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:47:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-06 13:47:50,094 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-06 13:47:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-06 13:47:50,144 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-06 13:47:50,144 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-06 13:47:50,145 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-06 13:47:50,146 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-08-06 13:47:50,146 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-08-06 13:47:50,146 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-08-06 13:47:50,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-06 13:47:50,149 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2021-08-06 13:47:50,151 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-06 13:47:50,151 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-06 13:47:50,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.08 01:47:50 BasicIcfg [2021-08-06 13:47:50,241 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-06 13:47:50,242 INFO L168 Benchmark]: Toolchain (without parser) took 9339.74 ms. Allocated memory was 192.9 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 156.6 MB in the beginning and 830.8 MB in the end (delta: -674.2 MB). Peak memory consumption was 564.2 MB. Max. memory is 8.0 GB. [2021-08-06 13:47:50,242 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 192.9 MB. Free memory is still 174.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-06 13:47:50,242 INFO L168 Benchmark]: CACSL2BoogieTranslator took 400.98 ms. Allocated memory is still 192.9 MB. Free memory was 156.4 MB in the beginning and 163.8 MB in the end (delta: -7.4 MB). Peak memory consumption was 13.8 MB. Max. memory is 8.0 GB. [2021-08-06 13:47:50,242 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.71 ms. Allocated memory is still 192.9 MB. Free memory was 163.8 MB in the beginning and 161.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-06 13:47:50,242 INFO L168 Benchmark]: Boogie Preprocessor took 48.64 ms. Allocated memory is still 192.9 MB. Free memory was 161.2 MB in the beginning and 159.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-06 13:47:50,242 INFO L168 Benchmark]: RCFGBuilder took 1485.22 ms. Allocated memory is still 192.9 MB. Free memory was 159.1 MB in the beginning and 67.1 MB in the end (delta: 92.0 MB). Peak memory consumption was 99.4 MB. Max. memory is 8.0 GB. [2021-08-06 13:47:50,242 INFO L168 Benchmark]: TraceAbstraction took 7352.76 ms. Allocated memory was 192.9 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 66.6 MB in the beginning and 830.8 MB in the end (delta: -764.2 MB). Peak memory consumption was 473.1 MB. Max. memory is 8.0 GB. [2021-08-06 13:47:50,242 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.11 ms. Allocated memory is still 192.9 MB. Free memory is still 174.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 400.98 ms. Allocated memory is still 192.9 MB. Free memory was 156.4 MB in the beginning and 163.8 MB in the end (delta: -7.4 MB). Peak memory consumption was 13.8 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 47.71 ms. Allocated memory is still 192.9 MB. Free memory was 163.8 MB in the beginning and 161.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 48.64 ms. Allocated memory is still 192.9 MB. Free memory was 161.2 MB in the beginning and 159.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1485.22 ms. Allocated memory is still 192.9 MB. Free memory was 159.1 MB in the beginning and 67.1 MB in the end (delta: 92.0 MB). Peak memory consumption was 99.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 7352.76 ms. Allocated memory was 192.9 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 66.6 MB in the beginning and 830.8 MB in the end (delta: -764.2 MB). Peak memory consumption was 473.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_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L716] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L721] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L722] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L723] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L724] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L725] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L726] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L727] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L728] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L729] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L730] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L731] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L732] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L733] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L734] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L735] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L736] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L738] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L739] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L740] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L829] 0 pthread_t t1840; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L830] FCALL, FORK 0 pthread_create(&t1840, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L831] 0 pthread_t t1841; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L832] FCALL, FORK 0 pthread_create(&t1841, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L833] 0 pthread_t t1842; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 1 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L834] FCALL, FORK 0 pthread_create(&t1842, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L801] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L811] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L744] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EBX = x [L759] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L791] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L840] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L840] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L840] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L840] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L841] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L842] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L843] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L844] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L847] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L19] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L19] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 834]: 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: 830]: 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: 832]: 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 for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 132 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 7142.6ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 156.5ms, AutomataDifference: 2867.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 197.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1807 SDtfs, 2748 SDslu, 6858 SDs, 0 SdLazy, 820 SolverSat, 163 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 632.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 189 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 1636.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=9471occurred in iteration=1, InterpolantAutomatonStates: 147, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1663.7ms AutomataMinimizationTime, 13 MinimizatonAttempts, 7425 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 34.9ms SsaConstructionTime, 366.2ms SatisfiabilityAnalysisTime, 1609.1ms InterpolantComputationTime, 1059 NumberOfCodeBlocks, 1059 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 964 ConstructedInterpolants, 0 QuantifiedInterpolants, 4960 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-06 13:47:50,267 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...